/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-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:37:30,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:37:30,045 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:30,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:37:30,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:37:30,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:37:30,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:37:30,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:37:30,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:37:30,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:37:30,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:37:30,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:37:30,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:37:30,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:37:30,069 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:37:30,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:37:30,070 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:30,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:30,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:30,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:37:30,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:37:30,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:37:30,073 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:30,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:37:30,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:37:30,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:37:30,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:37:30,291 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:37:30,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2025-04-14 00:37:31,460 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4bd5802/6d27b977f8734f6aa8fd9c331d856014/FLAGdbe67ac65 [2025-04-14 00:37:31,683 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:37:31,683 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2025-04-14 00:37:31,694 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4bd5802/6d27b977f8734f6aa8fd9c331d856014/FLAGdbe67ac65 [2025-04-14 00:37:32,511 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f4bd5802/6d27b977f8734f6aa8fd9c331d856014 [2025-04-14 00:37:32,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:37:32,514 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:37:32,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:32,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:37:32,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:37:32,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:32" (1/1) ... [2025-04-14 00:37:32,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eface33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:32, skipping insertion in model container [2025-04-14 00:37:32,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:37:32" (1/1) ... [2025-04-14 00:37:32,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:37:32,753 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-subst.wvr.c[6540,6553] [2025-04-14 00:37:32,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:32,778 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:37:32,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c[6540,6553] [2025-04-14 00:37:32,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:37:32,851 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:37:32,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:32 WrapperNode [2025-04-14 00:37:32,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:37:32,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:32,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:37:32,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:37:32,859 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:32" (1/1) ... [2025-04-14 00:37:32,868 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:32" (1/1) ... [2025-04-14 00:37:32,900 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-04-14 00:37:32,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:37:32,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:37:32,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:37:32,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:37:32,917 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:32" (1/1) ... [2025-04-14 00:37:32,917 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:32" (1/1) ... [2025-04-14 00:37:32,925 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:32" (1/1) ... [2025-04-14 00:37:32,949 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 00:37:32,950 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:32" (1/1) ... [2025-04-14 00:37:32,950 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:32" (1/1) ... [2025-04-14 00:37:32,959 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:32" (1/1) ... [2025-04-14 00:37:32,962 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:32" (1/1) ... [2025-04-14 00:37:32,963 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:32" (1/1) ... [2025-04-14 00:37:32,964 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:32" (1/1) ... [2025-04-14 00:37:32,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:37:32,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:37:32,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:37:32,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:37:32,982 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:32" (1/1) ... [2025-04-14 00:37:32,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:37:32,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:33,007 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:33,009 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:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:37:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:37:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:37:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:37:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:37:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:37:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:37:33,028 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:33,142 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:37:33,143 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:37:33,753 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:37:33,754 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:37:33,754 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:37:34,588 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:37:34,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:34 BoogieIcfgContainer [2025-04-14 00:37:34,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:37:34,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:37:34,591 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:37:34,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:37:34,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:37:32" (1/3) ... [2025-04-14 00:37:34,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac3b98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:34, skipping insertion in model container [2025-04-14 00:37:34,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:37:32" (2/3) ... [2025-04-14 00:37:34,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac3b98f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:37:34, skipping insertion in model container [2025-04-14 00:37:34,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:37:34" (3/3) ... [2025-04-14 00:37:34,596 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2025-04-14 00:37:34,608 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:37:34,609 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-subst.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:37:34,609 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:37:34,722 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:37:34,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:37:34,777 INFO L116 PetriNetUnfolderBase]: 9/30 cut-off events. [2025-04-14 00:37:34,781 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:37:34,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 9/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-14 00:37:34,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:37:34,785 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 76 flow [2025-04-14 00:37:34,795 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:37:34,803 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;@2de453d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:37:34,804 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:37:34,821 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:37:34,821 INFO L116 PetriNetUnfolderBase]: 9/28 cut-off events. [2025-04-14 00:37:34,822 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:37:34,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:34,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:34,823 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:34,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2079547387, now seen corresponding path program 1 times [2025-04-14 00:37:34,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:34,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233434719] [2025-04-14 00:37:34,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:34,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:34,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:37:34,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:37:34,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:34,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:35,169 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:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:35,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233434719] [2025-04-14 00:37:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233434719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:35,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:35,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:37:35,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170942026] [2025-04-14 00:37:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:35,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:35,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:35,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:35,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:35,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:35,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:37:35,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:35,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:35,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:35,454 INFO L116 PetriNetUnfolderBase]: 277/376 cut-off events. [2025-04-14 00:37:35,454 INFO L117 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-04-14 00:37:35,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 376 events. 277/376 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 815 event pairs, 124 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 670. Up to 374 conditions per place. [2025-04-14 00:37:35,459 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 26 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2025-04-14 00:37:35,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 146 flow [2025-04-14 00:37:35,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-14 00:37:35,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 00:37:35,470 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 76 flow. Second operand 3 states and 44 transitions. [2025-04-14 00:37:35,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 146 flow [2025-04-14 00:37:35,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:37:35,476 INFO L231 Difference]: Finished difference. Result has 27 places, 32 transitions, 96 flow [2025-04-14 00:37:35,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=27, PETRI_TRANSITIONS=32} [2025-04-14 00:37:35,481 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2025-04-14 00:37:35,481 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 32 transitions, 96 flow [2025-04-14 00:37:35,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:37:35,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:35,481 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:35,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:37:35,482 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:35,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:35,482 INFO L85 PathProgramCache]: Analyzing trace with hash -235870830, now seen corresponding path program 1 times [2025-04-14 00:37:35,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:35,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232911915] [2025-04-14 00:37:35,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:35,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:37:35,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:37:35,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:35,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:37:35,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:35,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232911915] [2025-04-14 00:37:35,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232911915] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:35,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477831661] [2025-04-14 00:37:35,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:35,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:35,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:35,745 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:35,746 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:35,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:37:35,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:37:35,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:35,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:35,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:37:35,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:37:35,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:37:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:37:36,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477831661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:37:36,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:37:36,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-14 00:37:36,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15693034] [2025-04-14 00:37:36,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:37:36,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:37:36,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:36,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:37:36,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:37:36,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:36,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 32 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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:36,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:36,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:36,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:36,198 INFO L116 PetriNetUnfolderBase]: 277/385 cut-off events. [2025-04-14 00:37:36,198 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:37:36,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 385 events. 277/385 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 815 event pairs, 124 based on Foata normal form. 6/240 useless extension candidates. Maximal degree in co-relation 760. Up to 374 conditions per place. [2025-04-14 00:37:36,201 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 26 selfloop transitions, 15 changer transitions 0/41 dead transitions. [2025-04-14 00:37:36,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 214 flow [2025-04-14 00:37:36,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:37:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:37:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2025-04-14 00:37:36,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-04-14 00:37:36,202 INFO L175 Difference]: Start difference. First operand has 27 places, 32 transitions, 96 flow. Second operand 6 states and 68 transitions. [2025-04-14 00:37:36,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 214 flow [2025-04-14 00:37:36,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 41 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:36,204 INFO L231 Difference]: Finished difference. Result has 34 places, 41 transitions, 186 flow [2025-04-14 00:37:36,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=34, PETRI_TRANSITIONS=41} [2025-04-14 00:37:36,205 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2025-04-14 00:37:36,205 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 41 transitions, 186 flow [2025-04-14 00:37:36,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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:36,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:36,205 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:36,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:37:36,406 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:36,406 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:36,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash -357615943, now seen corresponding path program 2 times [2025-04-14 00:37:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:36,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876751243] [2025-04-14 00:37:36,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:36,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:37:36,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-14 00:37:36,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:36,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:37,632 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:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:37,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876751243] [2025-04-14 00:37:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876751243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316655417] [2025-04-14 00:37:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:37,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:37,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:37,633 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:37,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 41 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:37,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:37,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:37,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:38,134 INFO L116 PetriNetUnfolderBase]: 445/644 cut-off events. [2025-04-14 00:37:38,134 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-14 00:37:38,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 644 events. 445/644 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1929 event pairs, 124 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 1275. Up to 360 conditions per place. [2025-04-14 00:37:38,139 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 73 selfloop transitions, 12 changer transitions 2/87 dead transitions. [2025-04-14 00:37:38,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 87 transitions, 465 flow [2025-04-14 00:37:38,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-04-14 00:37:38,140 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-04-14 00:37:38,140 INFO L175 Difference]: Start difference. First operand has 34 places, 41 transitions, 186 flow. Second operand 5 states and 91 transitions. [2025-04-14 00:37:38,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 87 transitions, 465 flow [2025-04-14 00:37:38,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 441 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:38,142 INFO L231 Difference]: Finished difference. Result has 40 places, 52 transitions, 257 flow [2025-04-14 00:37:38,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=40, PETRI_TRANSITIONS=52} [2025-04-14 00:37:38,143 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-04-14 00:37:38,143 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 52 transitions, 257 flow [2025-04-14 00:37:38,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:38,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:38,143 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:38,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:37:38,143 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:38,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1546284113, now seen corresponding path program 3 times [2025-04-14 00:37:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:38,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765677868] [2025-04-14 00:37:38,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:37:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:38,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-14 00:37:38,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 29 statements. [2025-04-14 00:37:38,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:37:38,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:38,928 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:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:38,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765677868] [2025-04-14 00:37:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765677868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:38,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:38,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693236736] [2025-04-14 00:37:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:38,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:38,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:38,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:38,929 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:38,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 52 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:38,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:38,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:38,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:39,626 INFO L116 PetriNetUnfolderBase]: 936/1339 cut-off events. [2025-04-14 00:37:39,626 INFO L117 PetriNetUnfolderBase]: For 802/802 co-relation queries the response was YES. [2025-04-14 00:37:39,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4094 conditions, 1339 events. 936/1339 cut-off events. For 802/802 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5000 event pairs, 125 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 4014. Up to 625 conditions per place. [2025-04-14 00:37:39,638 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 84 selfloop transitions, 54 changer transitions 1/139 dead transitions. [2025-04-14 00:37:39,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 139 transitions, 895 flow [2025-04-14 00:37:39,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:37:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:37:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-04-14 00:37:39,643 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2025-04-14 00:37:39,643 INFO L175 Difference]: Start difference. First operand has 40 places, 52 transitions, 257 flow. Second operand 7 states and 125 transitions. [2025-04-14 00:37:39,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 139 transitions, 895 flow [2025-04-14 00:37:39,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 139 transitions, 885 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:39,649 INFO L231 Difference]: Finished difference. Result has 50 places, 102 transitions, 761 flow [2025-04-14 00:37:39,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=50, PETRI_TRANSITIONS=102} [2025-04-14 00:37:39,650 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2025-04-14 00:37:39,650 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 102 transitions, 761 flow [2025-04-14 00:37:39,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:39,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:39,650 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:39,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:37:39,650 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:39,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:39,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1454629287, now seen corresponding path program 4 times [2025-04-14 00:37:39,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:39,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845479384] [2025-04-14 00:37:39,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:37:39,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:39,675 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:37:39,688 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:37:39,691 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:37:39,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:39,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:39,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845479384] [2025-04-14 00:37:39,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845479384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:39,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113395346] [2025-04-14 00:37:39,783 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:37:39,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:39,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:39,786 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:39,787 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:39,935 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:37:39,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:37:39,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:37:39,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:39,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 00:37:39,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:40,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:40,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:37:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-14 00:37:40,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113395346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:37:40,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:37:40,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 00:37:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270253556] [2025-04-14 00:37:40,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:37:40,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:37:40,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:40,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:37:40,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:37:40,060 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:40,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 102 transitions, 761 flow. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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:40,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:40,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:40,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:40,525 INFO L116 PetriNetUnfolderBase]: 936/1342 cut-off events. [2025-04-14 00:37:40,525 INFO L117 PetriNetUnfolderBase]: For 2522/2522 co-relation queries the response was YES. [2025-04-14 00:37:40,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5641 conditions, 1342 events. 936/1342 cut-off events. For 2522/2522 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4866 event pairs, 327 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 5545. Up to 1328 conditions per place. [2025-04-14 00:37:40,537 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 87 selfloop transitions, 18 changer transitions 0/105 dead transitions. [2025-04-14 00:37:40,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 105 transitions, 989 flow [2025-04-14 00:37:40,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:37:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:37:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2025-04-14 00:37:40,539 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2943722943722944 [2025-04-14 00:37:40,539 INFO L175 Difference]: Start difference. First operand has 50 places, 102 transitions, 761 flow. Second operand 7 states and 68 transitions. [2025-04-14 00:37:40,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 105 transitions, 989 flow [2025-04-14 00:37:40,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 947 flow, removed 21 selfloop flow, removed 0 redundant places. [2025-04-14 00:37:40,551 INFO L231 Difference]: Finished difference. Result has 57 places, 105 transitions, 787 flow [2025-04-14 00:37:40,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=787, PETRI_PLACES=57, PETRI_TRANSITIONS=105} [2025-04-14 00:37:40,551 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 27 predicate places. [2025-04-14 00:37:40,551 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 105 transitions, 787 flow [2025-04-14 00:37:40,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 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:40,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:40,552 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:40,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:37:40,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:40,752 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:40,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1470382058, now seen corresponding path program 5 times [2025-04-14 00:37:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:40,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435536450] [2025-04-14 00:37:40,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:37:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:40,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-14 00:37:41,008 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:37:41,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:37:41,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-14 00:37:42,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:42,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435536450] [2025-04-14 00:37:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435536450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:42,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049099378] [2025-04-14 00:37:42,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:37:42,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:42,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:42,321 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:42,322 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:42,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 4 equivalence classes. [2025-04-14 00:37:42,606 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:37:42,607 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:37:42,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:42,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 00:37:42,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:43,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:37:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049099378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:37:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-04-14 00:37:43,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11246043] [2025-04-14 00:37:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:43,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:43,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:43,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:43,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:37:43,345 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:43,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 105 transitions, 787 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:43,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:43,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:43,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:44,113 INFO L116 PetriNetUnfolderBase]: 1022/1506 cut-off events. [2025-04-14 00:37:44,113 INFO L117 PetriNetUnfolderBase]: For 2562/2562 co-relation queries the response was YES. [2025-04-14 00:37:44,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5982 conditions, 1506 events. 1022/1506 cut-off events. For 2562/2562 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6053 event pairs, 289 based on Foata normal form. 1/1164 useless extension candidates. Maximal degree in co-relation 5865. Up to 1264 conditions per place. [2025-04-14 00:37:44,123 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 132 selfloop transitions, 6 changer transitions 5/143 dead transitions. [2025-04-14 00:37:44,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 143 transitions, 1284 flow [2025-04-14 00:37:44,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:44,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-14 00:37:44,125 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2025-04-14 00:37:44,125 INFO L175 Difference]: Start difference. First operand has 57 places, 105 transitions, 787 flow. Second operand 5 states and 71 transitions. [2025-04-14 00:37:44,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 143 transitions, 1284 flow [2025-04-14 00:37:44,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 143 transitions, 1248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:44,137 INFO L231 Difference]: Finished difference. Result has 60 places, 108 transitions, 808 flow [2025-04-14 00:37:44,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=808, PETRI_PLACES=60, PETRI_TRANSITIONS=108} [2025-04-14 00:37:44,140 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2025-04-14 00:37:44,140 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 108 transitions, 808 flow [2025-04-14 00:37:44,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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:44,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:44,140 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:44,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 00:37:44,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:44,341 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:44,341 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:44,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1623243520, now seen corresponding path program 6 times [2025-04-14 00:37:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:44,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483455494] [2025-04-14 00:37:44,341 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:37:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:44,355 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 4 equivalence classes. [2025-04-14 00:37:44,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-14 00:37:44,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:37:44,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:45,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:45,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483455494] [2025-04-14 00:37:45,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483455494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:45,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:45,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196745989] [2025-04-14 00:37:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:45,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:45,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:45,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:45,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:45,149 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:45,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 108 transitions, 808 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:45,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:45,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:45,774 INFO L116 PetriNetUnfolderBase]: 1133/1691 cut-off events. [2025-04-14 00:37:45,774 INFO L117 PetriNetUnfolderBase]: For 3587/3587 co-relation queries the response was YES. [2025-04-14 00:37:45,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6725 conditions, 1691 events. 1133/1691 cut-off events. For 3587/3587 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7165 event pairs, 326 based on Foata normal form. 1/1289 useless extension candidates. Maximal degree in co-relation 6640. Up to 1272 conditions per place. [2025-04-14 00:37:45,788 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 132 selfloop transitions, 23 changer transitions 2/157 dead transitions. [2025-04-14 00:37:45,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 157 transitions, 1394 flow [2025-04-14 00:37:45,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:45,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-14 00:37:45,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-14 00:37:45,790 INFO L175 Difference]: Start difference. First operand has 60 places, 108 transitions, 808 flow. Second operand 5 states and 81 transitions. [2025-04-14 00:37:45,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 157 transitions, 1394 flow [2025-04-14 00:37:45,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 157 transitions, 1382 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:37:45,803 INFO L231 Difference]: Finished difference. Result has 64 places, 122 transitions, 1009 flow [2025-04-14 00:37:45,803 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1009, PETRI_PLACES=64, PETRI_TRANSITIONS=122} [2025-04-14 00:37:45,804 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2025-04-14 00:37:45,804 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 122 transitions, 1009 flow [2025-04-14 00:37:45,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:45,804 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:45,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:37:45,805 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:45,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1547570370, now seen corresponding path program 7 times [2025-04-14 00:37:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:45,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829286218] [2025-04-14 00:37:45,805 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:37:45,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:45,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 00:37:45,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 00:37:45,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:45,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:46,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829286218] [2025-04-14 00:37:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829286218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:46,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441752532] [2025-04-14 00:37:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:46,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:46,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:46,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:46,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:46,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 122 transitions, 1009 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:46,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:46,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:47,502 INFO L116 PetriNetUnfolderBase]: 1187/1787 cut-off events. [2025-04-14 00:37:47,502 INFO L117 PetriNetUnfolderBase]: For 4987/4987 co-relation queries the response was YES. [2025-04-14 00:37:47,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7892 conditions, 1787 events. 1187/1787 cut-off events. For 4987/4987 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7790 event pairs, 334 based on Foata normal form. 1/1361 useless extension candidates. Maximal degree in co-relation 7787. Up to 1061 conditions per place. [2025-04-14 00:37:47,514 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 133 selfloop transitions, 35 changer transitions 2/170 dead transitions. [2025-04-14 00:37:47,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 170 transitions, 1637 flow [2025-04-14 00:37:47,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2025-04-14 00:37:47,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-04-14 00:37:47,515 INFO L175 Difference]: Start difference. First operand has 64 places, 122 transitions, 1009 flow. Second operand 5 states and 91 transitions. [2025-04-14 00:37:47,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 170 transitions, 1637 flow [2025-04-14 00:37:47,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 170 transitions, 1618 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:47,531 INFO L231 Difference]: Finished difference. Result has 70 places, 130 transitions, 1220 flow [2025-04-14 00:37:47,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1220, PETRI_PLACES=70, PETRI_TRANSITIONS=130} [2025-04-14 00:37:47,533 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2025-04-14 00:37:47,533 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 130 transitions, 1220 flow [2025-04-14 00:37:47,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:47,533 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:47,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:37:47,534 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:47,534 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1567798628, now seen corresponding path program 8 times [2025-04-14 00:37:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:47,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228807953] [2025-04-14 00:37:47,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:47,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-14 00:37:47,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 32 statements. [2025-04-14 00:37:47,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:47,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:48,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228807953] [2025-04-14 00:37:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228807953] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:48,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:37:48,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868270430] [2025-04-14 00:37:48,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:48,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:37:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:48,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:37:48,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:37:48,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:48,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 130 transitions, 1220 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:48,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:48,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:48,978 INFO L116 PetriNetUnfolderBase]: 1415/2101 cut-off events. [2025-04-14 00:37:48,978 INFO L117 PetriNetUnfolderBase]: For 7056/7056 co-relation queries the response was YES. [2025-04-14 00:37:48,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9895 conditions, 2101 events. 1415/2101 cut-off events. For 7056/7056 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 9322 event pairs, 263 based on Foata normal form. 1/1553 useless extension candidates. Maximal degree in co-relation 9787. Up to 1105 conditions per place. [2025-04-14 00:37:48,993 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 137 selfloop transitions, 61 changer transitions 2/200 dead transitions. [2025-04-14 00:37:48,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 200 transitions, 2168 flow [2025-04-14 00:37:48,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:37:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:37:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2025-04-14 00:37:48,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3852813852813853 [2025-04-14 00:37:48,994 INFO L175 Difference]: Start difference. First operand has 70 places, 130 transitions, 1220 flow. Second operand 7 states and 89 transitions. [2025-04-14 00:37:48,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 200 transitions, 2168 flow [2025-04-14 00:37:49,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 200 transitions, 2154 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:49,023 INFO L231 Difference]: Finished difference. Result has 79 places, 160 transitions, 1766 flow [2025-04-14 00:37:49,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1766, PETRI_PLACES=79, PETRI_TRANSITIONS=160} [2025-04-14 00:37:49,025 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2025-04-14 00:37:49,025 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 160 transitions, 1766 flow [2025-04-14 00:37:49,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:49,025 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:49,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:37:49,025 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:49,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:49,026 INFO L85 PathProgramCache]: Analyzing trace with hash 508443182, now seen corresponding path program 1 times [2025-04-14 00:37:49,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:49,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697289077] [2025-04-14 00:37:49,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:49,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:37:49,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:37:49,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:49,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:49,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:49,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697289077] [2025-04-14 00:37:49,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697289077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:49,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:49,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900009954] [2025-04-14 00:37:49,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:49,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:49,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:49,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:49,161 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:49,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 160 transitions, 1766 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:49,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:49,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:49,664 INFO L116 PetriNetUnfolderBase]: 1513/2251 cut-off events. [2025-04-14 00:37:49,664 INFO L117 PetriNetUnfolderBase]: For 8998/8998 co-relation queries the response was YES. [2025-04-14 00:37:49,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11818 conditions, 2251 events. 1513/2251 cut-off events. For 8998/8998 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10129 event pairs, 254 based on Foata normal form. 4/1655 useless extension candidates. Maximal degree in co-relation 11705. Up to 1526 conditions per place. [2025-04-14 00:37:49,681 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 160 selfloop transitions, 12 changer transitions 51/223 dead transitions. [2025-04-14 00:37:49,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 223 transitions, 2828 flow [2025-04-14 00:37:49,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-14 00:37:49,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5378787878787878 [2025-04-14 00:37:49,682 INFO L175 Difference]: Start difference. First operand has 79 places, 160 transitions, 1766 flow. Second operand 4 states and 71 transitions. [2025-04-14 00:37:49,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 223 transitions, 2828 flow [2025-04-14 00:37:49,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 223 transitions, 2802 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-04-14 00:37:49,709 INFO L231 Difference]: Finished difference. Result has 82 places, 149 transitions, 1666 flow [2025-04-14 00:37:49,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1666, PETRI_PLACES=82, PETRI_TRANSITIONS=149} [2025-04-14 00:37:49,710 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2025-04-14 00:37:49,710 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 149 transitions, 1666 flow [2025-04-14 00:37:49,710 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:49,711 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:49,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:37:49,711 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:49,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash -152335042, now seen corresponding path program 1 times [2025-04-14 00:37:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:49,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825822414] [2025-04-14 00:37:49,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:49,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:37:49,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:37:49,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:49,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:49,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:49,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825822414] [2025-04-14 00:37:49,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825822414] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:49,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:49,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:49,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388841377] [2025-04-14 00:37:49,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:49,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:49,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:49,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:49,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:49,864 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:49,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 149 transitions, 1666 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:49,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:49,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:49,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:50,490 INFO L116 PetriNetUnfolderBase]: 1800/2640 cut-off events. [2025-04-14 00:37:50,490 INFO L117 PetriNetUnfolderBase]: For 9997/9997 co-relation queries the response was YES. [2025-04-14 00:37:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 2640 events. 1800/2640 cut-off events. For 9997/9997 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12094 event pairs, 182 based on Foata normal form. 1/1886 useless extension candidates. Maximal degree in co-relation 13370. Up to 1171 conditions per place. [2025-04-14 00:37:50,507 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 178 selfloop transitions, 41 changer transitions 7/226 dead transitions. [2025-04-14 00:37:50,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 226 transitions, 2746 flow [2025-04-14 00:37:50,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-04-14 00:37:50,508 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-04-14 00:37:50,508 INFO L175 Difference]: Start difference. First operand has 82 places, 149 transitions, 1666 flow. Second operand 5 states and 88 transitions. [2025-04-14 00:37:50,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 226 transitions, 2746 flow [2025-04-14 00:37:50,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 226 transitions, 2696 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-04-14 00:37:50,538 INFO L231 Difference]: Finished difference. Result has 86 places, 164 transitions, 1908 flow [2025-04-14 00:37:50,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1908, PETRI_PLACES=86, PETRI_TRANSITIONS=164} [2025-04-14 00:37:50,539 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2025-04-14 00:37:50,539 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 164 transitions, 1908 flow [2025-04-14 00:37:50,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:50,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:50,539 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:50,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:37:50,539 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:50,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash 936221262, now seen corresponding path program 2 times [2025-04-14 00:37:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:50,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275445769] [2025-04-14 00:37:50,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:50,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:37:50,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:37:50,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:50,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:50,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:50,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275445769] [2025-04-14 00:37:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275445769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247781644] [2025-04-14 00:37:50,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:50,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:50,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:50,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:50,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:50,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 164 transitions, 1908 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:50,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:50,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:51,320 INFO L116 PetriNetUnfolderBase]: 1854/2721 cut-off events. [2025-04-14 00:37:51,320 INFO L117 PetriNetUnfolderBase]: For 11838/11838 co-relation queries the response was YES. [2025-04-14 00:37:51,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 2721 events. 1854/2721 cut-off events. For 11838/11838 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12310 event pairs, 317 based on Foata normal form. 4/1934 useless extension candidates. Maximal degree in co-relation 14773. Up to 2209 conditions per place. [2025-04-14 00:37:51,333 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 154 selfloop transitions, 16 changer transitions 42/212 dead transitions. [2025-04-14 00:37:51,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 212 transitions, 2815 flow [2025-04-14 00:37:51,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-14 00:37:51,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-04-14 00:37:51,334 INFO L175 Difference]: Start difference. First operand has 86 places, 164 transitions, 1908 flow. Second operand 4 states and 69 transitions. [2025-04-14 00:37:51,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 212 transitions, 2815 flow [2025-04-14 00:37:51,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 212 transitions, 2780 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:51,364 INFO L231 Difference]: Finished difference. Result has 91 places, 153 transitions, 1842 flow [2025-04-14 00:37:51,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1879, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1842, PETRI_PLACES=91, PETRI_TRANSITIONS=153} [2025-04-14 00:37:51,364 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-04-14 00:37:51,364 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 153 transitions, 1842 flow [2025-04-14 00:37:51,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:51,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:51,364 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:51,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:37:51,365 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:51,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1486756302, now seen corresponding path program 1 times [2025-04-14 00:37:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:51,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683066993] [2025-04-14 00:37:51,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:51,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-14 00:37:51,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-14 00:37:51,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:51,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:51,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:51,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683066993] [2025-04-14 00:37:51,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683066993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:51,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474201128] [2025-04-14 00:37:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:51,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:37:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:51,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:37:51,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:37:51,463 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:51,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 153 transitions, 1842 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:51,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:51,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:51,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:51,994 INFO L116 PetriNetUnfolderBase]: 1730/2551 cut-off events. [2025-04-14 00:37:51,995 INFO L117 PetriNetUnfolderBase]: For 13038/13038 co-relation queries the response was YES. [2025-04-14 00:37:52,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13906 conditions, 2551 events. 1730/2551 cut-off events. For 13038/13038 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11433 event pairs, 454 based on Foata normal form. 6/1885 useless extension candidates. Maximal degree in co-relation 13792. Up to 2165 conditions per place. [2025-04-14 00:37:52,008 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 151 selfloop transitions, 27 changer transitions 0/178 dead transitions. [2025-04-14 00:37:52,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 178 transitions, 2419 flow [2025-04-14 00:37:52,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:37:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:37:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-14 00:37:52,009 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2025-04-14 00:37:52,009 INFO L175 Difference]: Start difference. First operand has 91 places, 153 transitions, 1842 flow. Second operand 3 states and 53 transitions. [2025-04-14 00:37:52,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 178 transitions, 2419 flow [2025-04-14 00:37:52,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 178 transitions, 2399 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 00:37:52,032 INFO L231 Difference]: Finished difference. Result has 87 places, 148 transitions, 1860 flow [2025-04-14 00:37:52,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1765, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1860, PETRI_PLACES=87, PETRI_TRANSITIONS=148} [2025-04-14 00:37:52,033 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2025-04-14 00:37:52,033 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 148 transitions, 1860 flow [2025-04-14 00:37:52,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:52,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:52,033 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:52,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:37:52,033 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:52,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 300847748, now seen corresponding path program 3 times [2025-04-14 00:37:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:52,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894577674] [2025-04-14 00:37:52,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:37:52,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:52,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-14 00:37:52,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:37:52,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:37:52,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:52,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894577674] [2025-04-14 00:37:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894577674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:52,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:52,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951739677] [2025-04-14 00:37:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:52,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:52,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:52,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:52,143 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:52,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 148 transitions, 1860 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:52,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:52,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:52,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:52,810 INFO L116 PetriNetUnfolderBase]: 1800/2681 cut-off events. [2025-04-14 00:37:52,810 INFO L117 PetriNetUnfolderBase]: For 13750/13750 co-relation queries the response was YES. [2025-04-14 00:37:52,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14894 conditions, 2681 events. 1800/2681 cut-off events. For 13750/13750 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 12411 event pairs, 201 based on Foata normal form. 5/1974 useless extension candidates. Maximal degree in co-relation 14779. Up to 1131 conditions per place. [2025-04-14 00:37:52,825 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 160 selfloop transitions, 44 changer transitions 36/240 dead transitions. [2025-04-14 00:37:52,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 3115 flow [2025-04-14 00:37:52,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:37:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:37:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-04-14 00:37:52,826 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2025-04-14 00:37:52,826 INFO L175 Difference]: Start difference. First operand has 87 places, 148 transitions, 1860 flow. Second operand 6 states and 111 transitions. [2025-04-14 00:37:52,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 3115 flow [2025-04-14 00:37:52,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 240 transitions, 3064 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:52,854 INFO L231 Difference]: Finished difference. Result has 95 places, 138 transitions, 1764 flow [2025-04-14 00:37:52,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1821, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1764, PETRI_PLACES=95, PETRI_TRANSITIONS=138} [2025-04-14 00:37:52,855 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2025-04-14 00:37:52,855 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 138 transitions, 1764 flow [2025-04-14 00:37:52,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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:52,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:52,855 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:52,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:37:52,855 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:52,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:52,855 INFO L85 PathProgramCache]: Analyzing trace with hash -110807646, now seen corresponding path program 2 times [2025-04-14 00:37:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:52,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510680040] [2025-04-14 00:37:52,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:52,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:52,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-14 00:37:52,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 33 statements. [2025-04-14 00:37:52,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:52,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:37:52,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:52,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510680040] [2025-04-14 00:37:52,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510680040] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:52,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:52,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:37:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125676874] [2025-04-14 00:37:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:52,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:37:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:52,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:37:52,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:37:52,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:52,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 138 transitions, 1764 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:52,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:52,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:52,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:53,425 INFO L116 PetriNetUnfolderBase]: 1583/2341 cut-off events. [2025-04-14 00:37:53,425 INFO L117 PetriNetUnfolderBase]: For 15541/15541 co-relation queries the response was YES. [2025-04-14 00:37:53,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13676 conditions, 2341 events. 1583/2341 cut-off events. For 15541/15541 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10210 event pairs, 550 based on Foata normal form. 2/1726 useless extension candidates. Maximal degree in co-relation 13557. Up to 2219 conditions per place. [2025-04-14 00:37:53,438 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 127 selfloop transitions, 0 changer transitions 25/152 dead transitions. [2025-04-14 00:37:53,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 152 transitions, 2111 flow [2025-04-14 00:37:53,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:37:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:37:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-14 00:37:53,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2025-04-14 00:37:53,439 INFO L175 Difference]: Start difference. First operand has 95 places, 138 transitions, 1764 flow. Second operand 4 states and 59 transitions. [2025-04-14 00:37:53,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 152 transitions, 2111 flow [2025-04-14 00:37:53,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 152 transitions, 1981 flow, removed 45 selfloop flow, removed 3 redundant places. [2025-04-14 00:37:53,469 INFO L231 Difference]: Finished difference. Result has 95 places, 127 transitions, 1457 flow [2025-04-14 00:37:53,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1457, PETRI_PLACES=95, PETRI_TRANSITIONS=127} [2025-04-14 00:37:53,470 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2025-04-14 00:37:53,470 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 127 transitions, 1457 flow [2025-04-14 00:37:53,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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:53,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:53,470 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:53,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:37:53,470 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:53,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1564889740, now seen corresponding path program 1 times [2025-04-14 00:37:53,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:53,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184626659] [2025-04-14 00:37:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:37:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 00:37:53,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:37:53,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:37:53,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:37:53,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:53,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184626659] [2025-04-14 00:37:53,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184626659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:53,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:53,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:53,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185847874] [2025-04-14 00:37:53,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:53,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:53,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:53,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:53,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:53,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:53,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 127 transitions, 1457 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:53,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:53,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:53,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:54,707 INFO L116 PetriNetUnfolderBase]: 2032/2991 cut-off events. [2025-04-14 00:37:54,708 INFO L117 PetriNetUnfolderBase]: For 13290/13290 co-relation queries the response was YES. [2025-04-14 00:37:54,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16204 conditions, 2991 events. 2032/2991 cut-off events. For 13290/13290 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 13698 event pairs, 160 based on Foata normal form. 2/2144 useless extension candidates. Maximal degree in co-relation 16167. Up to 1624 conditions per place. [2025-04-14 00:37:54,722 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 158 selfloop transitions, 58 changer transitions 4/220 dead transitions. [2025-04-14 00:37:54,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 220 transitions, 2721 flow [2025-04-14 00:37:54,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:37:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:37:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2025-04-14 00:37:54,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2025-04-14 00:37:54,724 INFO L175 Difference]: Start difference. First operand has 95 places, 127 transitions, 1457 flow. Second operand 6 states and 95 transitions. [2025-04-14 00:37:54,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 220 transitions, 2721 flow [2025-04-14 00:37:54,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 220 transitions, 2609 flow, removed 31 selfloop flow, removed 6 redundant places. [2025-04-14 00:37:54,747 INFO L231 Difference]: Finished difference. Result has 91 places, 159 transitions, 2002 flow [2025-04-14 00:37:54,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2002, PETRI_PLACES=91, PETRI_TRANSITIONS=159} [2025-04-14 00:37:54,748 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-04-14 00:37:54,748 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 159 transitions, 2002 flow [2025-04-14 00:37:54,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:54,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:54,749 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:54,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:37:54,749 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:54,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:54,749 INFO L85 PathProgramCache]: Analyzing trace with hash -378458996, now seen corresponding path program 2 times [2025-04-14 00:37:54,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:54,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491915241] [2025-04-14 00:37:54,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:37:54,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:54,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-14 00:37:54,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-14 00:37:54,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:37:54,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:37:54,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:54,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491915241] [2025-04-14 00:37:54,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491915241] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:54,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:54,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236588445] [2025-04-14 00:37:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:54,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:54,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:54,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:54,914 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:54,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 159 transitions, 2002 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:54,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:54,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:54,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:55,606 INFO L116 PetriNetUnfolderBase]: 2067/3076 cut-off events. [2025-04-14 00:37:55,606 INFO L117 PetriNetUnfolderBase]: For 16491/16491 co-relation queries the response was YES. [2025-04-14 00:37:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17428 conditions, 3076 events. 2067/3076 cut-off events. For 16491/16491 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 14458 event pairs, 294 based on Foata normal form. 14/2220 useless extension candidates. Maximal degree in co-relation 17392. Up to 2389 conditions per place. [2025-04-14 00:37:55,621 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 162 selfloop transitions, 31 changer transitions 11/204 dead transitions. [2025-04-14 00:37:55,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 204 transitions, 2728 flow [2025-04-14 00:37:55,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:37:55,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:37:55,622 INFO L175 Difference]: Start difference. First operand has 91 places, 159 transitions, 2002 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:37:55,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 204 transitions, 2728 flow [2025-04-14 00:37:55,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 204 transitions, 2678 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-04-14 00:37:55,645 INFO L231 Difference]: Finished difference. Result has 97 places, 158 transitions, 2010 flow [2025-04-14 00:37:55,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2010, PETRI_PLACES=97, PETRI_TRANSITIONS=158} [2025-04-14 00:37:55,646 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 67 predicate places. [2025-04-14 00:37:55,646 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 158 transitions, 2010 flow [2025-04-14 00:37:55,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:55,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:55,646 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:55,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:37:55,646 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:55,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash -616238918, now seen corresponding path program 3 times [2025-04-14 00:37:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:55,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804684254] [2025-04-14 00:37:55,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:37:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:55,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-14 00:37:55,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-14 00:37:55,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:37:55,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:37:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:55,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804684254] [2025-04-14 00:37:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804684254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026027949] [2025-04-14 00:37:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:55,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:55,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:55,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:55,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:55,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 158 transitions, 2010 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:55,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:55,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:56,490 INFO L116 PetriNetUnfolderBase]: 2063/3076 cut-off events. [2025-04-14 00:37:56,491 INFO L117 PetriNetUnfolderBase]: For 18600/18600 co-relation queries the response was YES. [2025-04-14 00:37:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17400 conditions, 3076 events. 2063/3076 cut-off events. For 18600/18600 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 14405 event pairs, 567 based on Foata normal form. 10/2204 useless extension candidates. Maximal degree in co-relation 17361. Up to 2540 conditions per place. [2025-04-14 00:37:56,508 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 160 selfloop transitions, 16 changer transitions 17/193 dead transitions. [2025-04-14 00:37:56,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 193 transitions, 2603 flow [2025-04-14 00:37:56,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:37:56,509 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:37:56,510 INFO L175 Difference]: Start difference. First operand has 97 places, 158 transitions, 2010 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:37:56,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 193 transitions, 2603 flow [2025-04-14 00:37:56,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 193 transitions, 2547 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-04-14 00:37:56,544 INFO L231 Difference]: Finished difference. Result has 99 places, 150 transitions, 1877 flow [2025-04-14 00:37:56,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1877, PETRI_PLACES=99, PETRI_TRANSITIONS=150} [2025-04-14 00:37:56,545 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-04-14 00:37:56,545 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 150 transitions, 1877 flow [2025-04-14 00:37:56,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:56,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:56,545 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:56,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:37:56,545 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:56,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash -94227058, now seen corresponding path program 4 times [2025-04-14 00:37:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:56,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095121833] [2025-04-14 00:37:56,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:37:56,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:56,561 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-14 00:37:56,628 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:37:56,628 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:37:56,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:56,910 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:37:56,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:56,911 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095121833] [2025-04-14 00:37:56,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095121833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:56,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:37:56,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:37:56,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367866477] [2025-04-14 00:37:56,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:56,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:56,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:56,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:56,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:37:56,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:56,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 150 transitions, 1877 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:56,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:56,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:56,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:57,658 INFO L116 PetriNetUnfolderBase]: 2154/3177 cut-off events. [2025-04-14 00:37:57,658 INFO L117 PetriNetUnfolderBase]: For 18208/18208 co-relation queries the response was YES. [2025-04-14 00:37:57,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17954 conditions, 3177 events. 2154/3177 cut-off events. For 18208/18208 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 14757 event pairs, 331 based on Foata normal form. 1/2251 useless extension candidates. Maximal degree in co-relation 17915. Up to 1736 conditions per place. [2025-04-14 00:37:57,673 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 149 selfloop transitions, 47 changer transitions 7/203 dead transitions. [2025-04-14 00:37:57,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 203 transitions, 2752 flow [2025-04-14 00:37:57,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-14 00:37:57,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-04-14 00:37:57,674 INFO L175 Difference]: Start difference. First operand has 99 places, 150 transitions, 1877 flow. Second operand 5 states and 79 transitions. [2025-04-14 00:37:57,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 203 transitions, 2752 flow [2025-04-14 00:37:57,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 203 transitions, 2705 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-14 00:37:57,699 INFO L231 Difference]: Finished difference. Result has 101 places, 161 transitions, 2161 flow [2025-04-14 00:37:57,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2161, PETRI_PLACES=101, PETRI_TRANSITIONS=161} [2025-04-14 00:37:57,699 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2025-04-14 00:37:57,699 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 161 transitions, 2161 flow [2025-04-14 00:37:57,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:57,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:57,700 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:57,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:37:57,700 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:57,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 284388060, now seen corresponding path program 5 times [2025-04-14 00:37:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:57,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020417378] [2025-04-14 00:37:57,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:37:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:57,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-14 00:37:57,866 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:37:57,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:37:57,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-04-14 00:37:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:37:58,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020417378] [2025-04-14 00:37:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020417378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:37:58,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610636272] [2025-04-14 00:37:58,218 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:37:58,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:58,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:37:58,221 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:37:58,229 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:37:58,424 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-14 00:37:58,667 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 00:37:58,667 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:37:58,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:37:58,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 00:37:58,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:37:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:37:58,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 00:37:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610636272] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:37:58,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:37:58,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-14 00:37:58,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384392122] [2025-04-14 00:37:58,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:37:58,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:37:58,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:37:58,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:37:58,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:37:58,802 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:37:58,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 161 transitions, 2161 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:58,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:37:58,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:37:58,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:37:59,539 INFO L116 PetriNetUnfolderBase]: 2154/3169 cut-off events. [2025-04-14 00:37:59,539 INFO L117 PetriNetUnfolderBase]: For 22052/22052 co-relation queries the response was YES. [2025-04-14 00:37:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19113 conditions, 3169 events. 2154/3169 cut-off events. For 22052/22052 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14589 event pairs, 580 based on Foata normal form. 1/2243 useless extension candidates. Maximal degree in co-relation 19073. Up to 2517 conditions per place. [2025-04-14 00:37:59,559 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 181 selfloop transitions, 14 changer transitions 9/204 dead transitions. [2025-04-14 00:37:59,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 204 transitions, 2977 flow [2025-04-14 00:37:59,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:37:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:37:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:37:59,560 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:37:59,560 INFO L175 Difference]: Start difference. First operand has 101 places, 161 transitions, 2161 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:37:59,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 204 transitions, 2977 flow [2025-04-14 00:37:59,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 204 transitions, 2946 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-04-14 00:37:59,594 INFO L231 Difference]: Finished difference. Result has 106 places, 161 transitions, 2180 flow [2025-04-14 00:37:59,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2180, PETRI_PLACES=106, PETRI_TRANSITIONS=161} [2025-04-14 00:37:59,594 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2025-04-14 00:37:59,594 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 161 transitions, 2180 flow [2025-04-14 00:37:59,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:59,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:37:59,595 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:37:59,602 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:37:59,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:37:59,795 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:37:59,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:37:59,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1410384362, now seen corresponding path program 6 times [2025-04-14 00:37:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:37:59,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504078982] [2025-04-14 00:37:59,796 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:37:59,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:37:59,809 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 34 statements into 4 equivalence classes. [2025-04-14 00:37:59,831 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 34 statements. [2025-04-14 00:37:59,831 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:37:59,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:00,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:00,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504078982] [2025-04-14 00:38:00,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504078982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:00,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:00,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:00,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028257116] [2025-04-14 00:38:00,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:00,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:38:00,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:00,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:38:00,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:38:00,016 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:00,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 161 transitions, 2180 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:00,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:00,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:00,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:01,134 INFO L116 PetriNetUnfolderBase]: 2144/3149 cut-off events. [2025-04-14 00:38:01,134 INFO L117 PetriNetUnfolderBase]: For 23640/23640 co-relation queries the response was YES. [2025-04-14 00:38:01,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19010 conditions, 3149 events. 2144/3149 cut-off events. For 23640/23640 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14408 event pairs, 579 based on Foata normal form. 1/2232 useless extension candidates. Maximal degree in co-relation 18968. Up to 2517 conditions per place. [2025-04-14 00:38:01,148 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 173 selfloop transitions, 19 changer transitions 5/197 dead transitions. [2025-04-14 00:38:01,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 197 transitions, 2925 flow [2025-04-14 00:38:01,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:38:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:38:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2025-04-14 00:38:01,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2025-04-14 00:38:01,149 INFO L175 Difference]: Start difference. First operand has 106 places, 161 transitions, 2180 flow. Second operand 5 states and 71 transitions. [2025-04-14 00:38:01,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 197 transitions, 2925 flow [2025-04-14 00:38:01,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 197 transitions, 2910 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-14 00:38:01,181 INFO L231 Difference]: Finished difference. Result has 110 places, 166 transitions, 2317 flow [2025-04-14 00:38:01,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2167, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2317, PETRI_PLACES=110, PETRI_TRANSITIONS=166} [2025-04-14 00:38:01,181 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2025-04-14 00:38:01,181 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 166 transitions, 2317 flow [2025-04-14 00:38:01,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:01,182 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:01,182 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:38:01,182 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:01,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2042301108, now seen corresponding path program 1 times [2025-04-14 00:38:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:01,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167046537] [2025-04-14 00:38:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:38:01,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:01,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:38:01,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:38:01,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:01,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:01,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167046537] [2025-04-14 00:38:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167046537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:01,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325734022] [2025-04-14 00:38:01,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:01,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:01,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:01,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:01,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:01,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:01,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 166 transitions, 2317 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:01,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:01,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:02,189 INFO L116 PetriNetUnfolderBase]: 2139/3147 cut-off events. [2025-04-14 00:38:02,190 INFO L117 PetriNetUnfolderBase]: For 24349/24349 co-relation queries the response was YES. [2025-04-14 00:38:02,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19143 conditions, 3147 events. 2139/3147 cut-off events. For 24349/24349 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14511 event pairs, 249 based on Foata normal form. 38/2269 useless extension candidates. Maximal degree in co-relation 19099. Up to 2372 conditions per place. [2025-04-14 00:38:02,205 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 165 selfloop transitions, 21 changer transitions 1/187 dead transitions. [2025-04-14 00:38:02,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 187 transitions, 2801 flow [2025-04-14 00:38:02,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-14 00:38:02,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-04-14 00:38:02,206 INFO L175 Difference]: Start difference. First operand has 110 places, 166 transitions, 2317 flow. Second operand 4 states and 67 transitions. [2025-04-14 00:38:02,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 187 transitions, 2801 flow [2025-04-14 00:38:02,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 187 transitions, 2736 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-14 00:38:02,240 INFO L231 Difference]: Finished difference. Result has 112 places, 162 transitions, 2256 flow [2025-04-14 00:38:02,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2256, PETRI_PLACES=112, PETRI_TRANSITIONS=162} [2025-04-14 00:38:02,240 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2025-04-14 00:38:02,240 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 162 transitions, 2256 flow [2025-04-14 00:38:02,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:02,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:02,241 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:02,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 00:38:02,241 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:02,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1910222862, now seen corresponding path program 1 times [2025-04-14 00:38:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:02,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944372679] [2025-04-14 00:38:02,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:38:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:02,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 00:38:02,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:38:02,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:02,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:02,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944372679] [2025-04-14 00:38:02,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944372679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:02,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:02,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921949107] [2025-04-14 00:38:02,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:02,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:02,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:02,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:02,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:02,323 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:02,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 162 transitions, 2256 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:02,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:02,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:02,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:03,182 INFO L116 PetriNetUnfolderBase]: 2110/3098 cut-off events. [2025-04-14 00:38:03,183 INFO L117 PetriNetUnfolderBase]: For 22542/22542 co-relation queries the response was YES. [2025-04-14 00:38:03,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18893 conditions, 3098 events. 2110/3098 cut-off events. For 22542/22542 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14185 event pairs, 271 based on Foata normal form. 8/2219 useless extension candidates. Maximal degree in co-relation 18848. Up to 2850 conditions per place. [2025-04-14 00:38:03,200 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 168 selfloop transitions, 15 changer transitions 4/187 dead transitions. [2025-04-14 00:38:03,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 187 transitions, 2770 flow [2025-04-14 00:38:03,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-14 00:38:03,201 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-14 00:38:03,201 INFO L175 Difference]: Start difference. First operand has 112 places, 162 transitions, 2256 flow. Second operand 4 states and 64 transitions. [2025-04-14 00:38:03,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 187 transitions, 2770 flow [2025-04-14 00:38:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 187 transitions, 2760 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:38:03,262 INFO L231 Difference]: Finished difference. Result has 112 places, 157 transitions, 2190 flow [2025-04-14 00:38:03,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2190, PETRI_PLACES=112, PETRI_TRANSITIONS=157} [2025-04-14 00:38:03,263 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2025-04-14 00:38:03,263 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 157 transitions, 2190 flow [2025-04-14 00:38:03,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:03,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:03,263 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:03,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 00:38:03,263 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:03,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 20946086, now seen corresponding path program 2 times [2025-04-14 00:38:03,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:03,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42309503] [2025-04-14 00:38:03,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:38:03,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:03,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:38:03,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-14 00:38:03,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:38:03,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:03,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:03,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42309503] [2025-04-14 00:38:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42309503] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:03,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:03,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136485192] [2025-04-14 00:38:03,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:03,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:03,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:03,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:03,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:03,328 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:03,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 157 transitions, 2190 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:03,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:03,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:03,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:04,057 INFO L116 PetriNetUnfolderBase]: 2112/3095 cut-off events. [2025-04-14 00:38:04,058 INFO L117 PetriNetUnfolderBase]: For 23039/23039 co-relation queries the response was YES. [2025-04-14 00:38:04,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18814 conditions, 3095 events. 2112/3095 cut-off events. For 23039/23039 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14088 event pairs, 274 based on Foata normal form. 21/2235 useless extension candidates. Maximal degree in co-relation 18769. Up to 2584 conditions per place. [2025-04-14 00:38:04,078 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 163 selfloop transitions, 22 changer transitions 4/189 dead transitions. [2025-04-14 00:38:04,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 189 transitions, 2830 flow [2025-04-14 00:38:04,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-14 00:38:04,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2025-04-14 00:38:04,080 INFO L175 Difference]: Start difference. First operand has 112 places, 157 transitions, 2190 flow. Second operand 4 states and 67 transitions. [2025-04-14 00:38:04,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 189 transitions, 2830 flow [2025-04-14 00:38:04,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 189 transitions, 2812 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:38:04,114 INFO L231 Difference]: Finished difference. Result has 115 places, 158 transitions, 2277 flow [2025-04-14 00:38:04,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2277, PETRI_PLACES=115, PETRI_TRANSITIONS=158} [2025-04-14 00:38:04,115 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-04-14 00:38:04,115 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 158 transitions, 2277 flow [2025-04-14 00:38:04,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:04,115 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:04,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 00:38:04,116 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:04,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:04,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1450626702, now seen corresponding path program 3 times [2025-04-14 00:38:04,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:04,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702559881] [2025-04-14 00:38:04,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:38:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:04,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-14 00:38:04,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-14 00:38:04,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:38:04,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:04,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702559881] [2025-04-14 00:38:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702559881] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:04,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:04,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:04,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375892379] [2025-04-14 00:38:04,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:04,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:04,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:04,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:04,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:04,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 158 transitions, 2277 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:04,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:04,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:05,001 INFO L116 PetriNetUnfolderBase]: 2040/2987 cut-off events. [2025-04-14 00:38:05,001 INFO L117 PetriNetUnfolderBase]: For 24433/24433 co-relation queries the response was YES. [2025-04-14 00:38:05,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18330 conditions, 2987 events. 2040/2987 cut-off events. For 24433/24433 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 13421 event pairs, 263 based on Foata normal form. 28/2158 useless extension candidates. Maximal degree in co-relation 18283. Up to 2765 conditions per place. [2025-04-14 00:38:05,018 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 155 selfloop transitions, 22 changer transitions 4/181 dead transitions. [2025-04-14 00:38:05,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 181 transitions, 2835 flow [2025-04-14 00:38:05,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-14 00:38:05,019 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-14 00:38:05,019 INFO L175 Difference]: Start difference. First operand has 115 places, 158 transitions, 2277 flow. Second operand 4 states and 60 transitions. [2025-04-14 00:38:05,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 181 transitions, 2835 flow [2025-04-14 00:38:05,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 181 transitions, 2696 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-04-14 00:38:05,057 INFO L231 Difference]: Finished difference. Result has 112 places, 157 transitions, 2188 flow [2025-04-14 00:38:05,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2188, PETRI_PLACES=112, PETRI_TRANSITIONS=157} [2025-04-14 00:38:05,057 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 82 predicate places. [2025-04-14 00:38:05,057 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 157 transitions, 2188 flow [2025-04-14 00:38:05,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:05,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:05,058 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:05,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 00:38:05,058 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:05,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash 880258066, now seen corresponding path program 2 times [2025-04-14 00:38:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:05,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155622773] [2025-04-14 00:38:05,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:38:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:05,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:38:05,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-14 00:38:05,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:38:05,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:05,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:05,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155622773] [2025-04-14 00:38:05,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155622773] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:05,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:05,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:05,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052575632] [2025-04-14 00:38:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:05,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:05,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:05,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:05,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:05,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 157 transitions, 2188 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:05,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:05,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:05,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:05,818 INFO L116 PetriNetUnfolderBase]: 1906/2781 cut-off events. [2025-04-14 00:38:05,818 INFO L117 PetriNetUnfolderBase]: For 20035/20035 co-relation queries the response was YES. [2025-04-14 00:38:05,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16634 conditions, 2781 events. 1906/2781 cut-off events. For 20035/20035 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12153 event pairs, 171 based on Foata normal form. 37/2005 useless extension candidates. Maximal degree in co-relation 16591. Up to 2282 conditions per place. [2025-04-14 00:38:05,841 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 153 selfloop transitions, 20 changer transitions 4/177 dead transitions. [2025-04-14 00:38:05,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 177 transitions, 2648 flow [2025-04-14 00:38:05,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:05,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-14 00:38:05,843 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2025-04-14 00:38:05,843 INFO L175 Difference]: Start difference. First operand has 112 places, 157 transitions, 2188 flow. Second operand 4 states and 65 transitions. [2025-04-14 00:38:05,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 177 transitions, 2648 flow [2025-04-14 00:38:05,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 177 transitions, 2628 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-14 00:38:05,889 INFO L231 Difference]: Finished difference. Result has 115 places, 149 transitions, 2074 flow [2025-04-14 00:38:05,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2074, PETRI_PLACES=115, PETRI_TRANSITIONS=149} [2025-04-14 00:38:05,890 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-04-14 00:38:05,890 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 149 transitions, 2074 flow [2025-04-14 00:38:05,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:05,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:05,890 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:05,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 00:38:05,891 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:05,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:05,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1871471554, now seen corresponding path program 3 times [2025-04-14 00:38:05,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:05,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940760569] [2025-04-14 00:38:05,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:38:05,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:05,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-14 00:38:05,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 35 statements. [2025-04-14 00:38:05,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:38:05,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:05,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:05,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940760569] [2025-04-14 00:38:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940760569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:05,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661073520] [2025-04-14 00:38:05,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:05,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:05,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:05,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:05,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:05,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 149 transitions, 2074 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:05,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:05,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:05,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:06,706 INFO L116 PetriNetUnfolderBase]: 1871/2727 cut-off events. [2025-04-14 00:38:06,707 INFO L117 PetriNetUnfolderBase]: For 17384/17384 co-relation queries the response was YES. [2025-04-14 00:38:06,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16366 conditions, 2727 events. 1871/2727 cut-off events. For 17384/17384 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 11882 event pairs, 250 based on Foata normal form. 6/1926 useless extension candidates. Maximal degree in co-relation 16322. Up to 2620 conditions per place. [2025-04-14 00:38:06,723 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 138 selfloop transitions, 10 changer transitions 7/155 dead transitions. [2025-04-14 00:38:06,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 155 transitions, 2389 flow [2025-04-14 00:38:06,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:06,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-14 00:38:06,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 00:38:06,725 INFO L175 Difference]: Start difference. First operand has 115 places, 149 transitions, 2074 flow. Second operand 4 states and 55 transitions. [2025-04-14 00:38:06,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 155 transitions, 2389 flow [2025-04-14 00:38:06,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 155 transitions, 2296 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-04-14 00:38:06,750 INFO L231 Difference]: Finished difference. Result has 111 places, 141 transitions, 1892 flow [2025-04-14 00:38:06,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1892, PETRI_PLACES=111, PETRI_TRANSITIONS=141} [2025-04-14 00:38:06,750 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2025-04-14 00:38:06,751 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 141 transitions, 1892 flow [2025-04-14 00:38:06,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:06,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:06,751 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:06,751 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 00:38:06,751 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:06,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash -413632292, now seen corresponding path program 4 times [2025-04-14 00:38:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:06,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902348504] [2025-04-14 00:38:06,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:38:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:06,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:38:06,778 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:38:06,778 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:38:06,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:06,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902348504] [2025-04-14 00:38:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902348504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:06,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:06,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139724808] [2025-04-14 00:38:06,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:06,868 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:06,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:06,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 141 transitions, 1892 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:06,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:06,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:06,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:07,569 INFO L116 PetriNetUnfolderBase]: 1810/2624 cut-off events. [2025-04-14 00:38:07,569 INFO L117 PetriNetUnfolderBase]: For 15685/15685 co-relation queries the response was YES. [2025-04-14 00:38:07,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15280 conditions, 2624 events. 1810/2624 cut-off events. For 15685/15685 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11181 event pairs, 585 based on Foata normal form. 6/1849 useless extension candidates. Maximal degree in co-relation 15238. Up to 2502 conditions per place. [2025-04-14 00:38:07,586 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 146 selfloop transitions, 2 changer transitions 9/157 dead transitions. [2025-04-14 00:38:07,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 157 transitions, 2247 flow [2025-04-14 00:38:07,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 00:38:07,587 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-04-14 00:38:07,587 INFO L175 Difference]: Start difference. First operand has 111 places, 141 transitions, 1892 flow. Second operand 4 states and 57 transitions. [2025-04-14 00:38:07,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 157 transitions, 2247 flow [2025-04-14 00:38:07,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 157 transitions, 2125 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-04-14 00:38:07,610 INFO L231 Difference]: Finished difference. Result has 107 places, 137 transitions, 1673 flow [2025-04-14 00:38:07,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1673, PETRI_PLACES=107, PETRI_TRANSITIONS=137} [2025-04-14 00:38:07,611 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2025-04-14 00:38:07,611 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 137 transitions, 1673 flow [2025-04-14 00:38:07,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:07,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:07,611 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:07,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 00:38:07,611 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:07,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1469320548, now seen corresponding path program 4 times [2025-04-14 00:38:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:07,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442026223] [2025-04-14 00:38:07,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:38:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:07,628 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-14 00:38:07,636 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:38:07,636 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:38:07,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:07,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442026223] [2025-04-14 00:38:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442026223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889213351] [2025-04-14 00:38:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:07,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:07,698 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:07,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 137 transitions, 1673 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:07,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:07,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:08,332 INFO L116 PetriNetUnfolderBase]: 1737/2500 cut-off events. [2025-04-14 00:38:08,332 INFO L117 PetriNetUnfolderBase]: For 12116/12116 co-relation queries the response was YES. [2025-04-14 00:38:08,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13884 conditions, 2500 events. 1737/2500 cut-off events. For 12116/12116 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10372 event pairs, 550 based on Foata normal form. 6/1753 useless extension candidates. Maximal degree in co-relation 13845. Up to 2361 conditions per place. [2025-04-14 00:38:08,345 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 142 selfloop transitions, 3 changer transitions 3/148 dead transitions. [2025-04-14 00:38:08,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 148 transitions, 2007 flow [2025-04-14 00:38:08,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-14 00:38:08,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-14 00:38:08,346 INFO L175 Difference]: Start difference. First operand has 107 places, 137 transitions, 1673 flow. Second operand 4 states and 56 transitions. [2025-04-14 00:38:08,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 148 transitions, 2007 flow [2025-04-14 00:38:08,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 148 transitions, 1979 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-14 00:38:08,370 INFO L231 Difference]: Finished difference. Result has 104 places, 130 transitions, 1546 flow [2025-04-14 00:38:08,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1587, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1546, PETRI_PLACES=104, PETRI_TRANSITIONS=130} [2025-04-14 00:38:08,371 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2025-04-14 00:38:08,371 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 130 transitions, 1546 flow [2025-04-14 00:38:08,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:08,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:08,372 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:08,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 00:38:08,372 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:08,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash -230739770, now seen corresponding path program 5 times [2025-04-14 00:38:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:08,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798469589] [2025-04-14 00:38:08,373 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:38:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:08,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-14 00:38:08,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:38:08,415 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:38:08,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:08,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798469589] [2025-04-14 00:38:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798469589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:08,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:08,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218165507] [2025-04-14 00:38:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:08,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:08,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:08,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:08,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:08,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 130 transitions, 1546 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:08,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:08,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:08,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:09,144 INFO L116 PetriNetUnfolderBase]: 1680/2401 cut-off events. [2025-04-14 00:38:09,144 INFO L117 PetriNetUnfolderBase]: For 10527/10527 co-relation queries the response was YES. [2025-04-14 00:38:09,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13262 conditions, 2401 events. 1680/2401 cut-off events. For 10527/10527 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9758 event pairs, 213 based on Foata normal form. 6/1680 useless extension candidates. Maximal degree in co-relation 13226. Up to 2301 conditions per place. [2025-04-14 00:38:09,154 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 122 selfloop transitions, 8 changer transitions 7/137 dead transitions. [2025-04-14 00:38:09,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 137 transitions, 1795 flow [2025-04-14 00:38:09,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-04-14 00:38:09,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-04-14 00:38:09,155 INFO L175 Difference]: Start difference. First operand has 104 places, 130 transitions, 1546 flow. Second operand 4 states and 53 transitions. [2025-04-14 00:38:09,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 137 transitions, 1795 flow [2025-04-14 00:38:09,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 137 transitions, 1757 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-14 00:38:09,177 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 1408 flow [2025-04-14 00:38:09,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1408, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2025-04-14 00:38:09,177 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2025-04-14 00:38:09,177 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 1408 flow [2025-04-14 00:38:09,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:09,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:09,178 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:09,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 00:38:09,178 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:09,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:09,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1988053594, now seen corresponding path program 5 times [2025-04-14 00:38:09,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:09,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724239122] [2025-04-14 00:38:09,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:38:09,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:09,193 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 4 equivalence classes. [2025-04-14 00:38:09,214 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 00:38:09,215 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:38:09,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:09,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:09,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724239122] [2025-04-14 00:38:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724239122] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:09,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:09,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:38:09,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553335162] [2025-04-14 00:38:09,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:09,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:38:09,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:09,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:38:09,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:38:09,281 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:09,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 1408 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:09,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:09,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:09,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:09,940 INFO L116 PetriNetUnfolderBase]: 1599/2272 cut-off events. [2025-04-14 00:38:09,940 INFO L117 PetriNetUnfolderBase]: For 10400/10400 co-relation queries the response was YES. [2025-04-14 00:38:09,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12354 conditions, 2272 events. 1599/2272 cut-off events. For 10400/10400 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 8946 event pairs, 513 based on Foata normal form. 7/1580 useless extension candidates. Maximal degree in co-relation 12319. Up to 2258 conditions per place. [2025-04-14 00:38:09,951 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 115 selfloop transitions, 0 changer transitions 8/123 dead transitions. [2025-04-14 00:38:09,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 123 transitions, 1585 flow [2025-04-14 00:38:09,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:38:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:38:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-14 00:38:09,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2025-04-14 00:38:09,952 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 1408 flow. Second operand 4 states and 46 transitions. [2025-04-14 00:38:09,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 123 transitions, 1585 flow [2025-04-14 00:38:09,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 123 transitions, 1554 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-14 00:38:09,966 INFO L231 Difference]: Finished difference. Result has 96 places, 115 transitions, 1235 flow [2025-04-14 00:38:09,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1285, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1235, PETRI_PLACES=96, PETRI_TRANSITIONS=115} [2025-04-14 00:38:09,967 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-04-14 00:38:09,967 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 115 transitions, 1235 flow [2025-04-14 00:38:09,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:09,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:09,968 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:09,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 00:38:09,968 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:09,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:09,968 INFO L85 PathProgramCache]: Analyzing trace with hash -156174590, now seen corresponding path program 1 times [2025-04-14 00:38:09,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:09,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967462357] [2025-04-14 00:38:09,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:38:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:09,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 00:38:09,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 00:38:09,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:09,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 00:38:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:10,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967462357] [2025-04-14 00:38:10,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967462357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:10,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:10,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:38:10,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286561168] [2025-04-14 00:38:10,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:10,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:38:10,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:10,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:38:10,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:38:10,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:10,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 115 transitions, 1235 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:10,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:10,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:10,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:10,598 INFO L116 PetriNetUnfolderBase]: 1562/2254 cut-off events. [2025-04-14 00:38:10,598 INFO L117 PetriNetUnfolderBase]: For 9002/9002 co-relation queries the response was YES. [2025-04-14 00:38:10,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11668 conditions, 2254 events. 1562/2254 cut-off events. For 9002/9002 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9093 event pairs, 406 based on Foata normal form. 0/1634 useless extension candidates. Maximal degree in co-relation 11636. Up to 1878 conditions per place. [2025-04-14 00:38:10,607 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 107 selfloop transitions, 19 changer transitions 0/126 dead transitions. [2025-04-14 00:38:10,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 1559 flow [2025-04-14 00:38:10,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:38:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:38:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-14 00:38:10,608 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47474747474747475 [2025-04-14 00:38:10,608 INFO L175 Difference]: Start difference. First operand has 96 places, 115 transitions, 1235 flow. Second operand 3 states and 47 transitions. [2025-04-14 00:38:10,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 1559 flow [2025-04-14 00:38:10,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 1503 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-14 00:38:10,624 INFO L231 Difference]: Finished difference. Result has 88 places, 113 transitions, 1234 flow [2025-04-14 00:38:10,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=88, PETRI_TRANSITIONS=113} [2025-04-14 00:38:10,625 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2025-04-14 00:38:10,625 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 1234 flow [2025-04-14 00:38:10,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:10,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:10,625 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:10,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 00:38:10,626 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:10,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash 279339810, now seen corresponding path program 1 times [2025-04-14 00:38:10,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:10,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759223293] [2025-04-14 00:38:10,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:38:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:10,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 00:38:10,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 00:38:10,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:10,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-04-14 00:38:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:10,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759223293] [2025-04-14 00:38:10,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759223293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:38:10,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:38:10,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:38:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694621764] [2025-04-14 00:38:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:38:10,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:38:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:10,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:38:10,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:38:10,761 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:10,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:38:10,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:10,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:10,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:11,290 INFO L116 PetriNetUnfolderBase]: 1687/2454 cut-off events. [2025-04-14 00:38:11,290 INFO L117 PetriNetUnfolderBase]: For 9488/9488 co-relation queries the response was YES. [2025-04-14 00:38:11,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12493 conditions, 2454 events. 1687/2454 cut-off events. For 9488/9488 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10161 event pairs, 485 based on Foata normal form. 32/1837 useless extension candidates. Maximal degree in co-relation 12462. Up to 2067 conditions per place. [2025-04-14 00:38:11,304 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 119 selfloop transitions, 13 changer transitions 0/132 dead transitions. [2025-04-14 00:38:11,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 132 transitions, 1665 flow [2025-04-14 00:38:11,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:38:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:38:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-14 00:38:11,305 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2025-04-14 00:38:11,305 INFO L175 Difference]: Start difference. First operand has 88 places, 113 transitions, 1234 flow. Second operand 3 states and 46 transitions. [2025-04-14 00:38:11,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 132 transitions, 1665 flow [2025-04-14 00:38:11,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 132 transitions, 1629 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-14 00:38:11,315 INFO L231 Difference]: Finished difference. Result has 90 places, 114 transitions, 1260 flow [2025-04-14 00:38:11,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=90, PETRI_TRANSITIONS=114} [2025-04-14 00:38:11,316 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2025-04-14 00:38:11,316 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 114 transitions, 1260 flow [2025-04-14 00:38:11,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:38:11,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:11,316 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:11,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 00:38:11,316 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:11,317 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash 32691842, now seen corresponding path program 1 times [2025-04-14 00:38:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:11,317 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525743171] [2025-04-14 00:38:11,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:38:11,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:11,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:38:11,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:38:11,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:11,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:38:22,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:38:22,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525743171] [2025-04-14 00:38:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525743171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:38:22,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259830961] [2025-04-14 00:38:22,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:38:22,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:38:22,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:38:22,504 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:22,506 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:22,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-14 00:38:22,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:38:22,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:38:22,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:38:22,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-14 00:38:22,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:38:24,633 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:38:24,634 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 320 treesize of output 328 [2025-04-14 00:38:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:38:25,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:38:30,217 INFO L325 Elim1Store]: treesize reduction 13, result has 98.3 percent of original size [2025-04-14 00:38:30,217 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 432 treesize of output 1061 [2025-04-14 00:38:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:38:48,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259830961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:38:48,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:38:48,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 10, 10] total 47 [2025-04-14 00:38:48,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476745902] [2025-04-14 00:38:48,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:38:48,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-14 00:38:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:38:48,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-14 00:38:48,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2088, Unknown=0, NotChecked=0, Total=2256 [2025-04-14 00:38:48,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:38:48,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 114 transitions, 1260 flow. Second operand has 48 states, 48 states have (on average 4.708333333333333) internal successors, (226), 48 states have internal predecessors, (226), 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:48,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:38:48,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:38:48,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:38:56,072 INFO L116 PetriNetUnfolderBase]: 4242/6137 cut-off events. [2025-04-14 00:38:56,072 INFO L117 PetriNetUnfolderBase]: For 22344/22344 co-relation queries the response was YES. [2025-04-14 00:38:56,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30719 conditions, 6137 events. 4242/6137 cut-off events. For 22344/22344 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 31066 event pairs, 248 based on Foata normal form. 5/4297 useless extension candidates. Maximal degree in co-relation 30687. Up to 2311 conditions per place. [2025-04-14 00:38:56,098 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 429 selfloop transitions, 148 changer transitions 3/580 dead transitions. [2025-04-14 00:38:56,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 580 transitions, 6450 flow [2025-04-14 00:38:56,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-14 00:38:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-14 00:38:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 385 transitions. [2025-04-14 00:38:56,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2845528455284553 [2025-04-14 00:38:56,100 INFO L175 Difference]: Start difference. First operand has 90 places, 114 transitions, 1260 flow. Second operand 41 states and 385 transitions. [2025-04-14 00:38:56,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 580 transitions, 6450 flow [2025-04-14 00:38:56,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 580 transitions, 6308 flow, removed 26 selfloop flow, removed 1 redundant places. [2025-04-14 00:38:56,127 INFO L231 Difference]: Finished difference. Result has 145 places, 221 transitions, 2851 flow [2025-04-14 00:38:56,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2851, PETRI_PLACES=145, PETRI_TRANSITIONS=221} [2025-04-14 00:38:56,128 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2025-04-14 00:38:56,128 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 221 transitions, 2851 flow [2025-04-14 00:38:56,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.708333333333333) internal successors, (226), 48 states have internal predecessors, (226), 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,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:38:56,128 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:38:56,136 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:56,328 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,SelfDestructingSolverStorable33 [2025-04-14 00:38:56,328 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:38:56,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:38:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash -256426900, now seen corresponding path program 2 times [2025-04-14 00:38:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:38:56,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179976111] [2025-04-14 00:38:56,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:38:56,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:38:56,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:38:56,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:38:56,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:38:56,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:39:04,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:04,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179976111] [2025-04-14 00:39:04,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179976111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:04,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682317321] [2025-04-14 00:39:04,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:39:04,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:04,837 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:39:04,839 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:39:05,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:39:05,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:39:05,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:39:05,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:05,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-04-14 00:39:05,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:06,976 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:06,976 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 285 treesize of output 273 [2025-04-14 00:39:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:07,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:11,310 INFO L325 Elim1Store]: treesize reduction 13, result has 98.3 percent of original size [2025-04-14 00:39:11,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 427 treesize of output 1088 [2025-04-14 00:39:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682317321] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:18,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 10] total 51 [2025-04-14 00:39:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051347610] [2025-04-14 00:39:18,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:18,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-14 00:39:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:18,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-14 00:39:18,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2463, Unknown=0, NotChecked=0, Total=2652 [2025-04-14 00:39:18,134 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:18,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 221 transitions, 2851 flow. Second operand has 52 states, 52 states have (on average 4.730769230769231) internal successors, (246), 52 states have internal predecessors, (246), 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:18,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:18,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:18,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:25,901 INFO L116 PetriNetUnfolderBase]: 4599/6665 cut-off events. [2025-04-14 00:39:25,901 INFO L117 PetriNetUnfolderBase]: For 44720/44720 co-relation queries the response was YES. [2025-04-14 00:39:25,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39875 conditions, 6665 events. 4599/6665 cut-off events. For 44720/44720 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 34269 event pairs, 428 based on Foata normal form. 3/5462 useless extension candidates. Maximal degree in co-relation 39827. Up to 2539 conditions per place. [2025-04-14 00:39:25,944 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 313 selfloop transitions, 224 changer transitions 5/542 dead transitions. [2025-04-14 00:39:25,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 542 transitions, 7206 flow [2025-04-14 00:39:25,945 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 00:39:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 00:39:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 316 transitions. [2025-04-14 00:39:25,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25199362041467305 [2025-04-14 00:39:25,946 INFO L175 Difference]: Start difference. First operand has 145 places, 221 transitions, 2851 flow. Second operand 38 states and 316 transitions. [2025-04-14 00:39:25,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 542 transitions, 7206 flow [2025-04-14 00:39:26,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 542 transitions, 6793 flow, removed 169 selfloop flow, removed 8 redundant places. [2025-04-14 00:39:26,081 INFO L231 Difference]: Finished difference. Result has 186 places, 361 transitions, 5105 flow [2025-04-14 00:39:26,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2582, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=5105, PETRI_PLACES=186, PETRI_TRANSITIONS=361} [2025-04-14 00:39:26,081 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2025-04-14 00:39:26,082 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 361 transitions, 5105 flow [2025-04-14 00:39:26,082 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.730769230769231) internal successors, (246), 52 states have internal predecessors, (246), 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,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:39:26,082 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:39:26,090 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:39:26,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:26,282 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:39:26,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:39:26,283 INFO L85 PathProgramCache]: Analyzing trace with hash -744988488, now seen corresponding path program 3 times [2025-04-14 00:39:26,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:39:26,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21087498] [2025-04-14 00:39:26,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:26,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:39:26,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:39:26,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:39:26,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:39:26,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:30,757 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:30,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:39:30,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21087498] [2025-04-14 00:39:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21087498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:39:30,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400916939] [2025-04-14 00:39:30,758 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:39:30,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:39:30,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:39:30,759 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:39:30,760 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:39:30,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:39:31,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 38 statements. [2025-04-14 00:39:31,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 00:39:31,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:39:31,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-14 00:39:31,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:39:32,913 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:39:32,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 380 treesize of output 380 [2025-04-14 00:39:33,515 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:33,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:39:38,481 INFO L325 Elim1Store]: treesize reduction 13, result has 98.6 percent of original size [2025-04-14 00:39:38,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 542 treesize of output 1285 [2025-04-14 00:39:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:39:53,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400916939] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:39:53,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:39:53,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 36 [2025-04-14 00:39:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217282551] [2025-04-14 00:39:53,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:39:53,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 00:39:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:39:53,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 00:39:53,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 00:39:53,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:39:53,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 361 transitions, 5105 flow. Second operand has 37 states, 37 states have (on average 5.108108108108108) internal successors, (189), 37 states have internal predecessors, (189), 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:53,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:39:53,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:39:53,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:39:59,962 INFO L116 PetriNetUnfolderBase]: 4930/7138 cut-off events. [2025-04-14 00:39:59,963 INFO L117 PetriNetUnfolderBase]: For 65902/65902 co-relation queries the response was YES. [2025-04-14 00:39:59,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46697 conditions, 7138 events. 4930/7138 cut-off events. For 65902/65902 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 37132 event pairs, 341 based on Foata normal form. 4/6577 useless extension candidates. Maximal degree in co-relation 46640. Up to 2745 conditions per place. [2025-04-14 00:40:00,014 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 445 selfloop transitions, 254 changer transitions 2/701 dead transitions. [2025-04-14 00:40:00,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 701 transitions, 9872 flow [2025-04-14 00:40:00,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-14 00:40:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-14 00:40:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 350 transitions. [2025-04-14 00:40:00,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3213957759412305 [2025-04-14 00:40:00,016 INFO L175 Difference]: Start difference. First operand has 186 places, 361 transitions, 5105 flow. Second operand 33 states and 350 transitions. [2025-04-14 00:40:00,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 701 transitions, 9872 flow [2025-04-14 00:40:00,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 701 transitions, 9323 flow, removed 243 selfloop flow, removed 15 redundant places. [2025-04-14 00:40:00,341 INFO L231 Difference]: Finished difference. Result has 220 places, 480 transitions, 6857 flow [2025-04-14 00:40:00,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4639, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=6857, PETRI_PLACES=220, PETRI_TRANSITIONS=480} [2025-04-14 00:40:00,341 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 190 predicate places. [2025-04-14 00:40:00,341 INFO L485 AbstractCegarLoop]: Abstraction has has 220 places, 480 transitions, 6857 flow [2025-04-14 00:40:00,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.108108108108108) internal successors, (189), 37 states have internal predecessors, (189), 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:40:00,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:00,342 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:40:00,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 00:40:00,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:00,542 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:40:00,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -744393842, now seen corresponding path program 4 times [2025-04-14 00:40:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:00,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337153953] [2025-04-14 00:40:00,543 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:40:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:00,560 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:40:00,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:40:00,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:40:00,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:40:07,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:07,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337153953] [2025-04-14 00:40:07,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337153953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:40:07,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773135722] [2025-04-14 00:40:07,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:40:07,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:07,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:40:07,468 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:40:07,470 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:40:07,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 00:40:07,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:40:07,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:40:07,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:07,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-14 00:40:07,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:40:09,030 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:40:09,030 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 377 treesize of output 417 [2025-04-14 00:40:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:40:10,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:40:19,072 INFO L325 Elim1Store]: treesize reduction 13, result has 98.3 percent of original size [2025-04-14 00:40:19,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 416 treesize of output 1053 [2025-04-14 00:40:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:40:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773135722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:40:30,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:40:30,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 10, 10] total 47 [2025-04-14 00:40:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665886453] [2025-04-14 00:40:30,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:40:30,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-14 00:40:30,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:40:30,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-14 00:40:30,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2079, Unknown=1, NotChecked=0, Total=2256 [2025-04-14 00:40:30,196 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:40:30,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 480 transitions, 6857 flow. Second operand has 48 states, 48 states have (on average 4.604166666666667) internal successors, (221), 48 states have internal predecessors, (221), 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:40:30,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:40:30,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:40:30,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:40:36,150 INFO L116 PetriNetUnfolderBase]: 4964/7201 cut-off events. [2025-04-14 00:40:36,150 INFO L117 PetriNetUnfolderBase]: For 79144/79144 co-relation queries the response was YES. [2025-04-14 00:40:36,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51228 conditions, 7201 events. 4964/7201 cut-off events. For 79144/79144 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 37709 event pairs, 539 based on Foata normal form. 1/6771 useless extension candidates. Maximal degree in co-relation 51154. Up to 2751 conditions per place. [2025-04-14 00:40:36,215 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 435 selfloop transitions, 233 changer transitions 1/669 dead transitions. [2025-04-14 00:40:36,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 669 transitions, 10168 flow [2025-04-14 00:40:36,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 00:40:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-14 00:40:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 286 transitions. [2025-04-14 00:40:36,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24761904761904763 [2025-04-14 00:40:36,217 INFO L175 Difference]: Start difference. First operand has 220 places, 480 transitions, 6857 flow. Second operand 35 states and 286 transitions. [2025-04-14 00:40:36,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 669 transitions, 10168 flow [2025-04-14 00:40:36,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 669 transitions, 9649 flow, removed 252 selfloop flow, removed 4 redundant places. [2025-04-14 00:40:36,804 INFO L231 Difference]: Finished difference. Result has 257 places, 513 transitions, 7368 flow [2025-04-14 00:40:36,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6387, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=7368, PETRI_PLACES=257, PETRI_TRANSITIONS=513} [2025-04-14 00:40:36,805 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 227 predicate places. [2025-04-14 00:40:36,805 INFO L485 AbstractCegarLoop]: Abstraction has has 257 places, 513 transitions, 7368 flow [2025-04-14 00:40:36,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.604166666666667) internal successors, (221), 48 states have internal predecessors, (221), 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:40:36,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:40:36,805 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:40:36,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 00:40:37,005 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,SelfDestructingSolverStorable36 [2025-04-14 00:40:37,006 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:40:37,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:40:37,006 INFO L85 PathProgramCache]: Analyzing trace with hash 389126706, now seen corresponding path program 5 times [2025-04-14 00:40:37,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:40:37,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420060395] [2025-04-14 00:40:37,007 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:40:37,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:40:37,026 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:40:37,277 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:40:37,277 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:40:37,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-14 00:40:40,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:40:40,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420060395] [2025-04-14 00:40:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420060395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:40:40,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134194323] [2025-04-14 00:40:40,835 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:40:40,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:40:40,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:40:40,837 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:40:40,840 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:40:41,073 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 4 equivalence classes. [2025-04-14 00:40:41,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 00:40:41,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 00:40:41,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:40:41,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-04-14 00:40:41,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:40:41,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-04-14 00:40:41,484 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 58 treesize of output 42 [2025-04-14 00:40:41,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:40:41,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2025-04-14 00:40:41,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:40:41,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:40:41,507 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 25 treesize of output 25 [2025-04-14 00:40:41,589 INFO L325 Elim1Store]: treesize reduction 76, result has 28.3 percent of original size [2025-04-14 00:40:41,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 69 [2025-04-14 00:40:41,693 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 106 treesize of output 82 [2025-04-14 00:40:41,725 INFO L325 Elim1Store]: treesize reduction 115, result has 17.3 percent of original size [2025-04-14 00:40:41,725 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 82 treesize of output 105 [2025-04-14 00:40:41,816 INFO L325 Elim1Store]: treesize reduction 72, result has 39.0 percent of original size [2025-04-14 00:40:41,816 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 65 treesize of output 95 [2025-04-14 00:40:42,385 INFO L325 Elim1Store]: treesize reduction 212, result has 60.2 percent of original size [2025-04-14 00:40:42,386 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 189 treesize of output 429 [2025-04-14 00:45:37,633 WARN L286 SmtUtils]: Spent 39.70s on a formula simplification. DAG size of input: 8758 DAG size of output: 8760 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:46:14,639 WARN L286 SmtUtils]: Spent 26.89s on a formula simplification. DAG size of input: 8744 DAG size of output: 7448 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:46:36,487 WARN L286 SmtUtils]: Spent 21.79s on a formula simplification. DAG size of input: 7451 DAG size of output: 7509 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:47:34,320 WARN L286 SmtUtils]: Spent 31.70s on a formula simplification. DAG size of input: 7450 DAG size of output: 7514 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:48:34,718 WARN L286 SmtUtils]: Spent 39.96s on a formula simplification. DAG size of input: 7392 DAG size of output: 7397 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:49:06,421 WARN L286 SmtUtils]: Spent 21.61s on a formula simplification. DAG size of input: 7503 DAG size of output: 7511 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 00:50:13,248 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 3381 DAG size of output: 3383 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-14 00:51:21,978 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:51:21,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 00:51:22,008 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:51:22,010 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:22,178 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,SelfDestructingSolverStorable37 [2025-04-14 00:51:22,179 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-28-5-2-6-2-1 context. [2025-04-14 00:51:22,180 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:51:22,180 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:51:22,180 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 00:51:22,181 INFO L422 BasicCegarLoop]: Path program histogram: [8, 6, 5, 5, 5, 3, 2, 1, 1, 1, 1] [2025-04-14 00:51:22,183 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:51:22,183 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:51:22,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:51:22 BasicIcfg [2025-04-14 00:51:22,185 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:51:22,186 INFO L158 Benchmark]: Toolchain (without parser) took 829672.27ms. Allocated memory was 142.6MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 99.3MB in the beginning and 675.7MB in the end (delta: -576.5MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 00:51:22,186 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:22,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.67ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 81.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:51:22,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 76.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:51:22,186 INFO L158 Benchmark]: Boogie Preprocessor took 79.35ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 72.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:51:22,187 INFO L158 Benchmark]: IcfgBuilder took 1608.92ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 72.4MB in the beginning and 287.1MB in the end (delta: -214.7MB). Peak memory consumption was 65.9MB. Max. memory is 8.0GB. [2025-04-14 00:51:22,187 INFO L158 Benchmark]: TraceAbstraction took 827594.26ms. Allocated memory was 343.9MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 285.8MB in the beginning and 675.7MB in the end (delta: -389.9MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. [2025-04-14 00:51:22,187 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.16ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 338.67ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 81.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 76.6MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.35ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 72.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1608.92ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 72.4MB in the beginning and 287.1MB in the end (delta: -214.7MB). Peak memory consumption was 65.9MB. Max. memory is 8.0GB. * TraceAbstraction took 827594.26ms. Allocated memory was 343.9MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 285.8MB in the beginning and 675.7MB in the end (delta: -389.9MB). Peak memory consumption was 1.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 164]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-28-5-2-6-2-1 context. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-28-5-2-6-2-1 context. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-28-5-2-6-2-1 context. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 39 with TraceHistMax 5,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-28-5-2-6-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 37 locations, 51 edges, 4 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: 827.4s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 52.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1860 SdHoareTripleChecker+Valid, 14.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1860 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15703 IncrementalHoareTripleChecker+Invalid, 15955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 0 mSDtfsCounter, 15703 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 492 SyntacticMatches, 5 SemanticMatches, 427 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5944 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7368occurred in iteration=37, InterpolantAutomatonStates: 300, 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.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 123.2s InterpolantComputationTime, 1496 NumberOfCodeBlocks, 1267 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 1646 ConstructedInterpolants, 28 QuantifiedInterpolants, 26229 SizeOfPredicates, 262 NumberOfNonLiveVariables, 3164 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 51 InterpolantComputations, 31 PerfectInterpolantSequences, 1914/2108 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