/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/14_spin2003.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:17:06,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:17:07,038 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:17:07,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:17:07,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:17:07,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:17:07,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:17:07,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:17:07,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:17:07,066 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:17:07,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:17:07,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:17:07,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:17:07,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:17:07,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:17:07,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:17:07,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:17:07,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:17:07,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:17:07,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:17:07,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:17:07,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:17:07,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:17:07,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:17:07,070 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:17:07,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:17:07,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:17:07,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:17:07,318 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:17:07,318 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:17:07,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-04-13 19:17:08,645 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c726e55f/b1071ab6ca8d4a068a51fcf05621b304/FLAGfcd84326c [2025-04-13 19:17:08,877 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:17:08,879 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-04-13 19:17:08,894 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c726e55f/b1071ab6ca8d4a068a51fcf05621b304/FLAGfcd84326c [2025-04-13 19:17:09,646 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c726e55f/b1071ab6ca8d4a068a51fcf05621b304 [2025-04-13 19:17:09,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:17:09,650 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:17:09,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:17:09,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:17:09,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:17:09,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:09,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f1ac522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09, skipping insertion in model container [2025-04-13 19:17:09,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:09,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:17:09,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i[30419,30432] [2025-04-13 19:17:09,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:17:09,906 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:17:09,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i[30419,30432] [2025-04-13 19:17:09,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:17:09,965 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:17:09,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09 WrapperNode [2025-04-13 19:17:09,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:17:09,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:17:09,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:17:09,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:17:09,972 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:17:09" (1/1) ... [2025-04-13 19:17:09,980 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:17:09" (1/1) ... [2025-04-13 19:17:09,996 INFO L138 Inliner]: procedures = 161, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 22 [2025-04-13 19:17:09,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:17:09,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:17:09,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:17:09,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:17:10,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,019 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:17:10,019 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,019 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:17:10,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:17:10,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:17:10,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:17:10,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (1/1) ... [2025-04-13 19:17:10,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:17:10,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:17:10,060 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:17:10,062 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:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 19:17:10,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 19:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:17:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:17:10,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:17:10,079 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:17:10,172 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:17:10,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:17:10,262 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:17:10,263 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:17:10,263 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:17:10,353 INFO L313 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-13 19:17:10,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:17:10 BoogieIcfgContainer [2025-04-13 19:17:10,354 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:17:10,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:17:10,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:17:10,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:17:10,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:17:09" (1/3) ... [2025-04-13 19:17:10,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df2964e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:17:10, skipping insertion in model container [2025-04-13 19:17:10,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:17:09" (2/3) ... [2025-04-13 19:17:10,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df2964e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:17:10, skipping insertion in model container [2025-04-13 19:17:10,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:17:10" (3/3) ... [2025-04-13 19:17:10,362 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-04-13 19:17:10,373 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:17:10,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 11 locations, 10 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 19:17:10,374 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:17:10,407 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:10,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 11 transitions, 26 flow [2025-04-13 19:17:10,458 INFO L116 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-04-13 19:17:10,463 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:17:10,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 13 events. 0/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 19:17:10,465 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 11 transitions, 26 flow [2025-04-13 19:17:10,469 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 11 transitions, 26 flow [2025-04-13 19:17:10,474 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:10,483 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;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:10,483 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 19:17:10,487 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:10,487 INFO L116 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-04-13 19:17:10,487 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:17:10,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:10,489 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-04-13 19:17:10,489 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-13 19:17:10,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:10,493 INFO L85 PathProgramCache]: Analyzing trace with hash 121086105, now seen corresponding path program 1 times [2025-04-13 19:17:10,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:10,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843745487] [2025-04-13 19:17:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:10,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:17:10,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:17:10,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:10,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:10,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:10,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 19:17:10,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 19:17:10,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:10,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:10,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:10,596 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:10,597 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-13 19:17:10,598 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-13 19:17:10,598 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-13 19:17:10,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:17:10,600 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 19:17:10,603 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:10,603 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 19:17:10,615 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:10,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 46 flow [2025-04-13 19:17:10,622 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-13 19:17:10,622 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:17:10,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-04-13 19:17:10,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 46 flow [2025-04-13 19:17:10,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 46 flow [2025-04-13 19:17:10,623 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:10,623 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:10,623 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 19:17:10,630 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:10,630 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 19:17:10,630 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:17:10,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:10,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:17:10,630 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:17:10,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash -8605417, now seen corresponding path program 1 times [2025-04-13 19:17:10,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:10,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206011618] [2025-04-13 19:17:10,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:17:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:17:10,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:10,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:10,712 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:17:10,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:10,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206011618] [2025-04-13 19:17:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206011618] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:10,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:10,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:17:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875274294] [2025-04-13 19:17:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:10,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:17:10,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:10,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:17:10,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:17:10,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 18 [2025-04-13 19:17:10,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:10,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:10,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 18 [2025-04-13 19:17:10,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:10,801 INFO L116 PetriNetUnfolderBase]: 64/133 cut-off events. [2025-04-13 19:17:10,801 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-13 19:17:10,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 133 events. 64/133 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 434 event pairs, 64 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 165. Up to 127 conditions per place. [2025-04-13 19:17:10,804 INFO L140 encePairwiseOnDemand]: 15/18 looper letters, 12 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-04-13 19:17:10,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 64 flow [2025-04-13 19:17:10,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:17:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:17:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2025-04-13 19:17:10,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-13 19:17:10,815 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 2 states and 21 transitions. [2025-04-13 19:17:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 64 flow [2025-04-13 19:17:10,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 15 transitions, 64 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:10,820 INFO L231 Difference]: Finished difference. Result has 21 places, 15 transitions, 40 flow [2025-04-13 19:17:10,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=15} [2025-04-13 19:17:10,824 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2025-04-13 19:17:10,825 INFO L485 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 40 flow [2025-04-13 19:17:10,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:10,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:10,825 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1] [2025-04-13 19:17:10,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:17:10,825 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:17:10,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -267118997, now seen corresponding path program 1 times [2025-04-13 19:17:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:10,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667009981] [2025-04-13 19:17:10,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:10,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:17:10,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:17:10,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:10,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:10,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:10,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:17:10,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:17:10,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:10,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:10,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:10,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:10,867 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-04-13 19:17:10,867 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-04-13 19:17:10,867 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-04-13 19:17:10,867 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 19:17:10,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:17:10,867 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:17:10,868 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:10,868 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 19:17:10,893 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:10,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 68 flow [2025-04-13 19:17:10,902 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-13 19:17:10,902 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-13 19:17:10,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 0/31 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-04-13 19:17:10,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 25 transitions, 68 flow [2025-04-13 19:17:10,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 68 flow [2025-04-13 19:17:10,909 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:10,909 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;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:10,909 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:17:10,913 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:10,913 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:17:10,913 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:17:10,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:10,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:17:10,913 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:17:10,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 731159729, now seen corresponding path program 1 times [2025-04-13 19:17:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:10,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603960984] [2025-04-13 19:17:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:10,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:17:10,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:17:10,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:10,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:10,951 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:17:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:10,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603960984] [2025-04-13 19:17:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603960984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:10,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:10,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:17:10,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609875666] [2025-04-13 19:17:10,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:10,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:17:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:10,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:17:10,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:17:10,952 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2025-04-13 19:17:10,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 68 flow. Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:10,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:10,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2025-04-13 19:17:10,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:11,087 INFO L116 PetriNetUnfolderBase]: 564/897 cut-off events. [2025-04-13 19:17:11,088 INFO L117 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-04-13 19:17:11,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 897 events. 564/897 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3907 event pairs, 564 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 653. Up to 877 conditions per place. [2025-04-13 19:17:11,097 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 17 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2025-04-13 19:17:11,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 94 flow [2025-04-13 19:17:11,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:17:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:17:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 19:17:11,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-04-13 19:17:11,098 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 68 flow. Second operand 2 states and 29 transitions. [2025-04-13 19:17:11,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 94 flow [2025-04-13 19:17:11,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 92 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:11,101 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-04-13 19:17:11,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-04-13 19:17:11,102 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2025-04-13 19:17:11,102 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-04-13 19:17:11,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:11,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:11,102 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-13 19:17:11,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:17:11,102 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:17:11,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1868528529, now seen corresponding path program 1 times [2025-04-13 19:17:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:11,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813623297] [2025-04-13 19:17:11,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:11,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:11,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:17:11,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:17:11,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:11,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:11,123 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:11,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 19:17:11,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 19:17:11,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:11,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:11,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:11,143 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:11,143 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 19:17:11,143 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:17:11,143 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 19:17:11,144 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 19:17:11,144 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:17:11,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:17:11,144 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:17:11,144 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:11,144 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 19:17:11,161 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:11,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2025-04-13 19:17:11,167 INFO L116 PetriNetUnfolderBase]: 0/40 cut-off events. [2025-04-13 19:17:11,168 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 19:17:11,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 40 events. 0/40 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-04-13 19:17:11,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2025-04-13 19:17:11,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 92 flow [2025-04-13 19:17:11,170 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:11,170 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;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:11,170 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:17:11,172 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:11,172 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 19:17:11,172 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:17:11,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:11,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:17:11,173 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:17:11,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1678015025, now seen corresponding path program 1 times [2025-04-13 19:17:11,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:11,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260289381] [2025-04-13 19:17:11,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:11,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:11,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:17:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:17:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:11,206 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:17:11,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:11,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260289381] [2025-04-13 19:17:11,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260289381] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:11,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:11,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:17:11,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040252279] [2025-04-13 19:17:11,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:11,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:17:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:11,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:17:11,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:17:11,207 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-04-13 19:17:11,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:11,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:11,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-04-13 19:17:11,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:11,574 INFO L116 PetriNetUnfolderBase]: 4064/5725 cut-off events. [2025-04-13 19:17:11,574 INFO L117 PetriNetUnfolderBase]: For 1711/1711 co-relation queries the response was YES. [2025-04-13 19:17:11,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12099 conditions, 5725 events. 4064/5725 cut-off events. For 1711/1711 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28794 event pairs, 4064 based on Foata normal form. 0/5674 useless extension candidates. Maximal degree in co-relation 1919. Up to 5627 conditions per place. [2025-04-13 19:17:11,602 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2025-04-13 19:17:11,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 126 flow [2025-04-13 19:17:11,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:17:11,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:17:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2025-04-13 19:17:11,603 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-04-13 19:17:11,603 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 92 flow. Second operand 2 states and 37 transitions. [2025-04-13 19:17:11,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 126 flow [2025-04-13 19:17:11,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 120 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:11,605 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 76 flow [2025-04-13 19:17:11,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=76, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2025-04-13 19:17:11,605 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-04-13 19:17:11,605 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 76 flow [2025-04-13 19:17:11,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:11,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:11,606 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:11,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:17:11,606 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:17:11,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1282410667, now seen corresponding path program 1 times [2025-04-13 19:17:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:11,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624116472] [2025-04-13 19:17:11,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:11,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:17:11,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:17:11,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:11,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:11,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:11,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:17:11,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:17:11,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:11,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:11,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:11,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:11,670 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 19:17:11,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:17:11,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 19:17:11,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 19:17:11,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 19:17:11,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:17:11,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:17:11,671 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:17:11,671 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:11,671 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-13 19:17:11,692 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 118 flow [2025-04-13 19:17:11,700 INFO L116 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-04-13 19:17:11,701 INFO L117 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-04-13 19:17:11,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 49 events. 0/49 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2025-04-13 19:17:11,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 39 transitions, 118 flow [2025-04-13 19:17:11,701 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 118 flow [2025-04-13 19:17:11,702 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:11,702 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;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:11,702 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:17:11,704 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:11,704 INFO L116 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-04-13 19:17:11,704 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:17:11,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:11,704 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:17:11,705 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:17:11,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1463024699, now seen corresponding path program 1 times [2025-04-13 19:17:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:11,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024783389] [2025-04-13 19:17:11,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:11,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:11,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:17:11,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:17:11,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:11,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:11,730 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:17:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:11,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024783389] [2025-04-13 19:17:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024783389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:17:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176326756] [2025-04-13 19:17:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:11,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:17:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:11,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:17:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:17:11,731 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2025-04-13 19:17:11,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:11,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:11,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2025-04-13 19:17:11,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:13,715 INFO L116 PetriNetUnfolderBase]: 26564/34865 cut-off events. [2025-04-13 19:17:13,715 INFO L117 PetriNetUnfolderBase]: For 13426/13426 co-relation queries the response was YES. [2025-04-13 19:17:13,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73740 conditions, 34865 events. 26564/34865 cut-off events. For 13426/13426 co-relation queries the response was YES. Maximal size of possible extension queue 1241. Compared 190654 event pairs, 26564 based on Foata normal form. 0/34614 useless extension candidates. Maximal degree in co-relation 12247. Up to 34377 conditions per place. [2025-04-13 19:17:13,895 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 27 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2025-04-13 19:17:13,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 160 flow [2025-04-13 19:17:13,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:17:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:17:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-04-13 19:17:13,896 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2025-04-13 19:17:13,896 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 118 flow. Second operand 2 states and 45 transitions. [2025-04-13 19:17:13,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 160 flow [2025-04-13 19:17:13,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 33 transitions, 148 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:13,906 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 94 flow [2025-04-13 19:17:13,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-04-13 19:17:13,907 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2025-04-13 19:17:13,907 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 94 flow [2025-04-13 19:17:13,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:13,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:13,908 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:13,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:17:13,908 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-04-13 19:17:13,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1256314457, now seen corresponding path program 1 times [2025-04-13 19:17:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:13,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911735621] [2025-04-13 19:17:13,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:13,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:13,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:17:13,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:17:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:13,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:13,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 19:17:13,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 19:17:13,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:13,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:13,935 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:13,935 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 19:17:13,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:17:13,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 19:17:13,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 19:17:13,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 19:17:13,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 19:17:13,937 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:17:13,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:17:13,938 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:17:13,938 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:13,938 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-13 19:17:13,960 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:13,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 146 flow [2025-04-13 19:17:13,966 INFO L116 PetriNetUnfolderBase]: 0/58 cut-off events. [2025-04-13 19:17:13,966 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-13 19:17:13,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 58 events. 0/58 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 152 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2025-04-13 19:17:13,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 146 flow [2025-04-13 19:17:13,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 146 flow [2025-04-13 19:17:13,967 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:13,967 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;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:13,967 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 19:17:13,968 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:13,968 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 19:17:13,968 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:17:13,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:13,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:17:13,968 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:17:13,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:13,968 INFO L85 PathProgramCache]: Analyzing trace with hash -102006977, now seen corresponding path program 1 times [2025-04-13 19:17:13,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:13,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569052343] [2025-04-13 19:17:13,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:13,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:13,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:17:13,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:17:13,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:13,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:13,988 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:17:13,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:13,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569052343] [2025-04-13 19:17:13,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569052343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:13,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:13,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:17:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993346251] [2025-04-13 19:17:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:13,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:17:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:13,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:17:13,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:17:13,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2025-04-13 19:17:13,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:13,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:13,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2025-04-13 19:17:13,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:17:23,120 INFO L116 PetriNetUnfolderBase]: 164064/205565 cut-off events. [2025-04-13 19:17:23,120 INFO L117 PetriNetUnfolderBase]: For 96751/96751 co-relation queries the response was YES. [2025-04-13 19:17:23,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435066 conditions, 205565 events. 164064/205565 cut-off events. For 96751/96751 co-relation queries the response was YES. Maximal size of possible extension queue 5914. Compared 1182985 event pairs, 164064 based on Foata normal form. 0/204314 useless extension candidates. Maximal degree in co-relation 74512. Up to 203127 conditions per place. [2025-04-13 19:17:24,251 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 32 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-04-13 19:17:24,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 39 transitions, 196 flow [2025-04-13 19:17:24,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:17:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:17:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2025-04-13 19:17:24,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2025-04-13 19:17:24,252 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 146 flow. Second operand 2 states and 53 transitions. [2025-04-13 19:17:24,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 39 transitions, 196 flow [2025-04-13 19:17:24,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 39 transitions, 176 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 19:17:24,289 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 112 flow [2025-04-13 19:17:24,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=112, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-04-13 19:17:24,290 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2025-04-13 19:17:24,290 INFO L485 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 112 flow [2025-04-13 19:17:24,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:24,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:24,290 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:17:24,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:17:24,290 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 19:17:24,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:24,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1513169605, now seen corresponding path program 1 times [2025-04-13 19:17:24,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:24,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686317247] [2025-04-13 19:17:24,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:24,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:17:24,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:17:24,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:24,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:24,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:17:24,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:17:24,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:17:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:17:24,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:17:24,322 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-13 19:17:24,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-13 19:17:24,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:17:24,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-13 19:17:24,323 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 19:17:24,323 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-13 19:17:24,345 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:17:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 53 transitions, 176 flow [2025-04-13 19:17:24,351 INFO L116 PetriNetUnfolderBase]: 0/67 cut-off events. [2025-04-13 19:17:24,351 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 19:17:24,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 67 events. 0/67 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 177 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-04-13 19:17:24,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 53 transitions, 176 flow [2025-04-13 19:17:24,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 53 transitions, 176 flow [2025-04-13 19:17:24,352 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:17:24,352 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;@1a4c2a0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:17:24,352 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-13 19:17:24,353 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:17:24,353 INFO L116 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-04-13 19:17:24,353 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:17:24,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:17:24,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:17:24,353 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-13 19:17:24,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:17:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1466112811, now seen corresponding path program 1 times [2025-04-13 19:17:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:17:24,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423929899] [2025-04-13 19:17:24,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:17:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:17:24,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:17:24,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:17:24,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:17:24,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:17:24,378 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:17:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:17:24,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423929899] [2025-04-13 19:17:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423929899] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:17:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:17:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:17:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806856477] [2025-04-13 19:17:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:17:24,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:17:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:17:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:17:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:17:24,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 53 [2025-04-13 19:17:24,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 53 transitions, 176 flow. Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:17:24,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:17:24,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 53 [2025-04-13 19:17:24,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand