/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:37:40,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:37:40,959 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-14 00:37:40,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:37:40,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:37:40,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:37:40,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:37:40,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:37:40,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:37:40,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:37:40,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:37:40,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:37:40,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:37:40,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:37:40,988 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:37:40,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:37:40,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:37:40,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:37:40,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:37:40,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:40,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:40,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:37:40,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:37:40,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:37:41,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:37:41,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:37:41,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:37:41,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:37:41,233 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:37:41,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-04-14 00:37:42,607 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c1ffd9c/e6f54d9eece74a4abea676950c323b64/FLAGcbb0e5e9d [2025-04-14 00:37:42,854 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:37:42,855 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-04-14 00:37:42,861 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c1ffd9c/e6f54d9eece74a4abea676950c323b64/FLAGcbb0e5e9d [2025-04-14 00:37:43,658 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c1ffd9c/e6f54d9eece74a4abea676950c323b64 [2025-04-14 00:37:43,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:37:43,661 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:37:43,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:43,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:37:43,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:37:43,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:43,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339c5988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43, skipping insertion in model container [2025-04-14 00:37:43,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:43,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:37:43,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c[4955,4968] [2025-04-14 00:37:43,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:43,921 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:37:43,960 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c[4955,4968] [2025-04-14 00:37:43,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:43,983 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:37:43,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43 WrapperNode [2025-04-14 00:37:43,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:43,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:43,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:37:43,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:37:43,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:43,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,031 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-04-14 00:37:44,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:44,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:37:44,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:37:44,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:37:44,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,069 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-14 00:37:44,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:37:44,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:37:44,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:37:44,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:37:44,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (1/1) ... [2025-04-14 00:37:44,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:44,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:44,126 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-14 00:37:44,131 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-14 00:37:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:37:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:37:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:37:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:37:44,146 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:37:44,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:37:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:37:44,148 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:37:44,244 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:37:44,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:37:44,697 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:37:44,698 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:37:44,698 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:37:45,323 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:37:45,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:45 BoogieIcfgContainer [2025-04-14 00:37:45,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:37:45,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:37:45,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:37:45,330 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:37:45,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:37:43" (1/3) ... [2025-04-14 00:37:45,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfda01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:45, skipping insertion in model container [2025-04-14 00:37:45,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:43" (2/3) ... [2025-04-14 00:37:45,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfda01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:45, skipping insertion in model container [2025-04-14 00:37:45,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:45" (3/3) ... [2025-04-14 00:37:45,333 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-04-14 00:37:45,345 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:37:45,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 18 locations, 21 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 00:37:45,346 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:37:45,432 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:37:45,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 23 transitions, 60 flow [2025-04-14 00:37:45,487 INFO L116 PetriNetUnfolderBase]: 6/21 cut-off events. [2025-04-14 00:37:45,490 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:45,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 6/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 2 conditions per place. [2025-04-14 00:37:45,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 23 transitions, 60 flow [2025-04-14 00:37:45,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 20 transitions, 52 flow [2025-04-14 00:37:45,502 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:37:45,509 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;@2d4b7c43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:37:45,509 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:37:45,518 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:37:45,519 INFO L116 PetriNetUnfolderBase]: 6/19 cut-off events. [2025-04-14 00:37:45,519 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:45,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:45,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:45,520 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:45,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash -448465384, now seen corresponding path program 1 times [2025-04-14 00:37:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:45,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970115874] [2025-04-14 00:37:45,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:45,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:37:45,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:37:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:45,875 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-14 00:37:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:45,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970115874] [2025-04-14 00:37:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970115874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:45,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:45,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:37:45,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778661485] [2025-04-14 00:37:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:45,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:45,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:45,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:45,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:45,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 20 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 00:37:45,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:45,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:45,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:46,016 INFO L116 PetriNetUnfolderBase]: 54/88 cut-off events. [2025-04-14 00:37:46,016 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:37:46,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 88 events. 54/88 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 22 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 87 conditions per place. [2025-04-14 00:37:46,019 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 18 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2025-04-14 00:37:46,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 22 transitions, 100 flow [2025-04-14 00:37:46,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:46,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-14 00:37:46,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43478260869565216 [2025-04-14 00:37:46,029 INFO L175 Difference]: Start difference. First operand has 21 places, 20 transitions, 52 flow. Second operand 3 states and 30 transitions. [2025-04-14 00:37:46,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 22 transitions, 100 flow [2025-04-14 00:37:46,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:46,036 INFO L231 Difference]: Finished difference. Result has 20 places, 22 transitions, 66 flow [2025-04-14 00:37:46,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=20, PETRI_TRANSITIONS=22} [2025-04-14 00:37:46,041 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-04-14 00:37:46,041 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 22 transitions, 66 flow [2025-04-14 00:37:46,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 00:37:46,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:46,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:46,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:37:46,042 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:46,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:46,043 INFO L85 PathProgramCache]: Analyzing trace with hash 405540836, now seen corresponding path program 1 times [2025-04-14 00:37:46,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:46,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475750444] [2025-04-14 00:37:46,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:46,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:37:46,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:37:46,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:46,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:37:46,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:46,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475750444] [2025-04-14 00:37:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475750444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:46,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681360609] [2025-04-14 00:37:46,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:46,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:37:46,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:37:46,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 00:37:46,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 00:37:46,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:46,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:46,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:37:46,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:37:46,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:37:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:37:46,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681360609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:37:46,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:37:46,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-14 00:37:46,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689403672] [2025-04-14 00:37:46,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:37:46,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:37:46,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:46,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:37:46,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:37:46,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:46,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 22 transitions, 66 flow. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-14 00:37:46,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:46,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:46,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:46,575 INFO L116 PetriNetUnfolderBase]: 54/94 cut-off events. [2025-04-14 00:37:46,575 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:37:46,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 94 events. 54/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 143 event pairs, 22 based on Foata normal form. 3/66 useless extension candidates. Maximal degree in co-relation 181. Up to 87 conditions per place. [2025-04-14 00:37:46,576 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2025-04-14 00:37:46,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 146 flow [2025-04-14 00:37:46,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:37:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:37:46,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2025-04-14 00:37:46,577 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 00:37:46,577 INFO L175 Difference]: Start difference. First operand has 20 places, 22 transitions, 66 flow. Second operand 6 states and 46 transitions. [2025-04-14 00:37:46,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 146 flow [2025-04-14 00:37:46,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:46,578 INFO L231 Difference]: Finished difference. Result has 27 places, 28 transitions, 128 flow [2025-04-14 00:37:46,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=27, PETRI_TRANSITIONS=28} [2025-04-14 00:37:46,579 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2025-04-14 00:37:46,579 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 28 transitions, 128 flow [2025-04-14 00:37:46,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-14 00:37:46,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:46,579 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:46,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:37:46,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:46,784 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:46,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:46,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1517394078, now seen corresponding path program 2 times [2025-04-14 00:37:46,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:46,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950080709] [2025-04-14 00:37:46,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:46,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:46,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:37:46,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 20 statements. [2025-04-14 00:37:46,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:46,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:47,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950080709] [2025-04-14 00:37:47,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950080709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:47,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341240991] [2025-04-14 00:37:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:47,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:47,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:47,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:47,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:47,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:47,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-14 00:37:47,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:47,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:47,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:47,923 INFO L116 PetriNetUnfolderBase]: 59/116 cut-off events. [2025-04-14 00:37:47,923 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:37:47,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 116 events. 59/116 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 254 event pairs, 22 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 217. Up to 87 conditions per place. [2025-04-14 00:37:47,924 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 33 selfloop transitions, 1 changer transitions 6/40 dead transitions. [2025-04-14 00:37:47,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 40 transitions, 237 flow [2025-04-14 00:37:47,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-14 00:37:47,928 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2025-04-14 00:37:47,928 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 128 flow. Second operand 4 states and 42 transitions. [2025-04-14 00:37:47,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 40 transitions, 237 flow [2025-04-14 00:37:47,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 221 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:47,930 INFO L231 Difference]: Finished difference. Result has 31 places, 28 transitions, 121 flow [2025-04-14 00:37:47,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=31, PETRI_TRANSITIONS=28} [2025-04-14 00:37:47,932 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2025-04-14 00:37:47,932 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 28 transitions, 121 flow [2025-04-14 00:37:47,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-14 00:37:47,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:47,932 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:47,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:37:47,933 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:47,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash -910947816, now seen corresponding path program 3 times [2025-04-14 00:37:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:47,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204573750] [2025-04-14 00:37:47,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:37:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:47,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-14 00:37:47,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 20 statements. [2025-04-14 00:37:47,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:37:47,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:48,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:48,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:48,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204573750] [2025-04-14 00:37:48,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204573750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:48,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:48,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:48,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929383968] [2025-04-14 00:37:48,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:48,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:48,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:48,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:48,470 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:48,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-14 00:37:48,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:48,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:48,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:48,663 INFO L116 PetriNetUnfolderBase]: 85/161 cut-off events. [2025-04-14 00:37:48,663 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-14 00:37:48,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 161 events. 85/161 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 443 event pairs, 17 based on Foata normal form. 1/122 useless extension candidates. Maximal degree in co-relation 373. Up to 94 conditions per place. [2025-04-14 00:37:48,664 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 38 selfloop transitions, 8 changer transitions 1/47 dead transitions. [2025-04-14 00:37:48,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 267 flow [2025-04-14 00:37:48,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-14 00:37:48,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2025-04-14 00:37:48,668 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 121 flow. Second operand 4 states and 48 transitions. [2025-04-14 00:37:48,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 267 flow [2025-04-14 00:37:48,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 47 transitions, 261 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:48,669 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 186 flow [2025-04-14 00:37:48,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2025-04-14 00:37:48,670 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2025-04-14 00:37:48,670 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 186 flow [2025-04-14 00:37:48,670 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-14 00:37:48,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:48,670 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:48,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:37:48,670 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:48,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 825574615, now seen corresponding path program 1 times [2025-04-14 00:37:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:48,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646141095] [2025-04-14 00:37:48,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:48,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:48,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:37:48,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:37:48,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:48,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:48,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646141095] [2025-04-14 00:37:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646141095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:48,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544232151] [2025-04-14 00:37:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:48,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:48,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:48,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:48,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:48,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-14 00:37:48,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:48,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:48,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:48,826 INFO L116 PetriNetUnfolderBase]: 65/130 cut-off events. [2025-04-14 00:37:48,826 INFO L117 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-04-14 00:37:48,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 130 events. 65/130 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 309 event pairs, 14 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 369. Up to 97 conditions per place. [2025-04-14 00:37:48,828 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 33 selfloop transitions, 3 changer transitions 4/40 dead transitions. [2025-04-14 00:37:48,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 271 flow [2025-04-14 00:37:48,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-14 00:37:48,830 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-04-14 00:37:48,830 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 186 flow. Second operand 3 states and 35 transitions. [2025-04-14 00:37:48,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 271 flow [2025-04-14 00:37:48,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:37:48,832 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 177 flow [2025-04-14 00:37:48,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-04-14 00:37:48,833 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2025-04-14 00:37:48,833 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 177 flow [2025-04-14 00:37:48,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-14 00:37:48,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:48,833 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:48,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:37:48,833 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:48,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash 965890225, now seen corresponding path program 2 times [2025-04-14 00:37:48,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:48,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806539220] [2025-04-14 00:37:48,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:48,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:48,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:37:48,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 21 statements. [2025-04-14 00:37:48,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:48,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:48,892 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806539220] [2025-04-14 00:37:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806539220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:48,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:48,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:48,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605760154] [2025-04-14 00:37:48,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:48,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:48,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:48,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:48,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:48,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-14 00:37:48,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:48,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:48,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:48,961 INFO L116 PetriNetUnfolderBase]: 59/115 cut-off events. [2025-04-14 00:37:48,962 INFO L117 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-04-14 00:37:48,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 115 events. 59/115 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 223 event pairs, 26 based on Foata normal form. 2/90 useless extension candidates. Maximal degree in co-relation 356. Up to 113 conditions per place. [2025-04-14 00:37:48,964 INFO L140 encePairwiseOnDemand]: 21/23 looper letters, 31 selfloop transitions, 0 changer transitions 2/33 dead transitions. [2025-04-14 00:37:48,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 238 flow [2025-04-14 00:37:48,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-04-14 00:37:48,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-04-14 00:37:48,965 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 177 flow. Second operand 3 states and 27 transitions. [2025-04-14 00:37:48,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 238 flow [2025-04-14 00:37:48,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 218 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:48,966 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 146 flow [2025-04-14 00:37:48,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2025-04-14 00:37:48,967 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 12 predicate places. [2025-04-14 00:37:48,967 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 146 flow [2025-04-14 00:37:48,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-14 00:37:48,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:48,967 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:48,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:37:48,969 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:48,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash -201972858, now seen corresponding path program 1 times [2025-04-14 00:37:48,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:48,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347591510] [2025-04-14 00:37:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:48,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:37:48,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:37:48,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:37:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:49,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347591510] [2025-04-14 00:37:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347591510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:49,096 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550733900] [2025-04-14 00:37:49,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:49,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:37:49,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:37:49,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 00:37:49,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 00:37:49,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:49,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:37:49,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:37:49,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:37:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 00:37:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550733900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:37:49,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:37:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 00:37:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775053485] [2025-04-14 00:37:49,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:37:49,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:37:49,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:49,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:37:49,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:37:49,336 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:49,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 146 flow. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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-14 00:37:49,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:49,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:49,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:49,455 INFO L116 PetriNetUnfolderBase]: 58/114 cut-off events. [2025-04-14 00:37:49,455 INFO L117 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-04-14 00:37:49,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 114 events. 58/114 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 208 event pairs, 26 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 325. Up to 105 conditions per place. [2025-04-14 00:37:49,456 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 21 selfloop transitions, 12 changer transitions 0/33 dead transitions. [2025-04-14 00:37:49,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 224 flow [2025-04-14 00:37:49,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:37:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:37:49,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2025-04-14 00:37:49,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2732919254658385 [2025-04-14 00:37:49,457 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 146 flow. Second operand 7 states and 44 transitions. [2025-04-14 00:37:49,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 224 flow [2025-04-14 00:37:49,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 33 transitions, 222 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-14 00:37:49,459 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 190 flow [2025-04-14 00:37:49,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2025-04-14 00:37:49,459 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 18 predicate places. [2025-04-14 00:37:49,459 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 190 flow [2025-04-14 00:37:49,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 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-14 00:37:49,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:49,460 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:49,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:37:49,660 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-14 00:37:49,660 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:49,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1258728884, now seen corresponding path program 2 times [2025-04-14 00:37:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:49,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103297331] [2025-04-14 00:37:49,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:49,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:49,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:37:49,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-14 00:37:49,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:49,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:37:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:49,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103297331] [2025-04-14 00:37:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103297331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:49,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:49,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:49,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135391372] [2025-04-14 00:37:49,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:49,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:49,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:49,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:49,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:49,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:49,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-14 00:37:49,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:49,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:49,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:49,818 INFO L116 PetriNetUnfolderBase]: 75/143 cut-off events. [2025-04-14 00:37:49,819 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-14 00:37:49,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 143 events. 75/143 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 319 event pairs, 23 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 409. Up to 117 conditions per place. [2025-04-14 00:37:49,820 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 38 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2025-04-14 00:37:49,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 303 flow [2025-04-14 00:37:49,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-04-14 00:37:49,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.463768115942029 [2025-04-14 00:37:49,822 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 190 flow. Second operand 3 states and 32 transitions. [2025-04-14 00:37:49,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 303 flow [2025-04-14 00:37:49,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 279 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:49,824 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 184 flow [2025-04-14 00:37:49,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-04-14 00:37:49,824 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2025-04-14 00:37:49,824 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 184 flow [2025-04-14 00:37:49,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-14 00:37:49,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:49,824 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:49,825 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:37:49,825 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:49,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:49,825 INFO L85 PathProgramCache]: Analyzing trace with hash 319594823, now seen corresponding path program 1 times [2025-04-14 00:37:49,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:49,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115010906] [2025-04-14 00:37:49,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:49,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:49,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 00:37:49,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 00:37:49,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:49,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-14 00:37:49,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:49,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115010906] [2025-04-14 00:37:49,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115010906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:49,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:49,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424557944] [2025-04-14 00:37:49,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:49,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:49,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:49,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:49,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:37:49,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:37:49,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:49,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:37:49,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:50,046 INFO L116 PetriNetUnfolderBase]: 83/158 cut-off events. [2025-04-14 00:37:50,046 INFO L117 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-04-14 00:37:50,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 158 events. 83/158 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 354 event pairs, 33 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 498. Up to 137 conditions per place. [2025-04-14 00:37:50,047 INFO L140 encePairwiseOnDemand]: 20/23 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-04-14 00:37:50,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 286 flow [2025-04-14 00:37:50,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-14 00:37:50,048 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2025-04-14 00:37:50,048 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 184 flow. Second operand 3 states and 31 transitions. [2025-04-14 00:37:50,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 286 flow [2025-04-14 00:37:50,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 277 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:50,049 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 195 flow [2025-04-14 00:37:50,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-04-14 00:37:50,050 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2025-04-14 00:37:50,050 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 195 flow [2025-04-14 00:37:50,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:37:50,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:50,050 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:50,050 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:37:50,050 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:37:50,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -114853306, now seen corresponding path program 1 times [2025-04-14 00:37:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:50,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335587173] [2025-04-14 00:37:50,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:50,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:37:50,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:37:50,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:50,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:37:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:56,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335587173] [2025-04-14 00:37:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335587173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:56,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248265228] [2025-04-14 00:37:56,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:56,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:56,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:56,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:37:56,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:37:56,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:37:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:37:56,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:56,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:56,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 00:37:56,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:57,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:37:57,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 247 [2025-04-14 00:37:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:37:58,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:00,153 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:38:00,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 359 treesize of output 330 [2025-04-14 00:38:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:01,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248265228] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:01,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:01,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 32 [2025-04-14 00:38:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414017510] [2025-04-14 00:38:01,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:01,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:38:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:01,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:38:01,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=948, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:38:01,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:01,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 195 flow. Second operand has 33 states, 33 states have (on average 3.696969696969697) internal successors, (122), 33 states have internal predecessors, (122), 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-14 00:38:01,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:01,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:04,295 INFO L116 PetriNetUnfolderBase]: 310/580 cut-off events. [2025-04-14 00:38:04,296 INFO L117 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2025-04-14 00:38:04,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 580 events. 310/580 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2449 event pairs, 20 based on Foata normal form. 3/452 useless extension candidates. Maximal degree in co-relation 1831. Up to 178 conditions per place. [2025-04-14 00:38:04,300 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 121 selfloop transitions, 78 changer transitions 9/208 dead transitions. [2025-04-14 00:38:04,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 208 transitions, 1367 flow [2025-04-14 00:38:04,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 00:38:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 00:38:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 259 transitions. [2025-04-14 00:38:04,303 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28152173913043477 [2025-04-14 00:38:04,303 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 195 flow. Second operand 40 states and 259 transitions. [2025-04-14 00:38:04,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 208 transitions, 1367 flow [2025-04-14 00:38:04,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 208 transitions, 1298 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-04-14 00:38:04,309 INFO L231 Difference]: Finished difference. Result has 84 places, 102 transitions, 743 flow [2025-04-14 00:38:04,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=743, PETRI_PLACES=84, PETRI_TRANSITIONS=102} [2025-04-14 00:38:04,310 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 63 predicate places. [2025-04-14 00:38:04,310 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 102 transitions, 743 flow [2025-04-14 00:38:04,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.696969696969697) internal successors, (122), 33 states have internal predecessors, (122), 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-14 00:38:04,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:04,310 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:04,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:38:04,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:04,511 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:38:04,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:04,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2063780736, now seen corresponding path program 2 times [2025-04-14 00:38:04,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:04,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627352654] [2025-04-14 00:38:04,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:38:04,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:04,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:38:04,677 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:04,677 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:38:04,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:38:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:09,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627352654] [2025-04-14 00:38:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627352654] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:09,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58255347] [2025-04-14 00:38:09,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:38:09,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:09,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:38:09,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:38:09,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:38:09,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:09,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:38:09,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:09,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-14 00:38:09,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:10,349 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:10,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 302 treesize of output 250 [2025-04-14 00:38:10,667 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:10,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:12,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:12,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 429 treesize of output 395 [2025-04-14 00:38:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58255347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:13,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 7] total 35 [2025-04-14 00:38:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611062541] [2025-04-14 00:38:13,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:13,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 00:38:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:13,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 00:38:13,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 00:38:13,704 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 102 transitions, 743 flow. Second operand has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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-14 00:38:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:16,467 INFO L116 PetriNetUnfolderBase]: 462/878 cut-off events. [2025-04-14 00:38:16,467 INFO L117 PetriNetUnfolderBase]: For 1653/1653 co-relation queries the response was YES. [2025-04-14 00:38:16,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 878 events. 462/878 cut-off events. For 1653/1653 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4231 event pairs, 42 based on Foata normal form. 6/754 useless extension candidates. Maximal degree in co-relation 3469. Up to 287 conditions per place. [2025-04-14 00:38:16,472 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 80 selfloop transitions, 100 changer transitions 26/206 dead transitions. [2025-04-14 00:38:16,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 206 transitions, 1746 flow [2025-04-14 00:38:16,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:38:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:38:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 149 transitions. [2025-04-14 00:38:16,473 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2491638795986622 [2025-04-14 00:38:16,473 INFO L175 Difference]: Start difference. First operand has 84 places, 102 transitions, 743 flow. Second operand 26 states and 149 transitions. [2025-04-14 00:38:16,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 206 transitions, 1746 flow [2025-04-14 00:38:16,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 206 transitions, 1438 flow, removed 109 selfloop flow, removed 12 redundant places. [2025-04-14 00:38:16,482 INFO L231 Difference]: Finished difference. Result has 107 places, 146 transitions, 1173 flow [2025-04-14 00:38:16,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1173, PETRI_PLACES=107, PETRI_TRANSITIONS=146} [2025-04-14 00:38:16,483 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2025-04-14 00:38:16,483 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 146 transitions, 1173 flow [2025-04-14 00:38:16,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.7222222222222223) internal successors, (134), 36 states have internal predecessors, (134), 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-14 00:38:16,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:16,483 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:16,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:38:16,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:16,684 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:38:16,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:16,684 INFO L85 PathProgramCache]: Analyzing trace with hash -315246478, now seen corresponding path program 3 times [2025-04-14 00:38:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:16,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136852782] [2025-04-14 00:38:16,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:38:16,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:16,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:38:16,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:38:16,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:38:16,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:18,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136852782] [2025-04-14 00:38:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136852782] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:18,992 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23890221] [2025-04-14 00:38:18,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:38:18,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:18,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:38:18,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:38:19,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:38:19,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-14 00:38:19,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:38:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:19,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-04-14 00:38:19,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:19,900 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:19,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 274 [2025-04-14 00:38:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:20,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:22,039 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:22,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 378 treesize of output 356 [2025-04-14 00:38:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:22,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23890221] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:22,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:22,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 25 [2025-04-14 00:38:22,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199429850] [2025-04-14 00:38:22,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:22,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 00:38:22,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:22,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 00:38:22,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-14 00:38:22,795 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:22,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 146 transitions, 1173 flow. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 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-14 00:38:22,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:22,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:22,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:23,478 INFO L116 PetriNetUnfolderBase]: 480/904 cut-off events. [2025-04-14 00:38:23,478 INFO L117 PetriNetUnfolderBase]: For 5149/5149 co-relation queries the response was YES. [2025-04-14 00:38:23,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 904 events. 480/904 cut-off events. For 5149/5149 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4449 event pairs, 134 based on Foata normal form. 4/906 useless extension candidates. Maximal degree in co-relation 4485. Up to 675 conditions per place. [2025-04-14 00:38:23,484 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 112 selfloop transitions, 65 changer transitions 4/181 dead transitions. [2025-04-14 00:38:23,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 1778 flow [2025-04-14 00:38:23,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:38:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:38:23,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2025-04-14 00:38:23,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30039525691699603 [2025-04-14 00:38:23,485 INFO L175 Difference]: Start difference. First operand has 107 places, 146 transitions, 1173 flow. Second operand 11 states and 76 transitions. [2025-04-14 00:38:23,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 1778 flow [2025-04-14 00:38:23,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 181 transitions, 1651 flow, removed 63 selfloop flow, removed 3 redundant places. [2025-04-14 00:38:23,503 INFO L231 Difference]: Finished difference. Result has 115 places, 160 transitions, 1393 flow [2025-04-14 00:38:23,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1393, PETRI_PLACES=115, PETRI_TRANSITIONS=160} [2025-04-14 00:38:23,504 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2025-04-14 00:38:23,504 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 160 transitions, 1393 flow [2025-04-14 00:38:23,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 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-14 00:38:23,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:23,506 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:23,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:38:23,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 00:38:23,707 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:38:23,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1192389098, now seen corresponding path program 4 times [2025-04-14 00:38:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:23,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020340331] [2025-04-14 00:38:23,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:38:23,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:23,727 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:38:23,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:23,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:38:23,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:27,401 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:38:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:27,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020340331] [2025-04-14 00:38:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020340331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:27,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966593378] [2025-04-14 00:38:27,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:38:27,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:27,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:27,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:38:27,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:38:27,522 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-14 00:38:27,555 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:27,555 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:38:27,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:27,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 00:38:27,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:28,203 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:28,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 290 [2025-04-14 00:38:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:28,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:30,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:30,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 388 treesize of output 360 [2025-04-14 00:38:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:31,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966593378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:31,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 32 [2025-04-14 00:38:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10280970] [2025-04-14 00:38:31,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:31,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:38:31,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:31,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:38:31,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:38:31,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:31,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 160 transitions, 1393 flow. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 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-14 00:38:31,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:31,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:31,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:33,034 INFO L116 PetriNetUnfolderBase]: 488/926 cut-off events. [2025-04-14 00:38:33,034 INFO L117 PetriNetUnfolderBase]: For 5779/5779 co-relation queries the response was YES. [2025-04-14 00:38:33,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4728 conditions, 926 events. 488/926 cut-off events. For 5779/5779 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4645 event pairs, 64 based on Foata normal form. 2/926 useless extension candidates. Maximal degree in co-relation 4699. Up to 280 conditions per place. [2025-04-14 00:38:33,040 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 143 selfloop transitions, 98 changer transitions 12/253 dead transitions. [2025-04-14 00:38:33,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 253 transitions, 2610 flow [2025-04-14 00:38:33,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 00:38:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-14 00:38:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 206 transitions. [2025-04-14 00:38:33,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25590062111801243 [2025-04-14 00:38:33,042 INFO L175 Difference]: Start difference. First operand has 115 places, 160 transitions, 1393 flow. Second operand 35 states and 206 transitions. [2025-04-14 00:38:33,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 253 transitions, 2610 flow [2025-04-14 00:38:33,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 253 transitions, 2365 flow, removed 106 selfloop flow, removed 5 redundant places. [2025-04-14 00:38:33,058 INFO L231 Difference]: Finished difference. Result has 146 places, 167 transitions, 1521 flow [2025-04-14 00:38:33,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=1521, PETRI_PLACES=146, PETRI_TRANSITIONS=167} [2025-04-14 00:38:33,059 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 125 predicate places. [2025-04-14 00:38:33,059 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 167 transitions, 1521 flow [2025-04-14 00:38:33,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 33 states have internal predecessors, (120), 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-14 00:38:33,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:33,059 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:33,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 00:38:33,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:33,260 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:38:33,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:33,260 INFO L85 PathProgramCache]: Analyzing trace with hash -825910998, now seen corresponding path program 5 times [2025-04-14 00:38:33,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:33,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586436793] [2025-04-14 00:38:33,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:38:33,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:33,272 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:38:33,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:33,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:38:33,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:38:36,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:36,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586436793] [2025-04-14 00:38:36,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586436793] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:36,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33881578] [2025-04-14 00:38:36,615 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:38:36,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:36,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:36,617 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:38:36,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 00:38:36,735 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:38:36,812 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:36,812 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:38:36,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:36,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-14 00:38:36,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:37,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:37,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 290 [2025-04-14 00:38:38,041 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:38,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:39,590 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:38:39,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 344 treesize of output 309 [2025-04-14 00:38:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:40,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33881578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:40,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8, 7] total 34 [2025-04-14 00:38:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421309093] [2025-04-14 00:38:40,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:40,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 00:38:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:40,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 00:38:40,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 00:38:40,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:40,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 167 transitions, 1521 flow. Second operand has 35 states, 35 states have (on average 3.7714285714285714) internal successors, (132), 35 states have internal predecessors, (132), 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-14 00:38:40,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:40,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:40,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:42,083 INFO L116 PetriNetUnfolderBase]: 652/1252 cut-off events. [2025-04-14 00:38:42,083 INFO L117 PetriNetUnfolderBase]: For 7877/7877 co-relation queries the response was YES. [2025-04-14 00:38:42,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 1252 events. 652/1252 cut-off events. For 7877/7877 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6947 event pairs, 62 based on Foata normal form. 4/1254 useless extension candidates. Maximal degree in co-relation 6563. Up to 382 conditions per place. [2025-04-14 00:38:42,091 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 138 selfloop transitions, 129 changer transitions 7/274 dead transitions. [2025-04-14 00:38:42,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 274 transitions, 2910 flow [2025-04-14 00:38:42,092 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:38:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:38:42,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 131 transitions. [2025-04-14 00:38:42,093 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23731884057971014 [2025-04-14 00:38:42,093 INFO L175 Difference]: Start difference. First operand has 146 places, 167 transitions, 1521 flow. Second operand 24 states and 131 transitions. [2025-04-14 00:38:42,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 274 transitions, 2910 flow [2025-04-14 00:38:42,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 274 transitions, 2763 flow, removed 16 selfloop flow, removed 22 redundant places. [2025-04-14 00:38:42,115 INFO L231 Difference]: Finished difference. Result has 155 places, 206 transitions, 2211 flow [2025-04-14 00:38:42,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2211, PETRI_PLACES=155, PETRI_TRANSITIONS=206} [2025-04-14 00:38:42,120 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 134 predicate places. [2025-04-14 00:38:42,120 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 206 transitions, 2211 flow [2025-04-14 00:38:42,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7714285714285714) internal successors, (132), 35 states have internal predecessors, (132), 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-14 00:38:42,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:42,120 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:42,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 00:38:42,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:42,321 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:38:42,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 773099166, now seen corresponding path program 6 times [2025-04-14 00:38:42,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:42,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500502173] [2025-04-14 00:38:42,321 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:38:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:42,333 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:38:42,392 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:38:42,392 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:38:42,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:44,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:44,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500502173] [2025-04-14 00:38:44,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500502173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:44,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579142482] [2025-04-14 00:38:44,205 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:38:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:44,207 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:38:44,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 00:38:44,335 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-14 00:38:44,374 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-14 00:38:44,374 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:38:44,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:44,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-14 00:38:44,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:44,997 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:44,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 272 [2025-04-14 00:38:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:45,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:46,927 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:46,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 378 treesize of output 356 [2025-04-14 00:38:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579142482] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:47,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:47,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2025-04-14 00:38:47,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987340433] [2025-04-14 00:38:47,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:47,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:38:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:47,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:38:47,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:38:47,763 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:47,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 206 transitions, 2211 flow. Second operand has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 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-14 00:38:47,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:47,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:47,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:48,956 INFO L116 PetriNetUnfolderBase]: 686/1346 cut-off events. [2025-04-14 00:38:48,956 INFO L117 PetriNetUnfolderBase]: For 11390/11390 co-relation queries the response was YES. [2025-04-14 00:38:48,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 1346 events. 686/1346 cut-off events. For 11390/11390 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7775 event pairs, 110 based on Foata normal form. 4/1350 useless extension candidates. Maximal degree in co-relation 8044. Up to 596 conditions per place. [2025-04-14 00:38:48,966 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 161 selfloop transitions, 117 changer transitions 11/289 dead transitions. [2025-04-14 00:38:48,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 289 transitions, 3554 flow [2025-04-14 00:38:48,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 00:38:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 00:38:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 124 transitions. [2025-04-14 00:38:48,971 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.26956521739130435 [2025-04-14 00:38:48,971 INFO L175 Difference]: Start difference. First operand has 155 places, 206 transitions, 2211 flow. Second operand 20 states and 124 transitions. [2025-04-14 00:38:48,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 289 transitions, 3554 flow [2025-04-14 00:38:49,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 289 transitions, 3279 flow, removed 75 selfloop flow, removed 15 redundant places. [2025-04-14 00:38:49,008 INFO L231 Difference]: Finished difference. Result has 165 places, 237 transitions, 2696 flow [2025-04-14 00:38:49,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2696, PETRI_PLACES=165, PETRI_TRANSITIONS=237} [2025-04-14 00:38:49,009 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 144 predicate places. [2025-04-14 00:38:49,009 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 237 transitions, 2696 flow [2025-04-14 00:38:49,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 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-14 00:38:49,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:49,009 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:49,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 00:38:49,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 00:38:49,210 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:38:49,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1632568342, now seen corresponding path program 7 times [2025-04-14 00:38:49,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:49,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760743176] [2025-04-14 00:38:49,210 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:38:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:49,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:38:49,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:49,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:49,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:38:52,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:52,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760743176] [2025-04-14 00:38:52,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760743176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:52,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110939] [2025-04-14 00:38:52,425 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:38:52,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:52,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:52,426 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:38:52,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 00:38:52,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-14 00:38:52,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-14 00:38:52,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:52,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:52,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 00:38:52,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:53,387 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:53,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 322 treesize of output 270 [2025-04-14 00:38:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:54,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:55,429 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:55,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 435 treesize of output 401 [2025-04-14 00:38:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:38:56,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:56,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:56,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 32 [2025-04-14 00:38:56,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704025856] [2025-04-14 00:38:56,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:56,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:38:56,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:56,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:38:56,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:38:56,672 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:38:56,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 237 transitions, 2696 flow. Second operand has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 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-14 00:38:56,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:56,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:38:56,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:59,896 INFO L116 PetriNetUnfolderBase]: 756/1516 cut-off events. [2025-04-14 00:38:59,896 INFO L117 PetriNetUnfolderBase]: For 14750/14750 co-relation queries the response was YES. [2025-04-14 00:38:59,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9461 conditions, 1516 events. 756/1516 cut-off events. For 14750/14750 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9251 event pairs, 111 based on Foata normal form. 6/1518 useless extension candidates. Maximal degree in co-relation 9419. Up to 583 conditions per place. [2025-04-14 00:38:59,907 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 176 selfloop transitions, 151 changer transitions 12/339 dead transitions. [2025-04-14 00:38:59,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 339 transitions, 4425 flow [2025-04-14 00:38:59,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:38:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:38:59,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 167 transitions. [2025-04-14 00:38:59,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25037481259370314 [2025-04-14 00:38:59,909 INFO L175 Difference]: Start difference. First operand has 165 places, 237 transitions, 2696 flow. Second operand 29 states and 167 transitions. [2025-04-14 00:38:59,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 339 transitions, 4425 flow [2025-04-14 00:38:59,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 339 transitions, 3985 flow, removed 171 selfloop flow, removed 11 redundant places. [2025-04-14 00:38:59,959 INFO L231 Difference]: Finished difference. Result has 189 places, 266 transitions, 3234 flow [2025-04-14 00:38:59,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3234, PETRI_PLACES=189, PETRI_TRANSITIONS=266} [2025-04-14 00:38:59,960 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 168 predicate places. [2025-04-14 00:38:59,960 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 266 transitions, 3234 flow [2025-04-14 00:38:59,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 33 states have internal predecessors, (119), 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-14 00:38:59,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:59,960 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:59,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:00,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 00:39:00,161 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:00,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:00,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1790458687, now seen corresponding path program 8 times [2025-04-14 00:39:00,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:00,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005274146] [2025-04-14 00:39:00,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:00,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:00,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:00,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:00,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-14 00:39:00,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:00,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005274146] [2025-04-14 00:39:00,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005274146] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:00,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176214623] [2025-04-14 00:39:00,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:00,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:00,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:00,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:00,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 00:39:00,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:00,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:00,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:00,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:00,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 00:39:00,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-14 00:39:00,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:39:00,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176214623] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:39:00,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:39:00,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-04-14 00:39:00,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835049467] [2025-04-14 00:39:00,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:39:00,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:39:00,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:00,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:39:00,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-04-14 00:39:00,475 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:00,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 266 transitions, 3234 flow. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-14 00:39:00,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:00,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:00,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:00,659 INFO L116 PetriNetUnfolderBase]: 365/731 cut-off events. [2025-04-14 00:39:00,659 INFO L117 PetriNetUnfolderBase]: For 7618/7618 co-relation queries the response was YES. [2025-04-14 00:39:00,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4717 conditions, 731 events. 365/731 cut-off events. For 7618/7618 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3641 event pairs, 165 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 4671. Up to 720 conditions per place. [2025-04-14 00:39:00,664 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 142 selfloop transitions, 13 changer transitions 0/155 dead transitions. [2025-04-14 00:39:00,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 155 transitions, 2150 flow [2025-04-14 00:39:00,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:39:00,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:39:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2025-04-14 00:39:00,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2391304347826087 [2025-04-14 00:39:00,665 INFO L175 Difference]: Start difference. First operand has 189 places, 266 transitions, 3234 flow. Second operand 8 states and 44 transitions. [2025-04-14 00:39:00,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 155 transitions, 2150 flow [2025-04-14 00:39:00,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 155 transitions, 1851 flow, removed 80 selfloop flow, removed 31 redundant places. [2025-04-14 00:39:00,685 INFO L231 Difference]: Finished difference. Result has 140 places, 155 transitions, 1567 flow [2025-04-14 00:39:00,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1541, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1567, PETRI_PLACES=140, PETRI_TRANSITIONS=155} [2025-04-14 00:39:00,686 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 119 predicate places. [2025-04-14 00:39:00,686 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 155 transitions, 1567 flow [2025-04-14 00:39:00,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 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-14 00:39:00,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:00,686 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:00,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 00:39:00,887 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 00:39:00,887 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:00,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1413587973, now seen corresponding path program 9 times [2025-04-14 00:39:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:00,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858749371] [2025-04-14 00:39:00,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:00,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:00,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:39:00,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-14 00:39:00,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:39:00,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:39:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:01,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858749371] [2025-04-14 00:39:01,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858749371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:01,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907905342] [2025-04-14 00:39:01,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:01,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:01,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:01,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:01,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 00:39:02,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-14 00:39:02,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-14 00:39:02,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:39:02,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:02,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 00:39:02,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:02,525 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:02,525 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 108 [2025-04-14 00:39:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:39:02,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:03,092 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:03,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 177 [2025-04-14 00:39:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:39:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907905342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:03,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:03,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 23 [2025-04-14 00:39:03,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927013511] [2025-04-14 00:39:03,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:03,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 00:39:03,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:03,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 00:39:03,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-04-14 00:39:03,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:03,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 155 transitions, 1567 flow. Second operand has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 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-14 00:39:03,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:03,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:03,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:04,506 INFO L116 PetriNetUnfolderBase]: 390/790 cut-off events. [2025-04-14 00:39:04,507 INFO L117 PetriNetUnfolderBase]: For 7287/7287 co-relation queries the response was YES. [2025-04-14 00:39:04,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 790 events. 390/790 cut-off events. For 7287/7287 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4125 event pairs, 23 based on Foata normal form. 8/798 useless extension candidates. Maximal degree in co-relation 4677. Up to 210 conditions per place. [2025-04-14 00:39:04,511 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 121 selfloop transitions, 123 changer transitions 4/248 dead transitions. [2025-04-14 00:39:04,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 248 transitions, 2913 flow [2025-04-14 00:39:04,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 00:39:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 00:39:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 186 transitions. [2025-04-14 00:39:04,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2888198757763975 [2025-04-14 00:39:04,513 INFO L175 Difference]: Start difference. First operand has 140 places, 155 transitions, 1567 flow. Second operand 28 states and 186 transitions. [2025-04-14 00:39:04,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 248 transitions, 2913 flow [2025-04-14 00:39:04,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 248 transitions, 2881 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-14 00:39:04,533 INFO L231 Difference]: Finished difference. Result has 166 places, 180 transitions, 2341 flow [2025-04-14 00:39:04,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=2341, PETRI_PLACES=166, PETRI_TRANSITIONS=180} [2025-04-14 00:39:04,533 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 145 predicate places. [2025-04-14 00:39:04,533 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 180 transitions, 2341 flow [2025-04-14 00:39:04,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.086956521739131) internal successors, (94), 23 states have internal predecessors, (94), 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-14 00:39:04,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:04,533 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:04,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 00:39:04,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 00:39:04,735 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:04,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:04,735 INFO L85 PathProgramCache]: Analyzing trace with hash -76343339, now seen corresponding path program 10 times [2025-04-14 00:39:04,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:04,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464876157] [2025-04-14 00:39:04,735 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:39:04,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:04,748 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:04,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:04,816 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:39:04,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:06,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:06,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464876157] [2025-04-14 00:39:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464876157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:06,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015089403] [2025-04-14 00:39:06,745 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:39:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:06,746 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:06,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 00:39:06,896 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:06,934 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:06,934 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:39:06,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:06,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 00:39:06,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:07,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:07,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 136 [2025-04-14 00:39:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:07,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:07,639 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:07,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 177 [2025-04-14 00:39:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:07,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015089403] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:07,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 7] total 29 [2025-04-14 00:39:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787345822] [2025-04-14 00:39:07,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:07,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 00:39:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:07,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 00:39:07,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-04-14 00:39:07,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:07,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 180 transitions, 2341 flow. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 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-14 00:39:07,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:07,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:07,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:08,823 INFO L116 PetriNetUnfolderBase]: 387/785 cut-off events. [2025-04-14 00:39:08,823 INFO L117 PetriNetUnfolderBase]: For 8490/8490 co-relation queries the response was YES. [2025-04-14 00:39:08,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5281 conditions, 785 events. 387/785 cut-off events. For 8490/8490 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4095 event pairs, 53 based on Foata normal form. 3/788 useless extension candidates. Maximal degree in co-relation 5238. Up to 245 conditions per place. [2025-04-14 00:39:08,828 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 118 selfloop transitions, 82 changer transitions 9/209 dead transitions. [2025-04-14 00:39:08,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 209 transitions, 2997 flow [2025-04-14 00:39:08,829 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 00:39:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 00:39:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 104 transitions. [2025-04-14 00:39:08,829 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2153209109730849 [2025-04-14 00:39:08,829 INFO L175 Difference]: Start difference. First operand has 166 places, 180 transitions, 2341 flow. Second operand 21 states and 104 transitions. [2025-04-14 00:39:08,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 209 transitions, 2997 flow [2025-04-14 00:39:08,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 209 transitions, 2743 flow, removed 77 selfloop flow, removed 10 redundant places. [2025-04-14 00:39:08,856 INFO L231 Difference]: Finished difference. Result has 178 places, 179 transitions, 2247 flow [2025-04-14 00:39:08,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=2093, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2247, PETRI_PLACES=178, PETRI_TRANSITIONS=179} [2025-04-14 00:39:08,857 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 157 predicate places. [2025-04-14 00:39:08,857 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 179 transitions, 2247 flow [2025-04-14 00:39:08,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 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-14 00:39:08,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:08,857 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:08,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 00:39:09,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:09,058 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:09,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash -536192535, now seen corresponding path program 11 times [2025-04-14 00:39:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:09,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139276510] [2025-04-14 00:39:09,058 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:39:09,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:09,071 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:09,152 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:09,153 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-14 00:39:09,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:11,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:11,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139276510] [2025-04-14 00:39:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139276510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:11,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308256088] [2025-04-14 00:39:11,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:39:11,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:11,178 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:11,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 00:39:11,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:11,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:11,445 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-14 00:39:11,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:11,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-14 00:39:11,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:11,879 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:11,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 147 [2025-04-14 00:39:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 00:39:11,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:12,394 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:12,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 75 [2025-04-14 00:39:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:12,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308256088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:12,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:12,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 7] total 33 [2025-04-14 00:39:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39391822] [2025-04-14 00:39:12,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:12,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:39:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:12,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:39:12,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:39:12,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:12,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 179 transitions, 2247 flow. Second operand has 33 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 33 states have internal predecessors, (126), 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-14 00:39:12,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:12,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:12,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:13,417 INFO L116 PetriNetUnfolderBase]: 399/804 cut-off events. [2025-04-14 00:39:13,417 INFO L117 PetriNetUnfolderBase]: For 7094/7094 co-relation queries the response was YES. [2025-04-14 00:39:13,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5193 conditions, 804 events. 399/804 cut-off events. For 7094/7094 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4201 event pairs, 10 based on Foata normal form. 8/812 useless extension candidates. Maximal degree in co-relation 5149. Up to 217 conditions per place. [2025-04-14 00:39:13,422 INFO L140 encePairwiseOnDemand]: 13/23 looper letters, 113 selfloop transitions, 116 changer transitions 1/230 dead transitions. [2025-04-14 00:39:13,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 230 transitions, 3173 flow [2025-04-14 00:39:13,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 00:39:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 00:39:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 136 transitions. [2025-04-14 00:39:13,423 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22742474916387959 [2025-04-14 00:39:13,424 INFO L175 Difference]: Start difference. First operand has 178 places, 179 transitions, 2247 flow. Second operand 26 states and 136 transitions. [2025-04-14 00:39:13,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 230 transitions, 3173 flow [2025-04-14 00:39:13,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 230 transitions, 3001 flow, removed 12 selfloop flow, removed 18 redundant places. [2025-04-14 00:39:13,450 INFO L231 Difference]: Finished difference. Result has 184 places, 188 transitions, 2515 flow [2025-04-14 00:39:13,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2515, PETRI_PLACES=184, PETRI_TRANSITIONS=188} [2025-04-14 00:39:13,451 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 163 predicate places. [2025-04-14 00:39:13,451 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 188 transitions, 2515 flow [2025-04-14 00:39:13,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.8181818181818183) internal successors, (126), 33 states have internal predecessors, (126), 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-14 00:39:13,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:13,451 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 00:39:13,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-14 00:39:13,652 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:13,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 548557373, now seen corresponding path program 12 times [2025-04-14 00:39:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:13,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586499833] [2025-04-14 00:39:13,652 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:39:13,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:13,666 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:13,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 27 statements. [2025-04-14 00:39:13,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:39:13,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-14 00:39:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:14,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586499833] [2025-04-14 00:39:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586499833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:14,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266972677] [2025-04-14 00:39:14,655 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:39:14,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:14,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:14,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:14,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 00:39:14,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:14,856 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 27 statements. [2025-04-14 00:39:14,856 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 00:39:14,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:14,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 00:39:14,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-14 00:39:15,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:15,509 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:15,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 75 [2025-04-14 00:39:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266972677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:15,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2025-04-14 00:39:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629070309] [2025-04-14 00:39:15,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:15,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 00:39:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:15,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 00:39:15,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-04-14 00:39:15,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:15,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 188 transitions, 2515 flow. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 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-14 00:39:15,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:15,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:15,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:16,130 INFO L116 PetriNetUnfolderBase]: 424/850 cut-off events. [2025-04-14 00:39:16,130 INFO L117 PetriNetUnfolderBase]: For 7661/7661 co-relation queries the response was YES. [2025-04-14 00:39:16,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5688 conditions, 850 events. 424/850 cut-off events. For 7661/7661 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4515 event pairs, 28 based on Foata normal form. 8/858 useless extension candidates. Maximal degree in co-relation 5645. Up to 402 conditions per place. [2025-04-14 00:39:16,135 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 144 selfloop transitions, 79 changer transitions 1/224 dead transitions. [2025-04-14 00:39:16,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 224 transitions, 3294 flow [2025-04-14 00:39:16,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:39:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:39:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 96 transitions. [2025-04-14 00:39:16,136 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2782608695652174 [2025-04-14 00:39:16,136 INFO L175 Difference]: Start difference. First operand has 184 places, 188 transitions, 2515 flow. Second operand 15 states and 96 transitions. [2025-04-14 00:39:16,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 224 transitions, 3294 flow [2025-04-14 00:39:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 224 transitions, 3098 flow, removed 48 selfloop flow, removed 16 redundant places. [2025-04-14 00:39:16,163 INFO L231 Difference]: Finished difference. Result has 184 places, 198 transitions, 2713 flow [2025-04-14 00:39:16,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=2361, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2713, PETRI_PLACES=184, PETRI_TRANSITIONS=198} [2025-04-14 00:39:16,164 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 163 predicate places. [2025-04-14 00:39:16,164 INFO L485 AbstractCegarLoop]: Abstraction has has 184 places, 198 transitions, 2713 flow [2025-04-14 00:39:16,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 21 states have internal predecessors, (93), 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-14 00:39:16,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:16,164 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:16,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:16,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:16,364 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:16,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash -310911803, now seen corresponding path program 13 times [2025-04-14 00:39:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:16,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901124428] [2025-04-14 00:39:16,365 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:39:16,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:16,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:39:16,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:16,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:16,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 12 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:18,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:18,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901124428] [2025-04-14 00:39:18,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901124428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:18,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580569997] [2025-04-14 00:39:18,525 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:39:18,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:18,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:18,527 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:18,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 00:39:18,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 00:39:18,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:18,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:39:18,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:18,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:39:18,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:18,968 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:18,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 141 [2025-04-14 00:39:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:19,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:19,762 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:19,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 75 [2025-04-14 00:39:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580569997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:19,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:19,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8, 8] total 32 [2025-04-14 00:39:19,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487051447] [2025-04-14 00:39:19,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:19,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 00:39:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:19,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 00:39:19,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-04-14 00:39:19,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:19,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 198 transitions, 2713 flow. Second operand has 32 states, 32 states have (on average 3.625) internal successors, (116), 32 states have internal predecessors, (116), 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-14 00:39:19,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:19,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:19,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:22,435 INFO L116 PetriNetUnfolderBase]: 484/968 cut-off events. [2025-04-14 00:39:22,435 INFO L117 PetriNetUnfolderBase]: For 8415/8415 co-relation queries the response was YES. [2025-04-14 00:39:22,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6532 conditions, 968 events. 484/968 cut-off events. For 8415/8415 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5362 event pairs, 9 based on Foata normal form. 10/978 useless extension candidates. Maximal degree in co-relation 6489. Up to 275 conditions per place. [2025-04-14 00:39:22,441 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 143 selfloop transitions, 176 changer transitions 4/323 dead transitions. [2025-04-14 00:39:22,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 323 transitions, 4390 flow [2025-04-14 00:39:22,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-14 00:39:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-14 00:39:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 275 transitions. [2025-04-14 00:39:22,442 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2440106477373558 [2025-04-14 00:39:22,442 INFO L175 Difference]: Start difference. First operand has 184 places, 198 transitions, 2713 flow. Second operand 49 states and 275 transitions. [2025-04-14 00:39:22,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 323 transitions, 4390 flow [2025-04-14 00:39:22,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 323 transitions, 4262 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-04-14 00:39:22,475 INFO L231 Difference]: Finished difference. Result has 234 places, 237 transitions, 3696 flow [2025-04-14 00:39:22,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=2607, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=3696, PETRI_PLACES=234, PETRI_TRANSITIONS=237} [2025-04-14 00:39:22,475 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 213 predicate places. [2025-04-14 00:39:22,475 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 237 transitions, 3696 flow [2025-04-14 00:39:22,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.625) internal successors, (116), 32 states have internal predecessors, (116), 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-14 00:39:22,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:22,476 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:22,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:22,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:22,676 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:22,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1639027137, now seen corresponding path program 14 times [2025-04-14 00:39:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:22,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315970197] [2025-04-14 00:39:22,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:22,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:22,769 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:22,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:22,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:24,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:24,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315970197] [2025-04-14 00:39:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315970197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:24,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848836695] [2025-04-14 00:39:24,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:24,632 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:24,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 00:39:24,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:24,846 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:24,846 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:24,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:24,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 00:39:24,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:25,272 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:25,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 88 [2025-04-14 00:39:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-14 00:39:25,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:25,753 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:25,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 177 [2025-04-14 00:39:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848836695] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:26,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 8] total 33 [2025-04-14 00:39:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982757498] [2025-04-14 00:39:26,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:26,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 00:39:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:26,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 00:39:26,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 00:39:26,007 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:26,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 237 transitions, 3696 flow. Second operand has 33 states, 33 states have (on average 3.757575757575758) internal successors, (124), 33 states have internal predecessors, (124), 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-14 00:39:26,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:26,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:26,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:27,480 INFO L116 PetriNetUnfolderBase]: 472/944 cut-off events. [2025-04-14 00:39:27,480 INFO L117 PetriNetUnfolderBase]: For 9342/9342 co-relation queries the response was YES. [2025-04-14 00:39:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7020 conditions, 944 events. 472/944 cut-off events. For 9342/9342 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5180 event pairs, 27 based on Foata normal form. 6/950 useless extension candidates. Maximal degree in co-relation 6968. Up to 269 conditions per place. [2025-04-14 00:39:27,488 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 113 selfloop transitions, 155 changer transitions 12/280 dead transitions. [2025-04-14 00:39:27,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 280 transitions, 4485 flow [2025-04-14 00:39:27,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:39:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:39:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 155 transitions. [2025-04-14 00:39:27,490 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.23238380809595202 [2025-04-14 00:39:27,490 INFO L175 Difference]: Start difference. First operand has 234 places, 237 transitions, 3696 flow. Second operand 29 states and 155 transitions. [2025-04-14 00:39:27,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 280 transitions, 4485 flow [2025-04-14 00:39:27,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 280 transitions, 4029 flow, removed 119 selfloop flow, removed 27 redundant places. [2025-04-14 00:39:27,537 INFO L231 Difference]: Finished difference. Result has 235 places, 233 transitions, 3525 flow [2025-04-14 00:39:27,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=3214, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3525, PETRI_PLACES=235, PETRI_TRANSITIONS=233} [2025-04-14 00:39:27,537 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 214 predicate places. [2025-04-14 00:39:27,537 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 233 transitions, 3525 flow [2025-04-14 00:39:27,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.757575757575758) internal successors, (124), 33 states have internal predecessors, (124), 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-14 00:39:27,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:27,538 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:27,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 00:39:27,738 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 00:39:27,738 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:27,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash -273255979, now seen corresponding path program 15 times [2025-04-14 00:39:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:27,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525228291] [2025-04-14 00:39:27,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:27,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:27,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 27 statements. [2025-04-14 00:39:27,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:39:27,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:28,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:28,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525228291] [2025-04-14 00:39:28,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525228291] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:28,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162037153] [2025-04-14 00:39:28,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:28,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:28,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:28,497 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:28,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 00:39:28,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:28,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 27 statements. [2025-04-14 00:39:28,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:39:28,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:28,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:39:28,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:29,032 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:29,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 112 [2025-04-14 00:39:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:29,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:29,494 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:29,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 177 [2025-04-14 00:39:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:29,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162037153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:29,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:29,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-04-14 00:39:29,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588945192] [2025-04-14 00:39:29,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:29,747 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 00:39:29,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:29,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 00:39:29,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-14 00:39:29,748 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:29,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 233 transitions, 3525 flow. Second operand has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 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-14 00:39:29,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:29,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:29,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:30,334 INFO L116 PetriNetUnfolderBase]: 471/935 cut-off events. [2025-04-14 00:39:30,334 INFO L117 PetriNetUnfolderBase]: For 9605/9605 co-relation queries the response was YES. [2025-04-14 00:39:30,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 935 events. 471/935 cut-off events. For 9605/9605 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5082 event pairs, 67 based on Foata normal form. 3/938 useless extension candidates. Maximal degree in co-relation 6683. Up to 279 conditions per place. [2025-04-14 00:39:30,339 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 166 selfloop transitions, 92 changer transitions 5/263 dead transitions. [2025-04-14 00:39:30,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 263 transitions, 4248 flow [2025-04-14 00:39:30,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:39:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:39:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2025-04-14 00:39:30,340 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2025-04-14 00:39:30,340 INFO L175 Difference]: Start difference. First operand has 235 places, 233 transitions, 3525 flow. Second operand 11 states and 88 transitions. [2025-04-14 00:39:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 263 transitions, 4248 flow [2025-04-14 00:39:30,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 263 transitions, 3968 flow, removed 23 selfloop flow, removed 25 redundant places. [2025-04-14 00:39:30,379 INFO L231 Difference]: Finished difference. Result has 214 places, 235 transitions, 3473 flow [2025-04-14 00:39:30,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=3243, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3473, PETRI_PLACES=214, PETRI_TRANSITIONS=235} [2025-04-14 00:39:30,380 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 193 predicate places. [2025-04-14 00:39:30,380 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 235 transitions, 3473 flow [2025-04-14 00:39:30,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 17 states have internal predecessors, (67), 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-14 00:39:30,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:30,380 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:30,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 00:39:30,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:30,580 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:30,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1746660975, now seen corresponding path program 16 times [2025-04-14 00:39:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:30,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698118974] [2025-04-14 00:39:30,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:39:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:30,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:30,652 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:30,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:39:30,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:32,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698118974] [2025-04-14 00:39:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698118974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:32,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126518738] [2025-04-14 00:39:32,524 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:39:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:32,525 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:32,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 00:39:32,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 00:39:32,757 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:32,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:39:32,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:32,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 00:39:32,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:32,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:32,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 141 [2025-04-14 00:39:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:33,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:33,707 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-14 00:39:33,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 75 [2025-04-14 00:39:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-14 00:39:33,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126518738] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:33,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:33,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 8] total 31 [2025-04-14 00:39:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185460248] [2025-04-14 00:39:33,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:33,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-14 00:39:33,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:33,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-14 00:39:33,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2025-04-14 00:39:33,753 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2025-04-14 00:39:33,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 235 transitions, 3473 flow. Second operand has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 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-14 00:39:33,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:33,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2025-04-14 00:39:33,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:35,083 INFO L116 PetriNetUnfolderBase]: 466/912 cut-off events. [2025-04-14 00:39:35,083 INFO L117 PetriNetUnfolderBase]: For 8443/8443 co-relation queries the response was YES. [2025-04-14 00:39:35,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6518 conditions, 912 events. 466/912 cut-off events. For 8443/8443 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4823 event pairs, 24 based on Foata normal form. 2/914 useless extension candidates. Maximal degree in co-relation 6470. Up to 208 conditions per place. [2025-04-14 00:39:35,089 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 128 selfloop transitions, 136 changer transitions 4/268 dead transitions. [2025-04-14 00:39:35,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 268 transitions, 4146 flow [2025-04-14 00:39:35,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 00:39:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 00:39:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 148 transitions. [2025-04-14 00:39:35,090 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22188905547226387 [2025-04-14 00:39:35,090 INFO L175 Difference]: Start difference. First operand has 214 places, 235 transitions, 3473 flow. Second operand 29 states and 148 transitions. [2025-04-14 00:39:35,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 268 transitions, 4146 flow [2025-04-14 00:39:35,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 268 transitions, 4011 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-04-14 00:39:35,143 INFO L231 Difference]: Finished difference. Result has 231 places, 230 transitions, 3596 flow [2025-04-14 00:39:35,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=3269, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3596, PETRI_PLACES=231, PETRI_TRANSITIONS=230} [2025-04-14 00:39:35,144 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 210 predicate places. [2025-04-14 00:39:35,144 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 230 transitions, 3596 flow [2025-04-14 00:39:35,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.5806451612903225) internal successors, (111), 31 states have internal predecessors, (111), 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-14 00:39:35,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:35,144 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:35,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 00:39:35,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:35,345 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 00:39:35,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash 419269117, now seen corresponding path program 17 times [2025-04-14 00:39:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:35,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423592378] [2025-04-14 00:39:35,346 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:39:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:35,360 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:35,467 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:35,467 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-14 00:39:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:37,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:37,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423592378] [2025-04-14 00:39:37,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423592378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:37,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390466595] [2025-04-14 00:39:37,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:39:37,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:37,512 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:39:37,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 00:39:37,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 7 equivalence classes. [2025-04-14 00:39:37,826 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 00:39:37,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-14 00:39:37,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:37,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-14 00:39:37,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:37,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-04-14 00:39:37,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-14 00:39:37,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-14 00:39:37,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2025-04-14 00:39:37,929 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-04-14 00:39:37,941 INFO L325 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2025-04-14 00:39:37,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-04-14 00:39:37,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:39:37,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:39:37,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2025-04-14 00:39:38,060 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 92 [2025-04-14 00:39:38,104 INFO L325 Elim1Store]: treesize reduction 139, result has 18.7 percent of original size [2025-04-14 00:39:38,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 92 treesize of output 125 [2025-04-14 00:39:38,213 INFO L325 Elim1Store]: treesize reduction 80, result has 42.0 percent of original size [2025-04-14 00:39:38,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 75 treesize of output 110 [2025-04-14 00:39:38,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 164 [2025-04-14 00:39:38,464 INFO L325 Elim1Store]: treesize reduction 253, result has 27.9 percent of original size [2025-04-14 00:39:38,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 164 treesize of output 251 [2025-04-14 00:48:45,476 WARN L286 SmtUtils]: Spent 9.06m on a formula simplification. DAG size of input: 9709 DAG size of output: 660 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-14 00:48:45,477 INFO L325 Elim1Store]: treesize reduction 18752, result has 6.8 percent of original size [2025-04-14 00:48:45,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 68 select indices, 68 select index equivalence classes, 0 disjoint index pairs (out of 2278 index pairs), introduced 68 new quantified variables, introduced 2344 case distinctions, treesize of input 1955 treesize of output 2854 Received shutdown request... [2025-04-14 00:51:49,541 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:51:49,542 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:51:49,701 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 00:51:49,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 00:51:49,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:51:49,902 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-134-7-6-9-5-8-2-1 context. [2025-04-14 00:51:49,903 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 00:51:49,903 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 00:51:49,903 INFO L422 BasicCegarLoop]: Path program histogram: [17, 3, 2, 2, 1, 1] [2025-04-14 00:51:49,906 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:51:49,906 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:51:49,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:51:49 BasicIcfg [2025-04-14 00:51:49,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:51:49,909 INFO L158 Benchmark]: Toolchain (without parser) took 846247.90ms. Allocated memory was 155.2MB in the beginning and 893.4MB in the end (delta: 738.2MB). Free memory was 109.1MB in the beginning and 664.6MB in the end (delta: -555.4MB). Peak memory consumption was 569.3MB. Max. memory is 8.0GB. [2025-04-14 00:51:49,909 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 155.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:49,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.95ms. Allocated memory is still 155.2MB. Free memory was 109.1MB in the beginning and 92.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:51:49,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.76ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 89.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:49,909 INFO L158 Benchmark]: Boogie Preprocessor took 64.04ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 85.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:51:49,909 INFO L158 Benchmark]: IcfgBuilder took 1228.03ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 37.8MB in the end (delta: 47.8MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2025-04-14 00:51:49,909 INFO L158 Benchmark]: TraceAbstraction took 844583.08ms. Allocated memory was 155.2MB in the beginning and 893.4MB in the end (delta: 738.2MB). Free memory was 36.7MB in the beginning and 664.6MB in the end (delta: -627.9MB). Peak memory consumption was 496.9MB. Max. memory is 8.0GB. [2025-04-14 00:51:49,910 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 155.2MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.95ms. Allocated memory is still 155.2MB. Free memory was 109.1MB in the beginning and 92.6MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.76ms. Allocated memory is still 155.2MB. Free memory was 92.6MB in the beginning and 89.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 64.04ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 85.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1228.03ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 37.8MB in the end (delta: 47.8MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. * TraceAbstraction took 844583.08ms. Allocated memory was 155.2MB in the beginning and 893.4MB in the end (delta: 738.2MB). Free memory was 36.7MB in the beginning and 664.6MB in the end (delta: -627.9MB). Peak memory consumption was 496.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-134-7-6-9-5-8-2-1 context. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-134-7-6-9-5-8-2-1 context. - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-134-7-6-9-5-8-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 35 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 844.5s, OverallIterations: 26, TraceHistogramMax: 6, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1969 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1969 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 475 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12029 IncrementalHoareTripleChecker+Invalid, 12504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 475 mSolverCounterUnsat, 0 mSDtfsCounter, 12029 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1591 GetRequests, 826 SyntacticMatches, 4 SemanticMatches, 761 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8092 ImplicationChecksByTransitivity, 21.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3696occurred in iteration=22, InterpolantAutomatonStates: 437, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 74.8s InterpolantComputationTime, 1065 NumberOfCodeBlocks, 963 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 21340 SizeOfPredicates, 446 NumberOfNonLiveVariables, 5272 ConjunctsInSsa, 659 ConjunctsInUnsatCore, 60 InterpolantComputations, 8 PerfectInterpolantSequences, 2128/2785 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown