/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/popl20-more-nonblocking-counter-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:18:51,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:18:51,827 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 01:18:51,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:18:51,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:18:51,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:18:51,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:18:51,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:18:51,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:18:51,851 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:18:51,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:18:51,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:18:51,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:18:51,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:18:51,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:18:51,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:18:51,854 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:51,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:51,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:18:51,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:18:51,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:18:51,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:18:51,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:18:51,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:18:51,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:18:51,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:18:51,855 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 01:18:52,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:18:52,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:18:52,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:18:52,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:18:52,103 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:18:52,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-14 01:18:53,425 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875212a7d/a67994fdad524722a6e7e06bdc12ae18/FLAG3115eee22 [2025-04-14 01:18:53,630 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:18:53,631 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-14 01:18:53,636 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875212a7d/a67994fdad524722a6e7e06bdc12ae18/FLAG3115eee22 [2025-04-14 01:18:54,426 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875212a7d/a67994fdad524722a6e7e06bdc12ae18 [2025-04-14 01:18:54,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:18:54,430 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:18:54,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:54,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:18:54,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:18:54,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568e0a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54, skipping insertion in model container [2025-04-14 01:18:54,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:18:54,624 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/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-04-14 01:18:54,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:54,638 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:18:54,660 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/popl20-more-nonblocking-counter-alt2.wvr.c[2173,2186] [2025-04-14 01:18:54,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:54,670 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:18:54,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54 WrapperNode [2025-04-14 01:18:54,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:54,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:54,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:18:54,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:18:54,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,697 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-04-14 01:18:54,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:54,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:18:54,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:18:54,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:18:54,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 01:18:54,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:18:54,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:18:54,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:18:54,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:18:54,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (1/1) ... [2025-04-14 01:18:54,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:54,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:54,754 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 01:18:54,756 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 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:18:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:18:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:18:54,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:18:54,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:18:54,772 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 01:18:54,827 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:18:54,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:18:54,929 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:18:54,929 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:18:54,929 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:18:55,029 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:18:55,039 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:18:55,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:55 BoogieIcfgContainer [2025-04-14 01:18:55,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:18:55,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:18:55,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:18:55,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:18:55,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:18:54" (1/3) ... [2025-04-14 01:18:55,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ba51b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:55, skipping insertion in model container [2025-04-14 01:18:55,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:54" (2/3) ... [2025-04-14 01:18:55,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ba51b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:55, skipping insertion in model container [2025-04-14 01:18:55,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:55" (3/3) ... [2025-04-14 01:18:55,051 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-nonblocking-counter-alt2.wvr.c [2025-04-14 01:18:55,064 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:18:55,065 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-nonblocking-counter-alt2.wvr.c that has 3 procedures, 18 locations, 18 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 01:18:55,065 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:18:55,101 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:18:55,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-04-14 01:18:55,159 INFO L116 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-04-14 01:18:55,162 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:18:55,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-14 01:18:55,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-04-14 01:18:55,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-04-14 01:18:55,175 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:18:55,185 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;@6177e346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:18:55,185 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:18:55,195 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:18:55,196 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-14 01:18:55,196 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:18:55,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:55,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:55,197 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:55,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash 101120555, now seen corresponding path program 1 times [2025-04-14 01:18:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:55,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072369569] [2025-04-14 01:18:55,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:55,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:55,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:18:55,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:18:55,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:55,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:55,352 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 01:18:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:55,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072369569] [2025-04-14 01:18:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072369569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:18:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402602405] [2025-04-14 01:18:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:55,359 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:55,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:55,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:55,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:55,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:18:55,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:55,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:55,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:18:55,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:55,428 INFO L116 PetriNetUnfolderBase]: 61/108 cut-off events. [2025-04-14 01:18:55,428 INFO L117 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-04-14 01:18:55,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 108 events. 61/108 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 240 event pairs, 42 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 200. Up to 108 conditions per place. [2025-04-14 01:18:55,434 INFO L140 encePairwiseOnDemand]: 18/20 looper letters, 15 selfloop transitions, 1 changer transitions 0/16 dead transitions. [2025-04-14 01:18:55,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 16 transitions, 76 flow [2025-04-14 01:18:55,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2025-04-14 01:18:55,444 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-04-14 01:18:55,445 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2025-04-14 01:18:55,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 16 transitions, 76 flow [2025-04-14 01:18:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 16 transitions, 68 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:55,450 INFO L231 Difference]: Finished difference. Result has 19 places, 16 transitions, 38 flow [2025-04-14 01:18:55,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=19, PETRI_TRANSITIONS=16} [2025-04-14 01:18:55,455 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -2 predicate places. [2025-04-14 01:18:55,456 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 16 transitions, 38 flow [2025-04-14 01:18:55,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:55,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:55,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:55,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:18:55,456 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:55,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 921422516, now seen corresponding path program 1 times [2025-04-14 01:18:55,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:55,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389296707] [2025-04-14 01:18:55,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:55,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:18:55,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:18:55,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:55,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:55,616 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 01:18:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:55,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389296707] [2025-04-14 01:18:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389296707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:18:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864096829] [2025-04-14 01:18:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:55,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:18:55,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:55,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:18:55,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:18:55,623 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:18:55,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 16 transitions, 38 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:55,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:55,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:18:55,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:55,688 INFO L116 PetriNetUnfolderBase]: 87/152 cut-off events. [2025-04-14 01:18:55,688 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 01:18:55,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 152 events. 87/152 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 368 event pairs, 42 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 307. Up to 108 conditions per place. [2025-04-14 01:18:55,689 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2025-04-14 01:18:55,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 24 transitions, 103 flow [2025-04-14 01:18:55,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:18:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:18:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-14 01:18:55,693 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4125 [2025-04-14 01:18:55,693 INFO L175 Difference]: Start difference. First operand has 19 places, 16 transitions, 38 flow. Second operand 4 states and 33 transitions. [2025-04-14 01:18:55,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 24 transitions, 103 flow [2025-04-14 01:18:55,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:55,695 INFO L231 Difference]: Finished difference. Result has 22 places, 17 transitions, 51 flow [2025-04-14 01:18:55,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=37, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=51, PETRI_PLACES=22, PETRI_TRANSITIONS=17} [2025-04-14 01:18:55,695 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2025-04-14 01:18:55,695 INFO L485 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 51 flow [2025-04-14 01:18:55,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:55,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:55,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:55,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:18:55,696 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:55,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 689454678, now seen corresponding path program 1 times [2025-04-14 01:18:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:55,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688335949] [2025-04-14 01:18:55,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:55,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:18:55,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:55,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:56,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688335949] [2025-04-14 01:18:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688335949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:56,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060556733] [2025-04-14 01:18:56,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:56,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:56,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:56,002 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 01:18:56,004 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 01:18:56,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:18:56,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:56,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:56,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:56,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:18:56,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:56,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:56,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060556733] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:56,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:18:56,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 3] total 9 [2025-04-14 01:18:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741553580] [2025-04-14 01:18:56,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:56,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:18:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:56,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:18:56,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:56,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-04-14 01:18:56,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 51 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 01:18:56,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:56,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-04-14 01:18:56,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:56,447 INFO L116 PetriNetUnfolderBase]: 135/252 cut-off events. [2025-04-14 01:18:56,447 INFO L117 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2025-04-14 01:18:56,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 252 events. 135/252 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 918 event pairs, 19 based on Foata normal form. 1/229 useless extension candidates. Maximal degree in co-relation 598. Up to 93 conditions per place. [2025-04-14 01:18:56,449 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 33 selfloop transitions, 5 changer transitions 3/42 dead transitions. [2025-04-14 01:18:56,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 42 transitions, 209 flow [2025-04-14 01:18:56,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:18:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:18:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-14 01:18:56,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-04-14 01:18:56,450 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 51 flow. Second operand 4 states and 51 transitions. [2025-04-14 01:18:56,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 42 transitions, 209 flow [2025-04-14 01:18:56,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:56,452 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 85 flow [2025-04-14 01:18:56,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-14 01:18:56,452 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2025-04-14 01:18:56,452 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 85 flow [2025-04-14 01:18:56,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 01:18:56,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:56,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:56,461 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 01:18:56,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:56,657 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:56,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash -957290778, now seen corresponding path program 2 times [2025-04-14 01:18:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:56,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744603270] [2025-04-14 01:18:56,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:56,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:18:56,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:56,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:56,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:56,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744603270] [2025-04-14 01:18:56,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744603270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:56,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241840324] [2025-04-14 01:18:56,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:56,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:56,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:56,855 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 01:18:56,857 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 01:18:56,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:18:56,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:56,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:56,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:56,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:18:56,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:56,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:18:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241840324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:56,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:18:56,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-04-14 01:18:56,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819036087] [2025-04-14 01:18:56,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:56,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:18:56,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:56,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:18:56,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:18:56,967 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:18:56,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 01:18:56,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:56,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:18:56,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:57,047 INFO L116 PetriNetUnfolderBase]: 197/344 cut-off events. [2025-04-14 01:18:57,047 INFO L117 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-04-14 01:18:57,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 344 events. 197/344 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1179 event pairs, 62 based on Foata normal form. 4/314 useless extension candidates. Maximal degree in co-relation 914. Up to 297 conditions per place. [2025-04-14 01:18:57,049 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2025-04-14 01:18:57,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 190 flow [2025-04-14 01:18:57,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:18:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:18:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-14 01:18:57,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 01:18:57,050 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 85 flow. Second operand 4 states and 35 transitions. [2025-04-14 01:18:57,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 190 flow [2025-04-14 01:18:57,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:18:57,052 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 120 flow [2025-04-14 01:18:57,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-14 01:18:57,052 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2025-04-14 01:18:57,052 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 120 flow [2025-04-14 01:18:57,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 01:18:57,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:57,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:57,058 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 01:18:57,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-14 01:18:57,253 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:57,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1098298308, now seen corresponding path program 3 times [2025-04-14 01:18:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:57,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503742001] [2025-04-14 01:18:57,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:57,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:18:57,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:57,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:18:57,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:57,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503742001] [2025-04-14 01:18:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503742001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:57,435 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225684630] [2025-04-14 01:18:57,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:57,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:57,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:57,437 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 01:18:57,439 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 01:18:57,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:18:57,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:57,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:18:57,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:57,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:18:57,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:57,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:18:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225684630] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:57,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:18:57,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-04-14 01:18:57,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363068867] [2025-04-14 01:18:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:57,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:18:57,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:57,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:18:57,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:18:57,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:18:57,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 01:18:57,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:57,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:18:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:57,637 INFO L116 PetriNetUnfolderBase]: 277/480 cut-off events. [2025-04-14 01:18:57,637 INFO L117 PetriNetUnfolderBase]: For 407/407 co-relation queries the response was YES. [2025-04-14 01:18:57,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 480 events. 277/480 cut-off events. For 407/407 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1833 event pairs, 71 based on Foata normal form. 14/444 useless extension candidates. Maximal degree in co-relation 1353. Up to 317 conditions per place. [2025-04-14 01:18:57,642 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 35 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2025-04-14 01:18:57,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 279 flow [2025-04-14 01:18:57,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:18:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:18:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-14 01:18:57,643 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44 [2025-04-14 01:18:57,644 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 120 flow. Second operand 5 states and 44 transitions. [2025-04-14 01:18:57,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 279 flow [2025-04-14 01:18:57,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:18:57,645 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 179 flow [2025-04-14 01:18:57,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2025-04-14 01:18:57,646 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2025-04-14 01:18:57,646 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 179 flow [2025-04-14 01:18:57,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 01:18:57,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:57,646 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:57,654 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 01:18:57,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:57,850 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:57,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:57,851 INFO L85 PathProgramCache]: Analyzing trace with hash 597994627, now seen corresponding path program 1 times [2025-04-14 01:18:57,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:57,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973181610] [2025-04-14 01:18:57,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:57,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:57,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:18:57,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:18:57,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:57,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:57,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973181610] [2025-04-14 01:18:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973181610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:57,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732543778] [2025-04-14 01:18:57,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:57,986 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 01:18:57,988 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 01:18:58,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:18:58,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:18:58,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:58,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:58,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:18:58,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:58,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732543778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:58,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-04-14 01:18:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831084426] [2025-04-14 01:18:58,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:58,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:18:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:58,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:18:58,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:18:58,247 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:18:58,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 179 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 01:18:58,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:58,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:18:58,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:58,665 INFO L116 PetriNetUnfolderBase]: 370/639 cut-off events. [2025-04-14 01:18:58,665 INFO L117 PetriNetUnfolderBase]: For 847/847 co-relation queries the response was YES. [2025-04-14 01:18:58,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 639 events. 370/639 cut-off events. For 847/847 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2683 event pairs, 5 based on Foata normal form. 23/594 useless extension candidates. Maximal degree in co-relation 1927. Up to 135 conditions per place. [2025-04-14 01:18:58,669 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 62 selfloop transitions, 42 changer transitions 18/122 dead transitions. [2025-04-14 01:18:58,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 122 transitions, 848 flow [2025-04-14 01:18:58,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:18:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:18:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2025-04-14 01:18:58,672 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3911764705882353 [2025-04-14 01:18:58,672 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 179 flow. Second operand 17 states and 133 transitions. [2025-04-14 01:18:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 122 transitions, 848 flow [2025-04-14 01:18:58,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 122 transitions, 828 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:18:58,677 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 563 flow [2025-04-14 01:18:58,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=563, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2025-04-14 01:18:58,677 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 38 predicate places. [2025-04-14 01:18:58,678 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 563 flow [2025-04-14 01:18:58,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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 01:18:58,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:58,680 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:58,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:18:58,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:58,880 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:18:58,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:58,881 INFO L85 PathProgramCache]: Analyzing trace with hash -897186373, now seen corresponding path program 2 times [2025-04-14 01:18:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:58,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611550992] [2025-04-14 01:18:58,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:58,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:58,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:18:58,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:18:58,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:59,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:59,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611550992] [2025-04-14 01:18:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611550992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:59,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123148070] [2025-04-14 01:18:59,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:59,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:59,068 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 01:18:59,070 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 01:18:59,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:18:59,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:18:59,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:59,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:59,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:18:59,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:59,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:59,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123148070] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:59,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:59,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-14 01:18:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731042769] [2025-04-14 01:18:59,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:59,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:18:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:59,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:18:59,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:18:59,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:18:59,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 563 flow. Second operand has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 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 01:18:59,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:59,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:18:59,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:03,595 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:19:04,078 INFO L116 PetriNetUnfolderBase]: 640/1103 cut-off events. [2025-04-14 01:19:04,078 INFO L117 PetriNetUnfolderBase]: For 5457/5457 co-relation queries the response was YES. [2025-04-14 01:19:04,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 1103 events. 640/1103 cut-off events. For 5457/5457 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5108 event pairs, 15 based on Foata normal form. 23/1126 useless extension candidates. Maximal degree in co-relation 5114. Up to 252 conditions per place. [2025-04-14 01:19:04,086 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 116 selfloop transitions, 109 changer transitions 4/229 dead transitions. [2025-04-14 01:19:04,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 229 transitions, 2307 flow [2025-04-14 01:19:04,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:19:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:19:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 207 transitions. [2025-04-14 01:19:04,087 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36964285714285716 [2025-04-14 01:19:04,087 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 563 flow. Second operand 28 states and 207 transitions. [2025-04-14 01:19:04,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 229 transitions, 2307 flow [2025-04-14 01:19:04,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 229 transitions, 2199 flow, removed 51 selfloop flow, removed 3 redundant places. [2025-04-14 01:19:04,107 INFO L231 Difference]: Finished difference. Result has 96 places, 148 transitions, 1788 flow [2025-04-14 01:19:04,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1788, PETRI_PLACES=96, PETRI_TRANSITIONS=148} [2025-04-14 01:19:04,109 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 75 predicate places. [2025-04-14 01:19:04,110 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 148 transitions, 1788 flow [2025-04-14 01:19:04,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.625) internal successors, (74), 16 states have internal predecessors, (74), 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 01:19:04,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:04,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:04,116 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 01:19:04,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:04,314 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:04,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash 582085273, now seen corresponding path program 3 times [2025-04-14 01:19:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:04,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245555012] [2025-04-14 01:19:04,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:04,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:04,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:04,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:19:04,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:04,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245555012] [2025-04-14 01:19:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245555012] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:04,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82832502] [2025-04-14 01:19:04,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:04,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:04,423 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 01:19:04,425 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 01:19:04,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:04,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:04,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:19:04,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:04,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:19:04,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:04,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82832502] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:04,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:04,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 01:19:04,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499782074] [2025-04-14 01:19:04,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:04,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:19:04,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:04,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:19:04,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:19:04,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:19:04,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 148 transitions, 1788 flow. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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 01:19:04,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:04,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:19:04,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:04,979 INFO L116 PetriNetUnfolderBase]: 893/1515 cut-off events. [2025-04-14 01:19:04,980 INFO L117 PetriNetUnfolderBase]: For 16182/16182 co-relation queries the response was YES. [2025-04-14 01:19:04,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9326 conditions, 1515 events. 893/1515 cut-off events. For 16182/16182 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7474 event pairs, 83 based on Foata normal form. 10/1525 useless extension candidates. Maximal degree in co-relation 9285. Up to 378 conditions per place. [2025-04-14 01:19:04,991 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 129 selfloop transitions, 135 changer transitions 2/266 dead transitions. [2025-04-14 01:19:04,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 266 transitions, 3688 flow [2025-04-14 01:19:04,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:19:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:19:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 96 transitions. [2025-04-14 01:19:04,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-14 01:19:04,992 INFO L175 Difference]: Start difference. First operand has 96 places, 148 transitions, 1788 flow. Second operand 12 states and 96 transitions. [2025-04-14 01:19:04,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 266 transitions, 3688 flow [2025-04-14 01:19:05,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 266 transitions, 3436 flow, removed 119 selfloop flow, removed 3 redundant places. [2025-04-14 01:19:05,036 INFO L231 Difference]: Finished difference. Result has 113 places, 209 transitions, 2986 flow [2025-04-14 01:19:05,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1622, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2986, PETRI_PLACES=113, PETRI_TRANSITIONS=209} [2025-04-14 01:19:05,037 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2025-04-14 01:19:05,037 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 209 transitions, 2986 flow [2025-04-14 01:19:05,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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 01:19:05,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:05,037 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:05,047 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 01:19:05,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:05,246 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:05,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:05,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2024989997, now seen corresponding path program 4 times [2025-04-14 01:19:05,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:05,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389348532] [2025-04-14 01:19:05,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:05,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:05,260 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:05,260 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:05,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:05,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389348532] [2025-04-14 01:19:05,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389348532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:05,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677874128] [2025-04-14 01:19:05,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:05,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:05,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:05,382 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 01:19:05,384 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 01:19:05,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:05,419 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:05,419 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:05,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:19:05,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:05,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:05,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677874128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:05,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:05,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-14 01:19:05,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305143173] [2025-04-14 01:19:05,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:05,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:19:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:19:05,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:19:05,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:19:05,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 209 transitions, 2986 flow. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 01:19:05,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:05,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:19:05,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:06,117 INFO L116 PetriNetUnfolderBase]: 965/1670 cut-off events. [2025-04-14 01:19:06,118 INFO L117 PetriNetUnfolderBase]: For 26878/26878 co-relation queries the response was YES. [2025-04-14 01:19:06,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11185 conditions, 1670 events. 965/1670 cut-off events. For 26878/26878 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8532 event pairs, 41 based on Foata normal form. 41/1711 useless extension candidates. Maximal degree in co-relation 11138. Up to 369 conditions per place. [2025-04-14 01:19:06,131 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 134 selfloop transitions, 193 changer transitions 3/330 dead transitions. [2025-04-14 01:19:06,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 330 transitions, 4981 flow [2025-04-14 01:19:06,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:19:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:19:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 137 transitions. [2025-04-14 01:19:06,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2025-04-14 01:19:06,132 INFO L175 Difference]: Start difference. First operand has 113 places, 209 transitions, 2986 flow. Second operand 17 states and 137 transitions. [2025-04-14 01:19:06,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 330 transitions, 4981 flow [2025-04-14 01:19:06,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 330 transitions, 4919 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-14 01:19:06,195 INFO L231 Difference]: Finished difference. Result has 137 places, 247 transitions, 4192 flow [2025-04-14 01:19:06,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2871, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4192, PETRI_PLACES=137, PETRI_TRANSITIONS=247} [2025-04-14 01:19:06,195 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 116 predicate places. [2025-04-14 01:19:06,195 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 247 transitions, 4192 flow [2025-04-14 01:19:06,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 01:19:06,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:06,196 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:06,202 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 01:19:06,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:06,396 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:06,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2042888487, now seen corresponding path program 5 times [2025-04-14 01:19:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:06,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480640728] [2025-04-14 01:19:06,397 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:06,400 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:06,406 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:06,406 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:06,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:06,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480640728] [2025-04-14 01:19:06,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480640728] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:06,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:06,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:19:06,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425981747] [2025-04-14 01:19:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:06,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:19:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:06,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:19:06,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:19:06,495 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-04-14 01:19:06,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 247 transitions, 4192 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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 01:19:06,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:06,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-04-14 01:19:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:06,744 INFO L116 PetriNetUnfolderBase]: 834/1512 cut-off events. [2025-04-14 01:19:06,745 INFO L117 PetriNetUnfolderBase]: For 27651/27748 co-relation queries the response was YES. [2025-04-14 01:19:06,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11566 conditions, 1512 events. 834/1512 cut-off events. For 27651/27748 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8052 event pairs, 219 based on Foata normal form. 40/1535 useless extension candidates. Maximal degree in co-relation 11510. Up to 1059 conditions per place. [2025-04-14 01:19:06,759 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 187 selfloop transitions, 57 changer transitions 2/285 dead transitions. [2025-04-14 01:19:06,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 285 transitions, 5199 flow [2025-04-14 01:19:06,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:19:06,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:19:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-04-14 01:19:06,760 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-04-14 01:19:06,760 INFO L175 Difference]: Start difference. First operand has 137 places, 247 transitions, 4192 flow. Second operand 6 states and 51 transitions. [2025-04-14 01:19:06,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 285 transitions, 5199 flow [2025-04-14 01:19:06,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 285 transitions, 4992 flow, removed 75 selfloop flow, removed 3 redundant places. [2025-04-14 01:19:06,833 INFO L231 Difference]: Finished difference. Result has 142 places, 260 transitions, 4419 flow [2025-04-14 01:19:06,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3995, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4419, PETRI_PLACES=142, PETRI_TRANSITIONS=260} [2025-04-14 01:19:06,834 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2025-04-14 01:19:06,834 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 260 transitions, 4419 flow [2025-04-14 01:19:06,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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 01:19:06,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:06,834 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:06,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:19:06,835 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:06,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1151580167, now seen corresponding path program 6 times [2025-04-14 01:19:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:06,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713010828] [2025-04-14 01:19:06,836 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:19:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:06,839 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:06,848 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:06,848 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:19:06,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:06,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713010828] [2025-04-14 01:19:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713010828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:06,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741538569] [2025-04-14 01:19:06,961 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:19:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:06,963 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 01:19:06,965 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 01:19:06,988 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:19:06,997 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:06,997 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:19:06,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:06,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:19:06,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:07,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741538569] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:07,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-14 01:19:07,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509247141] [2025-04-14 01:19:07,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:07,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:19:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:07,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:19:07,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:19:07,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:19:07,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 260 transitions, 4419 flow. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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 01:19:07,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:07,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:19:07,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:07,744 INFO L116 PetriNetUnfolderBase]: 1316/2287 cut-off events. [2025-04-14 01:19:07,745 INFO L117 PetriNetUnfolderBase]: For 40844/40844 co-relation queries the response was YES. [2025-04-14 01:19:07,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16922 conditions, 2287 events. 1316/2287 cut-off events. For 40844/40844 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12399 event pairs, 57 based on Foata normal form. 32/2319 useless extension candidates. Maximal degree in co-relation 16862. Up to 858 conditions per place. [2025-04-14 01:19:07,766 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 225 selfloop transitions, 221 changer transitions 1/447 dead transitions. [2025-04-14 01:19:07,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 447 transitions, 7977 flow [2025-04-14 01:19:07,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:19:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:19:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 115 transitions. [2025-04-14 01:19:07,767 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2025-04-14 01:19:07,767 INFO L175 Difference]: Start difference. First operand has 142 places, 260 transitions, 4419 flow. Second operand 15 states and 115 transitions. [2025-04-14 01:19:07,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 447 transitions, 7977 flow [2025-04-14 01:19:07,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 447 transitions, 7909 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 01:19:07,915 INFO L231 Difference]: Finished difference. Result has 162 places, 350 transitions, 6793 flow [2025-04-14 01:19:07,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4366, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6793, PETRI_PLACES=162, PETRI_TRANSITIONS=350} [2025-04-14 01:19:07,916 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 141 predicate places. [2025-04-14 01:19:07,916 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 350 transitions, 6793 flow [2025-04-14 01:19:07,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 16 states have internal predecessors, (76), 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 01:19:07,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:07,916 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:07,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-14 01:19:08,121 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,SelfDestructingSolverStorable10 [2025-04-14 01:19:08,121 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:08,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -311734309, now seen corresponding path program 7 times [2025-04-14 01:19:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:08,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306174175] [2025-04-14 01:19:08,122 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:08,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:19:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:08,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:08,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:08,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:08,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306174175] [2025-04-14 01:19:08,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306174175] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:08,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228486503] [2025-04-14 01:19:08,248 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:08,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:08,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:08,250 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 01:19:08,252 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 01:19:08,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:19:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:19:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:08,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:19:08,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:08,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:08,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228486503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:08,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:08,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-14 01:19:08,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083985973] [2025-04-14 01:19:08,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:08,491 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:19:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:08,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:19:08,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:19:08,499 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:19:08,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 350 transitions, 6793 flow. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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 01:19:08,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:08,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:19:08,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:09,396 INFO L116 PetriNetUnfolderBase]: 1819/3146 cut-off events. [2025-04-14 01:19:09,396 INFO L117 PetriNetUnfolderBase]: For 72019/72019 co-relation queries the response was YES. [2025-04-14 01:19:09,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26226 conditions, 3146 events. 1819/3146 cut-off events. For 72019/72019 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 18298 event pairs, 233 based on Foata normal form. 32/3178 useless extension candidates. Maximal degree in co-relation 26156. Up to 1115 conditions per place. [2025-04-14 01:19:09,427 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 292 selfloop transitions, 309 changer transitions 5/606 dead transitions. [2025-04-14 01:19:09,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 606 transitions, 12177 flow [2025-04-14 01:19:09,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 01:19:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 01:19:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2025-04-14 01:19:09,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2025-04-14 01:19:09,429 INFO L175 Difference]: Start difference. First operand has 162 places, 350 transitions, 6793 flow. Second operand 18 states and 151 transitions. [2025-04-14 01:19:09,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 606 transitions, 12177 flow [2025-04-14 01:19:09,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 606 transitions, 11872 flow, removed 139 selfloop flow, removed 4 redundant places. [2025-04-14 01:19:09,700 INFO L231 Difference]: Finished difference. Result has 185 places, 462 transitions, 10179 flow [2025-04-14 01:19:09,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=6616, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10179, PETRI_PLACES=185, PETRI_TRANSITIONS=462} [2025-04-14 01:19:09,701 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 164 predicate places. [2025-04-14 01:19:09,701 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 462 transitions, 10179 flow [2025-04-14 01:19:09,701 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 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 01:19:09,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:09,701 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:09,707 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 01:19:09,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:09,902 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:09,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash 805050487, now seen corresponding path program 8 times [2025-04-14 01:19:09,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:09,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481494996] [2025-04-14 01:19:09,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:09,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:19:09,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:19:09,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:09,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:10,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481494996] [2025-04-14 01:19:10,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481494996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:10,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580137452] [2025-04-14 01:19:10,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:10,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:10,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:10,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:19:10,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:19:10,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:19:10,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:10,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:10,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:19:10,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:10,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:10,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:36,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580137452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:36,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:36,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 17 [2025-04-14 01:19:36,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004954962] [2025-04-14 01:19:36,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:36,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:19:36,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:36,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:19:36,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=253, Unknown=7, NotChecked=0, Total=342 [2025-04-14 01:19:36,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:19:36,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 462 transitions, 10179 flow. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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 01:19:36,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:36,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:19:36,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:46,342 INFO L116 PetriNetUnfolderBase]: 2732/4721 cut-off events. [2025-04-14 01:19:46,342 INFO L117 PetriNetUnfolderBase]: For 136891/136891 co-relation queries the response was YES. [2025-04-14 01:19:46,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44614 conditions, 4721 events. 2732/4721 cut-off events. For 136891/136891 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29808 event pairs, 40 based on Foata normal form. 2/4723 useless extension candidates. Maximal degree in co-relation 44536. Up to 1524 conditions per place. [2025-04-14 01:19:46,384 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 334 selfloop transitions, 493 changer transitions 131/958 dead transitions. [2025-04-14 01:19:46,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 958 transitions, 22077 flow [2025-04-14 01:19:46,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 01:19:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 01:19:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 202 transitions. [2025-04-14 01:19:46,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2025-04-14 01:19:46,385 INFO L175 Difference]: Start difference. First operand has 185 places, 462 transitions, 10179 flow. Second operand 24 states and 202 transitions. [2025-04-14 01:19:46,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 958 transitions, 22077 flow [2025-04-14 01:19:47,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 958 transitions, 21238 flow, removed 362 selfloop flow, removed 3 redundant places. [2025-04-14 01:19:47,024 INFO L231 Difference]: Finished difference. Result has 221 places, 698 transitions, 16842 flow [2025-04-14 01:19:47,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=9828, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=16842, PETRI_PLACES=221, PETRI_TRANSITIONS=698} [2025-04-14 01:19:47,025 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 200 predicate places. [2025-04-14 01:19:47,025 INFO L485 AbstractCegarLoop]: Abstraction has has 221 places, 698 transitions, 16842 flow [2025-04-14 01:19:47,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 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 01:19:47,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:47,025 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:47,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:19:47,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:19:47,229 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:19:47,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1094325573, now seen corresponding path program 9 times [2025-04-14 01:19:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:47,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781195639] [2025-04-14 01:19:47,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:47,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:19:47,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:19:47,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:19:47,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:47,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781195639] [2025-04-14 01:19:47,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781195639] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:47,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898331692] [2025-04-14 01:19:47,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:47,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:47,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:47,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:47,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:19:47,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:19:47,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:19:47,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:19:47,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:47,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:19:47,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:47,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898331692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:48,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:48,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 6] total 18 [2025-04-14 01:19:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193315517] [2025-04-14 01:19:48,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:48,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:19:48,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:48,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:19:48,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:19:48,518 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:19:48,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 698 transitions, 16842 flow. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 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 01:19:48,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:48,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:19:48,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:01,802 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:05,898 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:09,901 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:13,912 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:17,917 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:19,049 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:23,126 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:25,189 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:26,971 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:28,038 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:47,057 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:20:59,559 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:01,600 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:05,773 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:09,795 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:13,799 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:16,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:20,449 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:23,037 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:27,168 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:31,830 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:34,095 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:36,894 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:37,919 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:42,038 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:46,052 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:50,162 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:54,167 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:21:58,384 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:02,389 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:06,522 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:08,576 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:09,962 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:12,247 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:13,744 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:17,749 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:21,759 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:25,775 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:29,789 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:33,798 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:35,138 INFO L116 PetriNetUnfolderBase]: 2710/4726 cut-off events. [2025-04-14 01:22:35,138 INFO L117 PetriNetUnfolderBase]: For 172764/172764 co-relation queries the response was YES. [2025-04-14 01:22:35,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48930 conditions, 4726 events. 2710/4726 cut-off events. For 172764/172764 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30082 event pairs, 72 based on Foata normal form. 13/4739 useless extension candidates. Maximal degree in co-relation 48834. Up to 2661 conditions per place. [2025-04-14 01:22:35,184 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 397 selfloop transitions, 468 changer transitions 29/894 dead transitions. [2025-04-14 01:22:35,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 894 transitions, 22146 flow [2025-04-14 01:22:35,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 01:22:35,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 01:22:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 202 transitions. [2025-04-14 01:22:35,186 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38846153846153847 [2025-04-14 01:22:35,186 INFO L175 Difference]: Start difference. First operand has 221 places, 698 transitions, 16842 flow. Second operand 26 states and 202 transitions. [2025-04-14 01:22:35,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 894 transitions, 22146 flow [2025-04-14 01:22:36,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 894 transitions, 21448 flow, removed 317 selfloop flow, removed 3 redundant places. [2025-04-14 01:22:36,076 INFO L231 Difference]: Finished difference. Result has 255 places, 769 transitions, 19782 flow [2025-04-14 01:22:36,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=16222, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=404, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=19782, PETRI_PLACES=255, PETRI_TRANSITIONS=769} [2025-04-14 01:22:36,077 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 234 predicate places. [2025-04-14 01:22:36,077 INFO L485 AbstractCegarLoop]: Abstraction has has 255 places, 769 transitions, 19782 flow [2025-04-14 01:22:36,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 19 states have internal predecessors, (90), 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 01:22:36,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:36,077 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:36,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:22:36,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 01:22:36,278 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:22:36,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:36,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1235333103, now seen corresponding path program 10 times [2025-04-14 01:22:36,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:36,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769082781] [2025-04-14 01:22:36,278 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:36,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:36,282 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:22:36,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:22:36,287 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:36,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:36,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:36,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769082781] [2025-04-14 01:22:36,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769082781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:36,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19777020] [2025-04-14 01:22:36,653 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:36,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:36,655 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:36,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:22:36,680 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:22:36,690 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:22:36,690 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:36,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:36,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 01:22:36,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:36,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:37,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19777020] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:37,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-04-14 01:22:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319106591] [2025-04-14 01:22:37,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:37,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:22:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:37,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:22:37,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:22:37,463 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:22:37,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 769 transitions, 19782 flow. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 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 01:22:37,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:37,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:22:37,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:40,839 INFO L116 PetriNetUnfolderBase]: 3237/5645 cut-off events. [2025-04-14 01:22:40,839 INFO L117 PetriNetUnfolderBase]: For 272383/272383 co-relation queries the response was YES. [2025-04-14 01:22:40,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62408 conditions, 5645 events. 3237/5645 cut-off events. For 272383/272383 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 37227 event pairs, 53 based on Foata normal form. 66/5711 useless extension candidates. Maximal degree in co-relation 62300. Up to 1790 conditions per place. [2025-04-14 01:22:40,907 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 477 selfloop transitions, 627 changer transitions 41/1145 dead transitions. [2025-04-14 01:22:40,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1145 transitions, 29648 flow [2025-04-14 01:22:40,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 01:22:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 01:22:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 284 transitions. [2025-04-14 01:22:40,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2025-04-14 01:22:40,909 INFO L175 Difference]: Start difference. First operand has 255 places, 769 transitions, 19782 flow. Second operand 36 states and 284 transitions. [2025-04-14 01:22:40,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1145 transitions, 29648 flow [2025-04-14 01:22:42,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 1145 transitions, 29338 flow, removed 110 selfloop flow, removed 9 redundant places. [2025-04-14 01:22:42,460 INFO L231 Difference]: Finished difference. Result has 289 places, 905 transitions, 25121 flow [2025-04-14 01:22:42,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=19300, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=762, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=488, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=25121, PETRI_PLACES=289, PETRI_TRANSITIONS=905} [2025-04-14 01:22:42,461 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 268 predicate places. [2025-04-14 01:22:42,461 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 905 transitions, 25121 flow [2025-04-14 01:22:42,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 states have internal predecessors, (98), 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 01:22:42,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:42,462 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:42,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:22:42,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:22:42,666 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:22:42,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1380278767, now seen corresponding path program 11 times [2025-04-14 01:22:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:42,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708199262] [2025-04-14 01:22:42,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:42,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:22:42,675 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:22:42,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:22:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:42,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708199262] [2025-04-14 01:22:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708199262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:42,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364757712] [2025-04-14 01:22:42,888 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:42,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:42,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:42,890 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:42,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:22:42,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-14 01:22:42,932 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:22:42,932 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:22:42,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:42,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:22:42,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:43,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:22:43,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:43,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364757712] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:43,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 18 [2025-04-14 01:22:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117989477] [2025-04-14 01:22:43,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:43,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:22:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:43,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:22:43,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:22:43,736 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:22:43,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 905 transitions, 25121 flow. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 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 01:22:43,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:43,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:22:43,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:48,579 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:22:54,152 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:22:56,413 INFO L116 PetriNetUnfolderBase]: 4450/7710 cut-off events. [2025-04-14 01:22:56,413 INFO L117 PetriNetUnfolderBase]: For 436261/436261 co-relation queries the response was YES. [2025-04-14 01:22:56,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92838 conditions, 7710 events. 4450/7710 cut-off events. For 436261/436261 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 53689 event pairs, 90 based on Foata normal form. 65/7775 useless extension candidates. Maximal degree in co-relation 92722. Up to 2391 conditions per place. [2025-04-14 01:22:56,510 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 563 selfloop transitions, 976 changer transitions 10/1549 dead transitions. [2025-04-14 01:22:56,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1549 transitions, 45752 flow [2025-04-14 01:22:56,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:22:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:22:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 217 transitions. [2025-04-14 01:22:56,511 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3616666666666667 [2025-04-14 01:22:56,511 INFO L175 Difference]: Start difference. First operand has 289 places, 905 transitions, 25121 flow. Second operand 30 states and 217 transitions. [2025-04-14 01:22:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1549 transitions, 45752 flow [2025-04-14 01:22:59,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 1549 transitions, 43606 flow, removed 860 selfloop flow, removed 10 redundant places. [2025-04-14 01:22:59,283 INFO L231 Difference]: Finished difference. Result has 325 places, 1325 transitions, 40328 flow [2025-04-14 01:22:59,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=24185, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=901, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=591, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=40328, PETRI_PLACES=325, PETRI_TRANSITIONS=1325} [2025-04-14 01:22:59,284 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 304 predicate places. [2025-04-14 01:22:59,284 INFO L485 AbstractCegarLoop]: Abstraction has has 325 places, 1325 transitions, 40328 flow [2025-04-14 01:22:59,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 19 states have internal predecessors, (76), 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 01:22:59,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:59,285 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:59,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:22:59,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:22:59,485 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:22:59,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2055219353, now seen corresponding path program 12 times [2025-04-14 01:22:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:59,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427901122] [2025-04-14 01:22:59,486 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:59,489 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:22:59,496 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:22:59,496 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:22:59,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:59,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:59,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427901122] [2025-04-14 01:22:59,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427901122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:59,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867524446] [2025-04-14 01:22:59,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:59,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:59,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:59,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:22:59,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:22:59,724 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:22:59,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:22:59,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:22:59,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:59,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:22:59,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:22:59,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:22:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867524446] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:22:59,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:22:59,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2025-04-14 01:22:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209707220] [2025-04-14 01:22:59,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:22:59,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:22:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:59,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:22:59,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:22:59,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-04-14 01:22:59,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 1325 transitions, 40328 flow. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 01:22:59,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:59,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-04-14 01:22:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:02,620 INFO L116 PetriNetUnfolderBase]: 3967/7152 cut-off events. [2025-04-14 01:23:02,620 INFO L117 PetriNetUnfolderBase]: For 392553/392735 co-relation queries the response was YES. [2025-04-14 01:23:02,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92514 conditions, 7152 events. 3967/7152 cut-off events. For 392553/392735 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 51826 event pairs, 111 based on Foata normal form. 56/7165 useless extension candidates. Maximal degree in co-relation 92381. Up to 5949 conditions per place. [2025-04-14 01:23:02,724 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 946 selfloop transitions, 34 changer transitions 3/1339 dead transitions. [2025-04-14 01:23:02,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1339 transitions, 42402 flow [2025-04-14 01:23:02,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:23:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:23:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2025-04-14 01:23:02,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-04-14 01:23:02,725 INFO L175 Difference]: Start difference. First operand has 325 places, 1325 transitions, 40328 flow. Second operand 8 states and 62 transitions. [2025-04-14 01:23:02,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1339 transitions, 42402 flow [2025-04-14 01:23:06,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 1339 transitions, 41454 flow, removed 308 selfloop flow, removed 14 redundant places. [2025-04-14 01:23:06,305 INFO L231 Difference]: Finished difference. Result has 319 places, 1326 transitions, 39492 flow [2025-04-14 01:23:06,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=39384, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=39492, PETRI_PLACES=319, PETRI_TRANSITIONS=1326} [2025-04-14 01:23:06,308 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 298 predicate places. [2025-04-14 01:23:06,308 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 1326 transitions, 39492 flow [2025-04-14 01:23:06,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 01:23:06,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:06,308 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:23:06,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:23:06,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:06,509 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:23:06,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:06,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1853910439, now seen corresponding path program 13 times [2025-04-14 01:23:06,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:06,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359179106] [2025-04-14 01:23:06,510 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:23:06,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:06,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:23:06,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:23:06,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:23:06,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:06,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359179106] [2025-04-14 01:23:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359179106] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:06,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130199382] [2025-04-14 01:23:06,660 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:23:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:06,663 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:06,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:23:06,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:23:06,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:23:06,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:23:06,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:06,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:23:06,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:06,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130199382] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:07,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:07,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2025-04-14 01:23:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823017162] [2025-04-14 01:23:07,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:07,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:23:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:07,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:23:07,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:23:07,233 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:23:07,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 1326 transitions, 39492 flow. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 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 01:23:07,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:07,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:23:07,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:11,047 INFO L116 PetriNetUnfolderBase]: 4797/8311 cut-off events. [2025-04-14 01:23:11,047 INFO L117 PetriNetUnfolderBase]: For 388361/388361 co-relation queries the response was YES. [2025-04-14 01:23:11,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99983 conditions, 8311 events. 4797/8311 cut-off events. For 388361/388361 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 58423 event pairs, 92 based on Foata normal form. 48/8359 useless extension candidates. Maximal degree in co-relation 99855. Up to 3402 conditions per place. [2025-04-14 01:23:11,141 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 564 selfloop transitions, 960 changer transitions 3/1527 dead transitions. [2025-04-14 01:23:11,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1527 transitions, 47416 flow [2025-04-14 01:23:11,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:23:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:23:11,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 149 transitions. [2025-04-14 01:23:11,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3547619047619048 [2025-04-14 01:23:11,143 INFO L175 Difference]: Start difference. First operand has 319 places, 1326 transitions, 39492 flow. Second operand 21 states and 149 transitions. [2025-04-14 01:23:11,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1527 transitions, 47416 flow [2025-04-14 01:23:14,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 1527 transitions, 47352 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-14 01:23:14,859 INFO L231 Difference]: Finished difference. Result has 344 places, 1421 transitions, 46353 flow [2025-04-14 01:23:14,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=39376, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=875, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=46353, PETRI_PLACES=344, PETRI_TRANSITIONS=1421} [2025-04-14 01:23:14,860 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 323 predicate places. [2025-04-14 01:23:14,860 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 1421 transitions, 46353 flow [2025-04-14 01:23:14,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 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 01:23:14,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:14,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:23:14,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-14 01:23:15,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 01:23:15,061 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:23:15,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:15,062 INFO L85 PathProgramCache]: Analyzing trace with hash 994441263, now seen corresponding path program 14 times [2025-04-14 01:23:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:15,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026070117] [2025-04-14 01:23:15,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:23:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:15,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:23:15,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:23:15,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:15,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:15,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026070117] [2025-04-14 01:23:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026070117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:15,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823118220] [2025-04-14 01:23:15,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:23:15,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:15,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:15,226 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:15,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:23:15,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:23:15,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:23:15,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:15,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:15,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 01:23:15,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:23:15,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:23:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823118220] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:23:15,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:23:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2025-04-14 01:23:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252386987] [2025-04-14 01:23:15,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:23:15,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:23:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:15,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:23:15,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:23:15,447 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-04-14 01:23:15,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1421 transitions, 46353 flow. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 01:23:15,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:15,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-04-14 01:23:15,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:18,367 INFO L116 PetriNetUnfolderBase]: 4321/7740 cut-off events. [2025-04-14 01:23:18,367 INFO L117 PetriNetUnfolderBase]: For 428984/429182 co-relation queries the response was YES. [2025-04-14 01:23:18,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101617 conditions, 7740 events. 4321/7740 cut-off events. For 428984/429182 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 56439 event pairs, 103 based on Foata normal form. 54/7748 useless extension candidates. Maximal degree in co-relation 101477. Up to 6386 conditions per place. [2025-04-14 01:23:18,462 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 996 selfloop transitions, 42 changer transitions 3/1431 dead transitions. [2025-04-14 01:23:18,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1431 transitions, 48496 flow [2025-04-14 01:23:18,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:23:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:23:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2025-04-14 01:23:18,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:23:18,463 INFO L175 Difference]: Start difference. First operand has 344 places, 1421 transitions, 46353 flow. Second operand 8 states and 60 transitions. [2025-04-14 01:23:18,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1431 transitions, 48496 flow [2025-04-14 01:23:22,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 1431 transitions, 48025 flow, removed 203 selfloop flow, removed 7 redundant places. [2025-04-14 01:23:22,165 INFO L231 Difference]: Finished difference. Result has 344 places, 1419 transitions, 45949 flow [2025-04-14 01:23:22,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=45831, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=45949, PETRI_PLACES=344, PETRI_TRANSITIONS=1419} [2025-04-14 01:23:22,167 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 323 predicate places. [2025-04-14 01:23:22,167 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 1419 transitions, 45949 flow [2025-04-14 01:23:22,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 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 01:23:22,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:22,167 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:23:22,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-14 01:23:22,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:22,372 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:23:22,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1752970834, now seen corresponding path program 15 times [2025-04-14 01:23:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:22,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623774128] [2025-04-14 01:23:22,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:23:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:22,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-14 01:23:22,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:23:22,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:23:22,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:22,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:22,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:22,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623774128] [2025-04-14 01:23:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623774128] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:22,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9037580] [2025-04-14 01:23:22,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:23:22,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:22,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:22,545 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:22,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:23:22,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-14 01:23:22,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:23:22,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:23:22,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:22,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:23:22,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:22,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:22,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9037580] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:22,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:22,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 01:23:22,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627064278] [2025-04-14 01:23:22,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:22,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:23:22,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:22,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:23:22,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:23:22,989 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:23:22,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1419 transitions, 45949 flow. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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 01:23:22,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:22,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:23:22,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:28,158 INFO L116 PetriNetUnfolderBase]: 5848/9983 cut-off events. [2025-04-14 01:23:28,159 INFO L117 PetriNetUnfolderBase]: For 541972/541972 co-relation queries the response was YES. [2025-04-14 01:23:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129409 conditions, 9983 events. 5848/9983 cut-off events. For 541972/541972 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 70796 event pairs, 28 based on Foata normal form. 17/10000 useless extension candidates. Maximal degree in co-relation 129269. Up to 2756 conditions per place. [2025-04-14 01:23:28,276 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 627 selfloop transitions, 1447 changer transitions 51/2125 dead transitions. [2025-04-14 01:23:28,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 2125 transitions, 70160 flow [2025-04-14 01:23:28,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 01:23:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 01:23:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 311 transitions. [2025-04-14 01:23:28,278 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37023809523809526 [2025-04-14 01:23:28,278 INFO L175 Difference]: Start difference. First operand has 344 places, 1419 transitions, 45949 flow. Second operand 42 states and 311 transitions. [2025-04-14 01:23:28,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 2125 transitions, 70160 flow [2025-04-14 01:23:33,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 2125 transitions, 70068 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-04-14 01:23:33,101 INFO L231 Difference]: Finished difference. Result has 404 places, 1921 transitions, 67113 flow [2025-04-14 01:23:33,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=45869, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=977, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=67113, PETRI_PLACES=404, PETRI_TRANSITIONS=1921} [2025-04-14 01:23:33,102 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 383 predicate places. [2025-04-14 01:23:33,102 INFO L485 AbstractCegarLoop]: Abstraction has has 404 places, 1921 transitions, 67113 flow [2025-04-14 01:23:33,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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 01:23:33,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:33,102 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:23:33,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:23:33,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:33,303 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:23:33,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1317240872, now seen corresponding path program 16 times [2025-04-14 01:23:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:33,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788872514] [2025-04-14 01:23:33,304 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:23:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:33,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:23:33,313 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:23:33,313 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:23:33,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:33,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788872514] [2025-04-14 01:23:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788872514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:33,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762693185] [2025-04-14 01:23:33,493 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:23:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:33,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:33,495 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:23:33,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:23:33,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:23:33,528 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:23:33,529 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:23:33,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:33,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:23:33,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:33,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:33,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:35,649 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:35,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762693185] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:35,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:35,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:23:35,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142355421] [2025-04-14 01:23:35,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:35,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:23:35,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:35,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:23:35,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:23:35,659 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:23:35,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1921 transitions, 67113 flow. Second operand has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 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 01:23:35,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:35,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:23:35,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:50,136 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:56,485 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:03,670 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:05,567 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:15,886 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:20,264 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:24,506 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:29,057 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:38,841 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:50,418 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:54,356 INFO L116 PetriNetUnfolderBase]: 6180/10494 cut-off events. [2025-04-14 01:24:54,357 INFO L117 PetriNetUnfolderBase]: For 714562/714562 co-relation queries the response was YES. [2025-04-14 01:24:54,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150216 conditions, 10494 events. 6180/10494 cut-off events. For 714562/714562 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 74378 event pairs, 39 based on Foata normal form. 46/10540 useless extension candidates. Maximal degree in co-relation 150050. Up to 2931 conditions per place. [2025-04-14 01:24:54,490 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 694 selfloop transitions, 1567 changer transitions 20/2281 dead transitions. [2025-04-14 01:24:54,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 2281 transitions, 82096 flow [2025-04-14 01:24:54,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-14 01:24:54,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-14 01:24:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 364 transitions. [2025-04-14 01:24:54,492 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37916666666666665 [2025-04-14 01:24:54,492 INFO L175 Difference]: Start difference. First operand has 404 places, 1921 transitions, 67113 flow. Second operand 48 states and 364 transitions. [2025-04-14 01:24:54,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 2281 transitions, 82096 flow [2025-04-14 01:25:02,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 2281 transitions, 80082 flow, removed 674 selfloop flow, removed 12 redundant places. [2025-04-14 01:25:02,730 INFO L231 Difference]: Finished difference. Result has 452 places, 2071 transitions, 76107 flow [2025-04-14 01:25:02,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=65445, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1921, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1421, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=76107, PETRI_PLACES=452, PETRI_TRANSITIONS=2071} [2025-04-14 01:25:02,732 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 431 predicate places. [2025-04-14 01:25:02,732 INFO L485 AbstractCegarLoop]: Abstraction has has 452 places, 2071 transitions, 76107 flow [2025-04-14 01:25:02,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 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 01:25:02,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:25:02,732 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:25:02,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:25:02,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:25:02,934 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:25:02,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:25:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1442498934, now seen corresponding path program 17 times [2025-04-14 01:25:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:25:02,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860966136] [2025-04-14 01:25:02,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:25:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:25:02,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-14 01:25:02,944 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:25:02,944 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:25:02,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:25:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:25:03,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860966136] [2025-04-14 01:25:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860966136] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:25:03,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2332645] [2025-04-14 01:25:03,348 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:25:03,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:25:03,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:25:03,350 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:25:03,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:25:03,374 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-14 01:25:03,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:25:03,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:25:03,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:03,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:25:03,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:25:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:25:03,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:25:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:25:04,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2332645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:04,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:04,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2025-04-14 01:25:04,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489457198] [2025-04-14 01:25:04,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:04,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:25:04,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:04,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:25:04,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:25:04,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:25:04,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 2071 transitions, 76107 flow. Second operand has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 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 01:25:04,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:04,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:25:04,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:11,430 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:15,440 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:25,152 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:29,163 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:33,184 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:37,193 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:41,204 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:44,463 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:48,469 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:52,475 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:57,589 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:06,191 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:10,196 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:18,650 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:26,223 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:30,236 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:38,915 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:43,605 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:55,239 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:59,253 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:03,290 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:08,182 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:12,267 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:35,246 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:53,524 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:02,882 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:08,709 INFO L116 PetriNetUnfolderBase]: 6872/11583 cut-off events. [2025-04-14 01:28:08,710 INFO L117 PetriNetUnfolderBase]: For 854335/854335 co-relation queries the response was YES. [2025-04-14 01:28:08,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172423 conditions, 11583 events. 6872/11583 cut-off events. For 854335/854335 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 82837 event pairs, 44 based on Foata normal form. 56/11639 useless extension candidates. Maximal degree in co-relation 172249. Up to 2535 conditions per place. [2025-04-14 01:28:09,042 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 848 selfloop transitions, 1763 changer transitions 10/2621 dead transitions. [2025-04-14 01:28:09,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 2621 transitions, 98166 flow [2025-04-14 01:28:09,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 01:28:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-14 01:28:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 440 transitions. [2025-04-14 01:28:09,047 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3384615384615385 [2025-04-14 01:28:09,047 INFO L175 Difference]: Start difference. First operand has 452 places, 2071 transitions, 76107 flow. Second operand 65 states and 440 transitions. [2025-04-14 01:28:09,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 2621 transitions, 98166 flow [2025-04-14 01:28:20,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 2621 transitions, 97147 flow, removed 299 selfloop flow, removed 18 redundant places. [2025-04-14 01:28:20,216 INFO L231 Difference]: Finished difference. Result has 524 places, 2417 transitions, 94406 flow [2025-04-14 01:28:20,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=75263, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2071, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1438, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=94406, PETRI_PLACES=524, PETRI_TRANSITIONS=2417} [2025-04-14 01:28:20,218 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 503 predicate places. [2025-04-14 01:28:20,218 INFO L485 AbstractCegarLoop]: Abstraction has has 524 places, 2417 transitions, 94406 flow [2025-04-14 01:28:20,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.88) internal successors, (97), 25 states have internal predecessors, (97), 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 01:28:20,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:20,219 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:28:20,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-14 01:28:20,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:20,419 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:28:20,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1018452912, now seen corresponding path program 18 times [2025-04-14 01:28:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:20,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28092113] [2025-04-14 01:28:20,420 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:28:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:20,424 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:28:20,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:28:20,435 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:28:20,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:20,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:20,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28092113] [2025-04-14 01:28:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28092113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:20,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100297731] [2025-04-14 01:28:20,593 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:28:20,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:20,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:20,594 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:28:20,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:28:20,619 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:28:20,630 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:28:20,630 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:28:20,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:20,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:28:20,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:20,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100297731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:21,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2025-04-14 01:28:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628428719] [2025-04-14 01:28:21,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:21,237 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:28:21,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:21,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:28:21,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:28:21,241 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:28:21,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 2417 transitions, 94406 flow. Second operand has 21 states, 21 states have (on average 4.333333333333333) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:21,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:21,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:28:21,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:32,701 INFO L116 PetriNetUnfolderBase]: 7802/13194 cut-off events. [2025-04-14 01:28:32,701 INFO L117 PetriNetUnfolderBase]: For 1219906/1219906 co-relation queries the response was YES. [2025-04-14 01:28:32,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210369 conditions, 13194 events. 7802/13194 cut-off events. For 1219906/1219906 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 96875 event pairs, 102 based on Foata normal form. 202/13396 useless extension candidates. Maximal degree in co-relation 210176. Up to 2930 conditions per place. [2025-04-14 01:28:33,052 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 942 selfloop transitions, 1968 changer transitions 62/2972 dead transitions. [2025-04-14 01:28:33,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 2972 transitions, 120643 flow [2025-04-14 01:28:33,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 01:28:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 01:28:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 275 transitions. [2025-04-14 01:28:33,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3618421052631579 [2025-04-14 01:28:33,054 INFO L175 Difference]: Start difference. First operand has 524 places, 2417 transitions, 94406 flow. Second operand 38 states and 275 transitions. [2025-04-14 01:28:33,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 2972 transitions, 120643 flow [2025-04-14 01:28:51,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 2972 transitions, 117768 flow, removed 1183 selfloop flow, removed 21 redundant places. [2025-04-14 01:28:51,476 INFO L231 Difference]: Finished difference. Result has 549 places, 2688 transitions, 111040 flow [2025-04-14 01:28:51,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=91419, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1663, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=111040, PETRI_PLACES=549, PETRI_TRANSITIONS=2688} [2025-04-14 01:28:51,478 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 528 predicate places. [2025-04-14 01:28:51,478 INFO L485 AbstractCegarLoop]: Abstraction has has 549 places, 2688 transitions, 111040 flow [2025-04-14 01:28:51,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.333333333333333) internal successors, (91), 21 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:51,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:51,478 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:28:51,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 01:28:51,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 01:28:51,679 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:28:51,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:51,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1992999186, now seen corresponding path program 19 times [2025-04-14 01:28:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:51,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148660023] [2025-04-14 01:28:51,680 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:28:51,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:51,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:28:51,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:28:51,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:28:51,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:51,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:51,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148660023] [2025-04-14 01:28:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148660023] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:51,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010221776] [2025-04-14 01:28:51,899 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:28:51,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:51,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:51,900 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:28:51,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:28:51,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:28:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:28:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:28:51,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:51,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:28:51,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:52,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:28:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010221776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:52,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:52,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2025-04-14 01:28:52,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802570612] [2025-04-14 01:28:52,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:52,476 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:28:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:52,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:28:52,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:28:52,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:28:52,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 2688 transitions, 111040 flow. Second operand has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 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 01:28:52,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:52,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:28:52,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:58,287 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:29:02,982 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:29:05,812 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:29:18,625 INFO L116 PetriNetUnfolderBase]: 8315/14074 cut-off events. [2025-04-14 01:29:18,625 INFO L117 PetriNetUnfolderBase]: For 1289698/1289698 co-relation queries the response was YES. [2025-04-14 01:29:18,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232842 conditions, 14074 events. 8315/14074 cut-off events. For 1289698/1289698 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 104718 event pairs, 223 based on Foata normal form. 77/14151 useless extension candidates. Maximal degree in co-relation 232640. Up to 3180 conditions per place. [2025-04-14 01:29:18,878 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 715 selfloop transitions, 2455 changer transitions 6/3176 dead transitions. [2025-04-14 01:29:18,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 3176 transitions, 133486 flow [2025-04-14 01:29:18,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-14 01:29:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-04-14 01:29:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 376 transitions. [2025-04-14 01:29:18,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35471698113207545 [2025-04-14 01:29:18,879 INFO L175 Difference]: Start difference. First operand has 549 places, 2688 transitions, 111040 flow. Second operand 53 states and 376 transitions. [2025-04-14 01:29:18,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 3176 transitions, 133486 flow [2025-04-14 01:29:43,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 3176 transitions, 131830 flow, removed 484 selfloop flow, removed 16 redundant places. [2025-04-14 01:29:43,694 INFO L231 Difference]: Finished difference. Result has 600 places, 2959 transitions, 129904 flow [2025-04-14 01:29:43,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=109366, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=129904, PETRI_PLACES=600, PETRI_TRANSITIONS=2959} [2025-04-14 01:29:43,696 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 579 predicate places. [2025-04-14 01:29:43,696 INFO L485 AbstractCegarLoop]: Abstraction has has 600 places, 2959 transitions, 129904 flow [2025-04-14 01:29:43,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9523809523809526) internal successors, (83), 21 states have internal predecessors, (83), 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 01:29:43,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:29:43,696 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:29:43,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-14 01:29:43,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-04-14 01:29:43,897 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:29:43,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:29:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2073954104, now seen corresponding path program 20 times [2025-04-14 01:29:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:29:43,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352216958] [2025-04-14 01:29:43,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:29:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:29:43,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:29:43,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:29:43,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:29:43,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:29:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:29:44,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352216958] [2025-04-14 01:29:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352216958] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:29:44,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093617830] [2025-04-14 01:29:44,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:29:44,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:29:44,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:29:44,060 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:29:44,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:29:44,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:29:44,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:29:44,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:29:44,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:44,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-14 01:29:44,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:29:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:29:44,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:29:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:29:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093617830] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:29:44,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:29:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 21 [2025-04-14 01:29:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37747562] [2025-04-14 01:29:44,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:29:44,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:29:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:29:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:29:44,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:29:45,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:29:45,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 2959 transitions, 129904 flow. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 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 01:29:45,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:29:45,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:29:45,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:30:04,203 INFO L116 PetriNetUnfolderBase]: 9789/16376 cut-off events. [2025-04-14 01:30:04,203 INFO L117 PetriNetUnfolderBase]: For 1575606/1575606 co-relation queries the response was YES. [2025-04-14 01:30:04,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285094 conditions, 16376 events. 9789/16376 cut-off events. For 1575606/1575606 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 122252 event pairs, 52 based on Foata normal form. 10/16386 useless extension candidates. Maximal degree in co-relation 284877. Up to 8949 conditions per place. [2025-04-14 01:30:04,525 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 1293 selfloop transitions, 2359 changer transitions 19/3671 dead transitions. [2025-04-14 01:30:04,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 3671 transitions, 165177 flow [2025-04-14 01:30:04,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:30:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-14 01:30:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 309 transitions. [2025-04-14 01:30:04,527 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35113636363636364 [2025-04-14 01:30:04,527 INFO L175 Difference]: Start difference. First operand has 600 places, 2959 transitions, 129904 flow. Second operand 44 states and 309 transitions. [2025-04-14 01:30:04,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 3671 transitions, 165177 flow [2025-04-14 01:30:37,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 3671 transitions, 163834 flow, removed 493 selfloop flow, removed 12 redundant places. [2025-04-14 01:30:37,864 INFO L231 Difference]: Finished difference. Result has 651 places, 3513 transitions, 162338 flow [2025-04-14 01:30:37,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=128711, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1854, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=162338, PETRI_PLACES=651, PETRI_TRANSITIONS=3513} [2025-04-14 01:30:37,867 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 630 predicate places. [2025-04-14 01:30:37,867 INFO L485 AbstractCegarLoop]: Abstraction has has 651 places, 3513 transitions, 162338 flow [2025-04-14 01:30:37,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 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 01:30:37,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:30:37,868 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:30:37,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-14 01:30:38,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:38,070 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:30:38,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:30:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash -732235726, now seen corresponding path program 21 times [2025-04-14 01:30:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:30:38,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951220994] [2025-04-14 01:30:38,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:30:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:30:38,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:30:38,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:30:38,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:30:38,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:38,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:30:38,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951220994] [2025-04-14 01:30:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951220994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:30:38,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214894825] [2025-04-14 01:30:38,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:30:38,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:38,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:30:38,289 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:30:38,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:30:38,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:30:38,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:30:38,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:30:38,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:38,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:30:38,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:30:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:38,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:30:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:38,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214894825] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:30:38,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:30:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-04-14 01:30:38,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235015323] [2025-04-14 01:30:38,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:30:38,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:30:38,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:30:38,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:30:38,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:30:38,835 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:30:38,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 3513 transitions, 162338 flow. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 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 01:30:38,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:30:38,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:30:38,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:31:00,121 INFO L116 PetriNetUnfolderBase]: 10215/17175 cut-off events. [2025-04-14 01:31:00,121 INFO L117 PetriNetUnfolderBase]: For 1783492/1783492 co-relation queries the response was YES. [2025-04-14 01:31:00,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312590 conditions, 17175 events. 10215/17175 cut-off events. For 1783492/1783492 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 129903 event pairs, 83 based on Foata normal form. 26/17201 useless extension candidates. Maximal degree in co-relation 312355. Up to 9357 conditions per place. [2025-04-14 01:31:00,432 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 1599 selfloop transitions, 2242 changer transitions 30/3871 dead transitions. [2025-04-14 01:31:00,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 3871 transitions, 183624 flow [2025-04-14 01:31:00,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 01:31:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-04-14 01:31:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 358 transitions. [2025-04-14 01:31:00,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38085106382978723 [2025-04-14 01:31:00,433 INFO L175 Difference]: Start difference. First operand has 651 places, 3513 transitions, 162338 flow. Second operand 47 states and 358 transitions. [2025-04-14 01:31:00,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 3871 transitions, 183624 flow [2025-04-14 01:31:39,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 3871 transitions, 182191 flow, removed 633 selfloop flow, removed 9 redundant places. [2025-04-14 01:31:39,928 INFO L231 Difference]: Finished difference. Result has 701 places, 3687 transitions, 177991 flow [2025-04-14 01:31:39,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=161035, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2071, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=177991, PETRI_PLACES=701, PETRI_TRANSITIONS=3687} [2025-04-14 01:31:39,931 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 680 predicate places. [2025-04-14 01:31:39,931 INFO L485 AbstractCegarLoop]: Abstraction has has 701 places, 3687 transitions, 177991 flow [2025-04-14 01:31:39,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 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 01:31:39,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:31:39,931 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:31:39,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:31:40,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:31:40,134 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:31:40,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:31:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash 610199696, now seen corresponding path program 22 times [2025-04-14 01:31:40,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:31:40,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040136218] [2025-04-14 01:31:40,135 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:31:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:31:40,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:31:40,143 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:31:40,143 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:31:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:31:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:31:40,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:31:40,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040136218] [2025-04-14 01:31:40,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040136218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:31:40,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379784006] [2025-04-14 01:31:40,396 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:31:40,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:31:40,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:31:40,398 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:31:40,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:31:40,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:31:40,430 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:31:40,430 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:31:40,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:31:40,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:31:40,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:31:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:31:40,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:31:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:31:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379784006] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:31:40,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:31:40,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-04-14 01:31:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571969813] [2025-04-14 01:31:40,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:31:40,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:31:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:31:40,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:31:40,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:31:40,985 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2025-04-14 01:31:40,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 3687 transitions, 177991 flow. Second operand has 25 states, 25 states have (on average 4.12) internal successors, (103), 25 states have internal predecessors, (103), 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 01:31:40,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:31:40,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2025-04-14 01:31:40,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:31:50,437 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-14 01:32:15,380 INFO L116 PetriNetUnfolderBase]: 11415/19209 cut-off events. [2025-04-14 01:32:15,381 INFO L117 PetriNetUnfolderBase]: For 2268002/2268002 co-relation queries the response was YES. [2025-04-14 01:32:15,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365672 conditions, 19209 events. 11415/19209 cut-off events. For 2268002/2268002 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 147856 event pairs, 119 based on Foata normal form. 83/19292 useless extension candidates. Maximal degree in co-relation 365423. Up to 7288 conditions per place. [2025-04-14 01:32:15,771 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 1576 selfloop transitions, 2733 changer transitions 8/4317 dead transitions. [2025-04-14 01:32:15,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 4317 transitions, 213944 flow [2025-04-14 01:32:15,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 01:32:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-14 01:32:15,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 317 transitions. [2025-04-14 01:32:15,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34456521739130436 [2025-04-14 01:32:15,772 INFO L175 Difference]: Start difference. First operand has 701 places, 3687 transitions, 177991 flow. Second operand 46 states and 317 transitions. [2025-04-14 01:32:15,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 4317 transitions, 213944 flow Received shutdown request... [2025-04-14 01:32:58,239 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:32:58,239 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 01:32:58,256 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:32:58,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:32:58,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-14 01:32:58,457 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 01:32:58,460 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:32:58,460 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:32:58,460 INFO L422 BasicCegarLoop]: Path program histogram: [22, 3, 1, 1] [2025-04-14 01:32:58,470 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:32:58,470 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:32:58,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:32:58 BasicIcfg [2025-04-14 01:32:58,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:32:58,482 INFO L158 Benchmark]: Toolchain (without parser) took 844052.03ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 98.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2025-04-14 01:32:58,483 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:32:58,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.50ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 83.6MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:32:58,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:32:58,483 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:32:58,483 INFO L158 Benchmark]: IcfgBuilder took 310.77ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 56.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:32:58,483 INFO L158 Benchmark]: TraceAbstraction took 843435.75ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 56.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2025-04-14 01:32:58,484 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.20ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.50ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 83.6MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 82.3MB in the end (delta: 1.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 310.77ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 56.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 843435.75ms. Allocated memory was 142.6MB in the beginning and 2.6GB in the end (delta: 2.4GB). Free memory was 56.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 28 locations, 33 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 843.3s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 794.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 80 mSolverCounterUnknown, 2962 SdHoareTripleChecker+Valid, 318.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2948 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 317.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 748 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11432 IncrementalHoareTripleChecker+Invalid, 12260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 748 mSolverCounterUnsat, 13 mSDtfsCounter, 11432 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1661 GetRequests, 865 SyntacticMatches, 19 SemanticMatches, 777 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9649 ImplicationChecksByTransitivity, 194.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177991occurred in iteration=26, InterpolantAutomatonStates: 623, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 42.5s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 1246 ConstructedInterpolants, 25 QuantifiedInterpolants, 12392 SizeOfPredicates, 172 NumberOfNonLiveVariables, 2311 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 71 InterpolantComputations, 8 PerfectInterpolantSequences, 33/293 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