/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/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:41:12,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:41:12,710 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:41:12,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:41:12,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:41:12,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:41:12,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:41:12,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:41:12,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:41:12,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:41:12,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:41:12,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:41:12,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:41:12,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:41:12,730 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:41:12,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:41:12,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:41:12,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:41:12,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:41:12,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:41:12,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:41:12,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:41:12,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:41:12,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:41:12,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:41:12,734 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:41:12,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:41:12,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:41:12,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:41:12,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:41:12,958 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:41:12,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2025-04-14 01:41:14,289 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d074f24e/06377766a20845a19cc107346011180d/FLAG548c1801c [2025-04-14 01:41:14,477 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:41:14,478 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2025-04-14 01:41:14,483 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d074f24e/06377766a20845a19cc107346011180d/FLAG548c1801c [2025-04-14 01:41:15,491 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d074f24e/06377766a20845a19cc107346011180d [2025-04-14 01:41:15,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:41:15,494 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:41:15,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:41:15,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:41:15,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:41:15,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b1894c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15, skipping insertion in model container [2025-04-14 01:41:15,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:41:15,683 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/unroll-cond-3.wvr.c[2667,2680] [2025-04-14 01:41:15,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:41:15,703 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:41:15,733 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/unroll-cond-3.wvr.c[2667,2680] [2025-04-14 01:41:15,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:41:15,744 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:41:15,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15 WrapperNode [2025-04-14 01:41:15,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:41:15,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:41:15,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:41:15,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:41:15,749 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:41:15" (1/1) ... [2025-04-14 01:41:15,760 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:41:15" (1/1) ... [2025-04-14 01:41:15,779 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 146 [2025-04-14 01:41:15,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:41:15,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:41:15,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:41:15,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:41:15,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,809 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 01:41:15,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,814 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:41:15,827 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:41:15,827 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:41:15,827 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:41:15,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (1/1) ... [2025-04-14 01:41:15,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:41:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:15,852 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:41:15,854 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:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:41:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:41:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:41:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:41:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:41:15,872 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:41:15,949 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:41:15,951 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:41:16,204 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:41:16,205 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:41:16,205 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:41:16,468 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:41:16,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:41:16 BoogieIcfgContainer [2025-04-14 01:41:16,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:41:16,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:41:16,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:41:16,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:41:16,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:41:15" (1/3) ... [2025-04-14 01:41:16,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddd1d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:41:16, skipping insertion in model container [2025-04-14 01:41:16,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:41:15" (2/3) ... [2025-04-14 01:41:16,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddd1d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:41:16, skipping insertion in model container [2025-04-14 01:41:16,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:41:16" (3/3) ... [2025-04-14 01:41:16,478 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-04-14 01:41:16,488 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:41:16,489 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:41:16,490 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:41:16,533 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:41:16,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 52 flow [2025-04-14 01:41:16,573 INFO L116 PetriNetUnfolderBase]: 3/17 cut-off events. [2025-04-14 01:41:16,575 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:41:16,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 3/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-14 01:41:16,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 52 flow [2025-04-14 01:41:16,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-14 01:41:16,587 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:41:16,600 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;@63139125, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:41:16,600 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:41:16,611 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:41:16,611 INFO L116 PetriNetUnfolderBase]: 3/15 cut-off events. [2025-04-14 01:41:16,611 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:41:16,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:16,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:16,612 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:41:16,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:16,616 INFO L85 PathProgramCache]: Analyzing trace with hash 766225762, now seen corresponding path program 1 times [2025-04-14 01:41:16,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:16,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244436817] [2025-04-14 01:41:16,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:41:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:16,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 01:41:16,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 01:41:16,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:16,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:16,883 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:41:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:16,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244436817] [2025-04-14 01:41:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244436817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:16,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:41:16,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266499850] [2025-04-14 01:41:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:16,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:41:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:16,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:41:16,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:41:16,908 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:16,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:41:16,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:16,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:16,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:16,977 INFO L116 PetriNetUnfolderBase]: 38/70 cut-off events. [2025-04-14 01:41:16,977 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:41:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 70 events. 38/70 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-04-14 01:41:16,978 INFO L140 encePairwiseOnDemand]: 16/19 looper letters, 15 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2025-04-14 01:41:16,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 17 transitions, 80 flow [2025-04-14 01:41:16,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:41:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:41:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2025-04-14 01:41:16,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-14 01:41:16,987 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 44 flow. Second operand 3 states and 24 transitions. [2025-04-14 01:41:16,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 17 transitions, 80 flow [2025-04-14 01:41:16,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 17 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:41:16,991 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 48 flow [2025-04-14 01:41:16,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-04-14 01:41:16,994 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2025-04-14 01:41:16,995 INFO L485 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 48 flow [2025-04-14 01:41:16,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:41:16,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:16,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:16,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:41:16,995 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:41:16,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash -410597149, now seen corresponding path program 1 times [2025-04-14 01:41:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:16,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504334020] [2025-04-14 01:41:16,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:41:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:17,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:41:17,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:41:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:17,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:17,220 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:41:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:17,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504334020] [2025-04-14 01:41:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504334020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:41:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046941921] [2025-04-14 01:41:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:17,222 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:41:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:41:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:41:17,222 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:17,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:17,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:17,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:17,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:17,410 INFO L116 PetriNetUnfolderBase]: 65/121 cut-off events. [2025-04-14 01:41:17,410 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:41:17,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 121 events. 65/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 322 event pairs, 22 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 246. Up to 71 conditions per place. [2025-04-14 01:41:17,412 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 32 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2025-04-14 01:41:17,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 37 transitions, 167 flow [2025-04-14 01:41:17,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:41:17,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:41:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-14 01:41:17,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-04-14 01:41:17,414 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 48 flow. Second operand 5 states and 47 transitions. [2025-04-14 01:41:17,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 37 transitions, 167 flow [2025-04-14 01:41:17,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 163 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:41:17,416 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 80 flow [2025-04-14 01:41:17,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-14 01:41:17,416 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2025-04-14 01:41:17,417 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 80 flow [2025-04-14 01:41:17,417 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:17,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:17,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:17,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:41:17,417 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:41:17,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -551994961, now seen corresponding path program 2 times [2025-04-14 01:41:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:17,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437162506] [2025-04-14 01:41:17,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:41:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:17,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:41:17,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-14 01:41:17,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:41:17,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:17,602 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:41:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:17,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437162506] [2025-04-14 01:41:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437162506] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:17,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:17,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:41:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353516543] [2025-04-14 01:41:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:17,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:41:17,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:17,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:41:17,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:41:17,603 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:17,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:17,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:17,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:17,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:17,733 INFO L116 PetriNetUnfolderBase]: 100/186 cut-off events. [2025-04-14 01:41:17,733 INFO L117 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-04-14 01:41:17,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 186 events. 100/186 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 594 event pairs, 39 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 527. Up to 120 conditions per place. [2025-04-14 01:41:17,736 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2025-04-14 01:41:17,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 240 flow [2025-04-14 01:41:17,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:41:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:41:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2025-04-14 01:41:17,737 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2025-04-14 01:41:17,737 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 80 flow. Second operand 5 states and 43 transitions. [2025-04-14 01:41:17,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 240 flow [2025-04-14 01:41:17,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 223 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 01:41:17,738 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 122 flow [2025-04-14 01:41:17,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2025-04-14 01:41:17,739 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2025-04-14 01:41:17,739 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 122 flow [2025-04-14 01:41:17,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:17,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:17,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:17,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:41:17,739 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:41:17,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1835515799, now seen corresponding path program 3 times [2025-04-14 01:41:17,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:17,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120436055] [2025-04-14 01:41:17,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:41:17,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:17,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:41:17,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-14 01:41:17,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:41:17,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:17,886 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:41:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:17,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120436055] [2025-04-14 01:41:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120436055] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:17,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:17,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:41:17,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989153429] [2025-04-14 01:41:17,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:17,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:41:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:17,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:41:17,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:41:17,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:17,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:17,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:17,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:17,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:18,006 INFO L116 PetriNetUnfolderBase]: 109/200 cut-off events. [2025-04-14 01:41:18,006 INFO L117 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2025-04-14 01:41:18,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 200 events. 109/200 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 645 event pairs, 39 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 685. Up to 111 conditions per place. [2025-04-14 01:41:18,008 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 33 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2025-04-14 01:41:18,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 305 flow [2025-04-14 01:41:18,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:41:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:41:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-14 01:41:18,009 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-04-14 01:41:18,009 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 122 flow. Second operand 5 states and 47 transitions. [2025-04-14 01:41:18,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 305 flow [2025-04-14 01:41:18,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 281 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 01:41:18,011 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 201 flow [2025-04-14 01:41:18,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-04-14 01:41:18,012 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2025-04-14 01:41:18,012 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 201 flow [2025-04-14 01:41:18,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:18,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:18,012 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:18,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:41:18,015 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:41:18,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash -694098031, now seen corresponding path program 4 times [2025-04-14 01:41:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:18,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093617830] [2025-04-14 01:41:18,016 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:41:18,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:18,023 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:41:18,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:41:18,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:41:18,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:18,149 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:41:18,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:18,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093617830] [2025-04-14 01:41:18,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093617830] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:18,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:18,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:41:18,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414290050] [2025-04-14 01:41:18,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:18,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:41:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:18,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:41:18,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:41:18,150 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:18,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:18,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:18,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:18,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:18,256 INFO L116 PetriNetUnfolderBase]: 106/197 cut-off events. [2025-04-14 01:41:18,256 INFO L117 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-04-14 01:41:18,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 197 events. 106/197 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 620 event pairs, 46 based on Foata normal form. 3/175 useless extension candidates. Maximal degree in co-relation 748. Up to 160 conditions per place. [2025-04-14 01:41:18,259 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 29 selfloop transitions, 15 changer transitions 0/44 dead transitions. [2025-04-14 01:41:18,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 363 flow [2025-04-14 01:41:18,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:41:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:41:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-14 01:41:18,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-04-14 01:41:18,264 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 201 flow. Second operand 5 states and 42 transitions. [2025-04-14 01:41:18,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 363 flow [2025-04-14 01:41:18,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 350 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:41:18,267 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 294 flow [2025-04-14 01:41:18,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-04-14 01:41:18,268 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 22 predicate places. [2025-04-14 01:41:18,268 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 294 flow [2025-04-14 01:41:18,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:18,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:18,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:18,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:41:18,269 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:41:18,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1303687937, now seen corresponding path program 5 times [2025-04-14 01:41:18,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:18,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107957823] [2025-04-14 01:41:18,269 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:41:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:18,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:41:18,287 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:41:18,287 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:41:18,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:18,457 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:41:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:18,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107957823] [2025-04-14 01:41:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107957823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:18,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:18,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:41:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063607053] [2025-04-14 01:41:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:18,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:41:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:18,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:41:18,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:41:18,458 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:18,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 294 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:41:18,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:18,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:18,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:18,554 INFO L116 PetriNetUnfolderBase]: 107/200 cut-off events. [2025-04-14 01:41:18,555 INFO L117 PetriNetUnfolderBase]: For 606/606 co-relation queries the response was YES. [2025-04-14 01:41:18,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 200 events. 107/200 cut-off events. For 606/606 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 629 event pairs, 13 based on Foata normal form. 2/177 useless extension candidates. Maximal degree in co-relation 848. Up to 153 conditions per place. [2025-04-14 01:41:18,556 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 36 selfloop transitions, 18 changer transitions 0/54 dead transitions. [2025-04-14 01:41:18,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 501 flow [2025-04-14 01:41:18,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:41:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:41:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2025-04-14 01:41:18,558 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2025-04-14 01:41:18,558 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 294 flow. Second operand 6 states and 53 transitions. [2025-04-14 01:41:18,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 501 flow [2025-04-14 01:41:18,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 437 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-04-14 01:41:18,563 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 337 flow [2025-04-14 01:41:18,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2025-04-14 01:41:18,563 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2025-04-14 01:41:18,563 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 337 flow [2025-04-14 01:41:18,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:41:18,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:18,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:18,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:41:18,564 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:41:18,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash -690523111, now seen corresponding path program 6 times [2025-04-14 01:41:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:18,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970796560] [2025-04-14 01:41:18,564 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:41:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:18,571 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-04-14 01:41:18,581 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 13 of 14 statements. [2025-04-14 01:41:18,581 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:41:18,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:18,652 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:41:18,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:18,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970796560] [2025-04-14 01:41:18,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970796560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:41:18,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:41:18,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:41:18,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792058193] [2025-04-14 01:41:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:41:18,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:41:18,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:18,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:41:18,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:41:18,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:18,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:18,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:18,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:18,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:18,733 INFO L116 PetriNetUnfolderBase]: 106/194 cut-off events. [2025-04-14 01:41:18,733 INFO L117 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-04-14 01:41:18,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 194 events. 106/194 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 610 event pairs, 39 based on Foata normal form. 2/171 useless extension candidates. Maximal degree in co-relation 822. Up to 154 conditions per place. [2025-04-14 01:41:18,734 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 33 selfloop transitions, 17 changer transitions 0/50 dead transitions. [2025-04-14 01:41:18,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 467 flow [2025-04-14 01:41:18,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:41:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:41:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2025-04-14 01:41:18,735 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4421052631578947 [2025-04-14 01:41:18,735 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 337 flow. Second operand 5 states and 42 transitions. [2025-04-14 01:41:18,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 467 flow [2025-04-14 01:41:18,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 50 transitions, 446 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-14 01:41:18,738 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 366 flow [2025-04-14 01:41:18,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2025-04-14 01:41:18,739 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 31 predicate places. [2025-04-14 01:41:18,739 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 366 flow [2025-04-14 01:41:18,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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:41:18,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:18,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:18,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:41:18,739 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:41:18,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:18,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1730814274, now seen corresponding path program 1 times [2025-04-14 01:41:18,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:18,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450077144] [2025-04-14 01:41:18,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:41:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:18,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:41:18,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:18,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:18,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:41:18,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:18,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450077144] [2025-04-14 01:41:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450077144] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:18,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775084542] [2025-04-14 01:41:18,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:41:18,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:18,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:18,901 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:41:18,902 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:41:18,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:41:18,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:18,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:18,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:18,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:41:18,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:19,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:41:19,240 INFO L325 Elim1Store]: treesize reduction 80, result has 14.0 percent of original size [2025-04-14 01:41:19,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 223 treesize of output 152 [2025-04-14 01:41:19,329 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:41:19,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:19,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 280 [2025-04-14 01:41:20,079 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:41:20,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 1161 treesize of output 899 [2025-04-14 01:41:48,140 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:41:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775084542] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:48,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:48,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-04-14 01:41:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608270174] [2025-04-14 01:41:48,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:48,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:41:48,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:48,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:41:48,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:41:48,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:48,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 366 flow. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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:41:48,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:48,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:48,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:48,851 INFO L116 PetriNetUnfolderBase]: 271/510 cut-off events. [2025-04-14 01:41:48,851 INFO L117 PetriNetUnfolderBase]: For 1593/1593 co-relation queries the response was YES. [2025-04-14 01:41:48,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 510 events. 271/510 cut-off events. For 1593/1593 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2255 event pairs, 23 based on Foata normal form. 7/437 useless extension candidates. Maximal degree in co-relation 1734. Up to 157 conditions per place. [2025-04-14 01:41:48,854 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 66 selfloop transitions, 43 changer transitions 57/166 dead transitions. [2025-04-14 01:41:48,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 166 transitions, 1381 flow [2025-04-14 01:41:48,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 01:41:48,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 01:41:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 202 transitions. [2025-04-14 01:41:48,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44298245614035087 [2025-04-14 01:41:48,858 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 366 flow. Second operand 24 states and 202 transitions. [2025-04-14 01:41:48,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 166 transitions, 1381 flow [2025-04-14 01:41:48,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 166 transitions, 1301 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-14 01:41:48,865 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 634 flow [2025-04-14 01:41:48,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=634, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2025-04-14 01:41:48,865 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 61 predicate places. [2025-04-14 01:41:48,865 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 634 flow [2025-04-14 01:41:48,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 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:41:48,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:48,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:48,872 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:41:49,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:49,066 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:41:49,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1038410228, now seen corresponding path program 1 times [2025-04-14 01:41:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:49,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325506032] [2025-04-14 01:41:49,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:41:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:49,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:41:49,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:49,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:49,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:41:49,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:49,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325506032] [2025-04-14 01:41:49,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325506032] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:49,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882269156] [2025-04-14 01:41:49,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:41:49,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:49,183 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:41:49,184 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:41:49,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:41:49,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:49,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:41:49,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:49,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 01:41:49,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:49,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:41:49,381 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:41:49,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 104 [2025-04-14 01:41:49,439 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:41:49,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:49,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-14 01:41:49,930 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:41:49,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-04-14 01:41:49,947 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-04-14 01:41:49,974 INFO L325 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2025-04-14 01:41:49,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 164 [2025-04-14 01:41:50,126 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:41:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882269156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:50,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:50,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-04-14 01:41:50,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585030106] [2025-04-14 01:41:50,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:50,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:41:50,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:50,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:41:50,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:41:50,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:50,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 634 flow. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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:41:50,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:50,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:50,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:52,450 INFO L116 PetriNetUnfolderBase]: 285/586 cut-off events. [2025-04-14 01:41:52,450 INFO L117 PetriNetUnfolderBase]: For 2956/2956 co-relation queries the response was YES. [2025-04-14 01:41:52,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 586 events. 285/586 cut-off events. For 2956/2956 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2906 event pairs, 11 based on Foata normal form. 9/593 useless extension candidates. Maximal degree in co-relation 2662. Up to 189 conditions per place. [2025-04-14 01:41:52,453 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 105 selfloop transitions, 56 changer transitions 40/201 dead transitions. [2025-04-14 01:41:52,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 201 transitions, 1835 flow [2025-04-14 01:41:52,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:41:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:41:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 242 transitions. [2025-04-14 01:41:52,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41086587436332767 [2025-04-14 01:41:52,456 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 634 flow. Second operand 31 states and 242 transitions. [2025-04-14 01:41:52,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 201 transitions, 1835 flow [2025-04-14 01:41:52,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 201 transitions, 1594 flow, removed 90 selfloop flow, removed 10 redundant places. [2025-04-14 01:41:52,468 INFO L231 Difference]: Finished difference. Result has 108 places, 84 transitions, 916 flow [2025-04-14 01:41:52,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=916, PETRI_PLACES=108, PETRI_TRANSITIONS=84} [2025-04-14 01:41:52,468 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 88 predicate places. [2025-04-14 01:41:52,469 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 84 transitions, 916 flow [2025-04-14 01:41:52,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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:41:52,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:52,469 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:52,475 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:41:52,669 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,SelfDestructingSolverStorable8 [2025-04-14 01:41:52,669 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:41:52,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash -124124438, now seen corresponding path program 2 times [2025-04-14 01:41:52,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:52,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846660549] [2025-04-14 01:41:52,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:41:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:52,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:41:52,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:52,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:41:52,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:41:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:52,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846660549] [2025-04-14 01:41:52,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846660549] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:52,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527188349] [2025-04-14 01:41:52,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:41:52,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:52,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:52,795 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:41:52,795 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:41:52,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:41:52,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:52,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:41:52,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:52,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-14 01:41:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:52,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:41:53,049 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-14 01:41:53,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 104 [2025-04-14 01:41:53,121 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:41:53,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:53,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-04-14 01:41:53,811 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:41:53,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-04-14 01:41:54,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2025-04-14 01:41:54,603 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-14 01:41:54,603 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2025-04-14 01:41:54,650 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:41:54,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527188349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:54,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:54,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2025-04-14 01:41:54,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359782473] [2025-04-14 01:41:54,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:54,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:41:54,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:54,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:41:54,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:41:54,651 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:41:54,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 84 transitions, 916 flow. Second operand has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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:41:54,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:54,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:41:54,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:59,334 INFO L116 PetriNetUnfolderBase]: 282/598 cut-off events. [2025-04-14 01:41:59,334 INFO L117 PetriNetUnfolderBase]: For 3918/3918 co-relation queries the response was YES. [2025-04-14 01:41:59,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 598 events. 282/598 cut-off events. For 3918/3918 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3071 event pairs, 19 based on Foata normal form. 8/605 useless extension candidates. Maximal degree in co-relation 3274. Up to 300 conditions per place. [2025-04-14 01:41:59,338 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 103 selfloop transitions, 71 changer transitions 13/187 dead transitions. [2025-04-14 01:41:59,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 187 transitions, 1972 flow [2025-04-14 01:41:59,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:41:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:41:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 207 transitions. [2025-04-14 01:41:59,339 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3631578947368421 [2025-04-14 01:41:59,340 INFO L175 Difference]: Start difference. First operand has 108 places, 84 transitions, 916 flow. Second operand 30 states and 207 transitions. [2025-04-14 01:41:59,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 187 transitions, 1972 flow [2025-04-14 01:41:59,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 187 transitions, 1556 flow, removed 165 selfloop flow, removed 21 redundant places. [2025-04-14 01:41:59,354 INFO L231 Difference]: Finished difference. Result has 119 places, 108 transitions, 1071 flow [2025-04-14 01:41:59,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1071, PETRI_PLACES=119, PETRI_TRANSITIONS=108} [2025-04-14 01:41:59,354 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 99 predicate places. [2025-04-14 01:41:59,354 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 108 transitions, 1071 flow [2025-04-14 01:41:59,354 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2631578947368425) internal successors, (81), 19 states have internal predecessors, (81), 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:41:59,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:41:59,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:41:59,364 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:41:59,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:59,559 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:41:59,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:41:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1767247588, now seen corresponding path program 3 times [2025-04-14 01:41:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:41:59,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862467939] [2025-04-14 01:41:59,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:41:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:41:59,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:41:59,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:59,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:41:59,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:41:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:41:59,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862467939] [2025-04-14 01:41:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862467939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:41:59,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590602044] [2025-04-14 01:41:59,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:41:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:41:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:41:59,689 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:41:59,690 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:41:59,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:41:59,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:41:59,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:41:59,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:41:59,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:41:59,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:41:59,882 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:41:59,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:41:59,948 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:41:59,948 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 154 [2025-04-14 01:42:00,690 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:42:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590602044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:00,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:00,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-04-14 01:42:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484008751] [2025-04-14 01:42:00,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:00,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:42:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:42:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:42:00,692 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:00,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 108 transitions, 1071 flow. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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:42:00,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:00,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:00,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:00,980 INFO L116 PetriNetUnfolderBase]: 282/593 cut-off events. [2025-04-14 01:42:00,980 INFO L117 PetriNetUnfolderBase]: For 2514/2514 co-relation queries the response was YES. [2025-04-14 01:42:00,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2996 conditions, 593 events. 282/593 cut-off events. For 2514/2514 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2969 event pairs, 19 based on Foata normal form. 6/598 useless extension candidates. Maximal degree in co-relation 2873. Up to 226 conditions per place. [2025-04-14 01:42:00,984 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 81 selfloop transitions, 53 changer transitions 19/153 dead transitions. [2025-04-14 01:42:00,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 1642 flow [2025-04-14 01:42:00,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:42:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:42:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2025-04-14 01:42:00,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37894736842105264 [2025-04-14 01:42:00,985 INFO L175 Difference]: Start difference. First operand has 119 places, 108 transitions, 1071 flow. Second operand 15 states and 108 transitions. [2025-04-14 01:42:00,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 1642 flow [2025-04-14 01:42:00,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 153 transitions, 1542 flow, removed 18 selfloop flow, removed 14 redundant places. [2025-04-14 01:42:00,994 INFO L231 Difference]: Finished difference. Result has 120 places, 104 transitions, 1054 flow [2025-04-14 01:42:00,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1054, PETRI_PLACES=120, PETRI_TRANSITIONS=104} [2025-04-14 01:42:00,995 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 100 predicate places. [2025-04-14 01:42:00,995 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 104 transitions, 1054 flow [2025-04-14 01:42:00,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 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:42:00,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:00,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:01,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:42:01,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:01,202 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:42:01,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1853171772, now seen corresponding path program 4 times [2025-04-14 01:42:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:01,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396789361] [2025-04-14 01:42:01,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:01,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:01,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:42:01,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:42:01,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:01,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:01,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:01,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396789361] [2025-04-14 01:42:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396789361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:01,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445994135] [2025-04-14 01:42:01,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:01,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:01,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:01,428 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:42:01,430 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:42:01,474 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:42:01,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:42:01,490 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:01,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:01,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:42:01,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:01,666 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:42:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:01,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:01,985 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:01,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 158 treesize of output 127 [2025-04-14 01:42:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445994135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:02,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:02,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 18 [2025-04-14 01:42:02,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182887069] [2025-04-14 01:42:02,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:02,206 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:42:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:02,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:42:02,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:42:02,207 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:02,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 104 transitions, 1054 flow. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 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:42:02,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:02,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:02,712 INFO L116 PetriNetUnfolderBase]: 269/568 cut-off events. [2025-04-14 01:42:02,712 INFO L117 PetriNetUnfolderBase]: For 2564/2564 co-relation queries the response was YES. [2025-04-14 01:42:02,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2914 conditions, 568 events. 269/568 cut-off events. For 2564/2564 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2810 event pairs, 25 based on Foata normal form. 7/574 useless extension candidates. Maximal degree in co-relation 2851. Up to 378 conditions per place. [2025-04-14 01:42:02,715 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 75 selfloop transitions, 58 changer transitions 4/137 dead transitions. [2025-04-14 01:42:02,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 137 transitions, 1486 flow [2025-04-14 01:42:02,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:42:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:42:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 97 transitions. [2025-04-14 01:42:02,716 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39271255060728744 [2025-04-14 01:42:02,716 INFO L175 Difference]: Start difference. First operand has 120 places, 104 transitions, 1054 flow. Second operand 13 states and 97 transitions. [2025-04-14 01:42:02,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 137 transitions, 1486 flow [2025-04-14 01:42:02,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 1435 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-04-14 01:42:02,726 INFO L231 Difference]: Finished difference. Result has 123 places, 107 transitions, 1172 flow [2025-04-14 01:42:02,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1172, PETRI_PLACES=123, PETRI_TRANSITIONS=107} [2025-04-14 01:42:02,726 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 103 predicate places. [2025-04-14 01:42:02,726 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 107 transitions, 1172 flow [2025-04-14 01:42:02,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 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:42:02,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:02,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:02,732 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:42:02,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 01:42:02,927 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:42:02,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1849769832, now seen corresponding path program 5 times [2025-04-14 01:42:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:02,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302697254] [2025-04-14 01:42:02,928 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:42:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:02,933 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:42:02,942 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:42:02,942 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:02,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:03,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302697254] [2025-04-14 01:42:03,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302697254] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:03,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387583370] [2025-04-14 01:42:03,033 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:42:03,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:03,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:03,035 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:42:03,036 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:42:03,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-14 01:42:03,086 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:42:03,087 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:03,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:03,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:42:03,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:03,209 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:03,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 106 [2025-04-14 01:42:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:03,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:03,587 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:03,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 134 [2025-04-14 01:42:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:03,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387583370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:03,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 18 [2025-04-14 01:42:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668278500] [2025-04-14 01:42:03,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:03,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:42:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:03,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:42:03,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:42:03,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:03,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 107 transitions, 1172 flow. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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:42:03,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:03,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:03,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:04,347 INFO L116 PetriNetUnfolderBase]: 265/555 cut-off events. [2025-04-14 01:42:04,347 INFO L117 PetriNetUnfolderBase]: For 2884/2884 co-relation queries the response was YES. [2025-04-14 01:42:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3009 conditions, 555 events. 265/555 cut-off events. For 2884/2884 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2738 event pairs, 28 based on Foata normal form. 4/559 useless extension candidates. Maximal degree in co-relation 2865. Up to 378 conditions per place. [2025-04-14 01:42:04,350 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 72 selfloop transitions, 55 changer transitions 6/133 dead transitions. [2025-04-14 01:42:04,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 133 transitions, 1547 flow [2025-04-14 01:42:04,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:42:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:42:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2025-04-14 01:42:04,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3805668016194332 [2025-04-14 01:42:04,351 INFO L175 Difference]: Start difference. First operand has 123 places, 107 transitions, 1172 flow. Second operand 13 states and 94 transitions. [2025-04-14 01:42:04,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 133 transitions, 1547 flow [2025-04-14 01:42:04,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 133 transitions, 1408 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-04-14 01:42:04,361 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 1125 flow [2025-04-14 01:42:04,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1125, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2025-04-14 01:42:04,361 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 106 predicate places. [2025-04-14 01:42:04,361 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 1125 flow [2025-04-14 01:42:04,361 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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:42:04,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:04,361 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:04,367 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:42:04,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:04,566 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:42:04,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -126879595, now seen corresponding path program 2 times [2025-04-14 01:42:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:04,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034449952] [2025-04-14 01:42:04,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:04,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:04,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:04,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:04,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:04,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:04,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034449952] [2025-04-14 01:42:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034449952] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:04,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26636222] [2025-04-14 01:42:04,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:04,662 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:42:04,664 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:42:04,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:04,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:04,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:04,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:42:04,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:04,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:04,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26636222] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:04,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:04,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 01:42:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667220923] [2025-04-14 01:42:04,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:04,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:42:04,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:04,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:42:04,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:42:04,856 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:04,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 1125 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:42:04,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:04,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:04,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:05,287 INFO L116 PetriNetUnfolderBase]: 272/570 cut-off events. [2025-04-14 01:42:05,287 INFO L117 PetriNetUnfolderBase]: For 2876/2876 co-relation queries the response was YES. [2025-04-14 01:42:05,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3081 conditions, 570 events. 272/570 cut-off events. For 2876/2876 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2831 event pairs, 36 based on Foata normal form. 12/582 useless extension candidates. Maximal degree in co-relation 2876. Up to 149 conditions per place. [2025-04-14 01:42:05,291 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 96 selfloop transitions, 68 changer transitions 0/164 dead transitions. [2025-04-14 01:42:05,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 164 transitions, 1784 flow [2025-04-14 01:42:05,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:42:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:42:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2025-04-14 01:42:05,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3848684210526316 [2025-04-14 01:42:05,292 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 1125 flow. Second operand 16 states and 117 transitions. [2025-04-14 01:42:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 164 transitions, 1784 flow [2025-04-14 01:42:05,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 164 transitions, 1668 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-04-14 01:42:05,302 INFO L231 Difference]: Finished difference. Result has 133 places, 120 transitions, 1308 flow [2025-04-14 01:42:05,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1308, PETRI_PLACES=133, PETRI_TRANSITIONS=120} [2025-04-14 01:42:05,302 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 113 predicate places. [2025-04-14 01:42:05,302 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 120 transitions, 1308 flow [2025-04-14 01:42:05,303 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:42:05,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:05,303 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:05,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:42:05,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:05,507 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:42:05,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 553197257, now seen corresponding path program 6 times [2025-04-14 01:42:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:05,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461576087] [2025-04-14 01:42:05,507 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:05,516 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:05,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:05,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:42:05,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:05,769 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:42:05,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:05,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461576087] [2025-04-14 01:42:05,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461576087] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:05,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79712816] [2025-04-14 01:42:05,769 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:05,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:05,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:05,771 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:42:05,772 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:42:05,812 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:05,850 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:05,850 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:42:05,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:05,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:42:05,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:05,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:42:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:05,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:06,724 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2025-04-14 01:42:06,752 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:06,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 188 [2025-04-14 01:42:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79712816] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:07,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:07,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-04-14 01:42:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717291049] [2025-04-14 01:42:07,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:07,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:42:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:07,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:42:07,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:42:07,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:07,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 120 transitions, 1308 flow. Second operand has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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:42:07,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:07,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:07,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:08,242 INFO L116 PetriNetUnfolderBase]: 272/567 cut-off events. [2025-04-14 01:42:08,242 INFO L117 PetriNetUnfolderBase]: For 3318/3318 co-relation queries the response was YES. [2025-04-14 01:42:08,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3178 conditions, 567 events. 272/567 cut-off events. For 3318/3318 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2776 event pairs, 43 based on Foata normal form. 3/569 useless extension candidates. Maximal degree in co-relation 2992. Up to 449 conditions per place. [2025-04-14 01:42:08,245 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 96 selfloop transitions, 15 changer transitions 29/140 dead transitions. [2025-04-14 01:42:08,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 140 transitions, 1693 flow [2025-04-14 01:42:08,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:42:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:42:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 72 transitions. [2025-04-14 01:42:08,246 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37894736842105264 [2025-04-14 01:42:08,246 INFO L175 Difference]: Start difference. First operand has 133 places, 120 transitions, 1308 flow. Second operand 10 states and 72 transitions. [2025-04-14 01:42:08,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 140 transitions, 1693 flow [2025-04-14 01:42:08,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 1564 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-04-14 01:42:08,257 INFO L231 Difference]: Finished difference. Result has 139 places, 106 transitions, 1084 flow [2025-04-14 01:42:08,257 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1084, PETRI_PLACES=139, PETRI_TRANSITIONS=106} [2025-04-14 01:42:08,257 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 119 predicate places. [2025-04-14 01:42:08,257 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 106 transitions, 1084 flow [2025-04-14 01:42:08,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.176470588235294) internal successors, (71), 17 states have internal predecessors, (71), 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:42:08,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:08,257 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:08,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:42:08,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:42:08,458 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:42:08,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -970545191, now seen corresponding path program 7 times [2025-04-14 01:42:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:08,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801428015] [2025-04-14 01:42:08,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:42:08,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:08,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:42:08,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:08,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:08,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:08,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801428015] [2025-04-14 01:42:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801428015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:08,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831445612] [2025-04-14 01:42:08,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:42:08,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:08,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:08,591 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:42:08,592 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:42:08,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:42:08,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:08,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:08,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:42:08,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:08,773 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:42:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:08,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:09,134 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:09,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 63 [2025-04-14 01:42:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831445612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:09,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:09,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-14 01:42:09,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699884243] [2025-04-14 01:42:09,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:09,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:42:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:09,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:42:09,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:42:09,226 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:09,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 106 transitions, 1084 flow. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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:42:09,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:09,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:09,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:11,226 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:42:11,987 INFO L116 PetriNetUnfolderBase]: 267/544 cut-off events. [2025-04-14 01:42:11,988 INFO L117 PetriNetUnfolderBase]: For 2754/2754 co-relation queries the response was YES. [2025-04-14 01:42:11,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2975 conditions, 544 events. 267/544 cut-off events. For 2754/2754 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2698 event pairs, 5 based on Foata normal form. 3/546 useless extension candidates. Maximal degree in co-relation 2906. Up to 190 conditions per place. [2025-04-14 01:42:11,991 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 96 selfloop transitions, 68 changer transitions 10/174 dead transitions. [2025-04-14 01:42:11,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 174 transitions, 1814 flow [2025-04-14 01:42:11,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 01:42:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 01:42:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 150 transitions. [2025-04-14 01:42:11,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-14 01:42:11,992 INFO L175 Difference]: Start difference. First operand has 139 places, 106 transitions, 1084 flow. Second operand 18 states and 150 transitions. [2025-04-14 01:42:11,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 174 transitions, 1814 flow [2025-04-14 01:42:12,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 174 transitions, 1743 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-04-14 01:42:12,003 INFO L231 Difference]: Finished difference. Result has 136 places, 116 transitions, 1313 flow [2025-04-14 01:42:12,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1313, PETRI_PLACES=136, PETRI_TRANSITIONS=116} [2025-04-14 01:42:12,003 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 116 predicate places. [2025-04-14 01:42:12,004 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 116 transitions, 1313 flow [2025-04-14 01:42:12,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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:42:12,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:12,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:12,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 01:42:12,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:42:12,204 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:42:12,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:12,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2117715977, now seen corresponding path program 8 times [2025-04-14 01:42:12,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:12,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171003623] [2025-04-14 01:42:12,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:12,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:12,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:12,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:12,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:12,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:12,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171003623] [2025-04-14 01:42:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171003623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:12,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106847688] [2025-04-14 01:42:12,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:12,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:12,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:12,349 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:42:12,349 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:42:12,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:12,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:12,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:12,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:12,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:42:12,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:12,543 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:12,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 109 [2025-04-14 01:42:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:12,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:12,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:12,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 63 [2025-04-14 01:42:12,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:12,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106847688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:12,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:12,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 18 [2025-04-14 01:42:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805036134] [2025-04-14 01:42:12,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:12,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:42:12,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:12,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:42:12,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:42:12,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:12,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 116 transitions, 1313 flow. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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:42:12,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:12,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:13,610 INFO L116 PetriNetUnfolderBase]: 262/530 cut-off events. [2025-04-14 01:42:13,610 INFO L117 PetriNetUnfolderBase]: For 2965/2965 co-relation queries the response was YES. [2025-04-14 01:42:13,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 530 events. 262/530 cut-off events. For 2965/2965 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2577 event pairs, 5 based on Foata normal form. 2/531 useless extension candidates. Maximal degree in co-relation 3073. Up to 190 conditions per place. [2025-04-14 01:42:13,613 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 88 selfloop transitions, 66 changer transitions 6/160 dead transitions. [2025-04-14 01:42:13,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 160 transitions, 1832 flow [2025-04-14 01:42:13,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:42:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:42:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-14 01:42:13,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-14 01:42:13,614 INFO L175 Difference]: Start difference. First operand has 136 places, 116 transitions, 1313 flow. Second operand 15 states and 125 transitions. [2025-04-14 01:42:13,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 160 transitions, 1832 flow [2025-04-14 01:42:13,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 160 transitions, 1761 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-14 01:42:13,626 INFO L231 Difference]: Finished difference. Result has 144 places, 115 transitions, 1365 flow [2025-04-14 01:42:13,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1365, PETRI_PLACES=144, PETRI_TRANSITIONS=115} [2025-04-14 01:42:13,627 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 124 predicate places. [2025-04-14 01:42:13,627 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 115 transitions, 1365 flow [2025-04-14 01:42:13,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 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:42:13,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:13,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:13,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 01:42:13,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:42:13,832 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:42:13,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:13,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1235259899, now seen corresponding path program 9 times [2025-04-14 01:42:13,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:13,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715260992] [2025-04-14 01:42:13,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:13,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:13,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:13,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:13,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:42:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:13,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715260992] [2025-04-14 01:42:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715260992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:13,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943232347] [2025-04-14 01:42:13,914 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:13,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:13,916 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:42:13,917 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:42:13,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:13,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:13,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:42:13,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:13,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:42:13,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:14,120 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:14,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2025-04-14 01:42:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:14,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:14,236 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:14,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 154 [2025-04-14 01:42:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943232347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:18,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:18,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-04-14 01:42:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616238274] [2025-04-14 01:42:18,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:18,880 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:42:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:18,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:42:18,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:42:18,880 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:18,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 115 transitions, 1365 flow. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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:42:18,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:18,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:18,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:19,331 INFO L116 PetriNetUnfolderBase]: 263/530 cut-off events. [2025-04-14 01:42:19,331 INFO L117 PetriNetUnfolderBase]: For 3369/3369 co-relation queries the response was YES. [2025-04-14 01:42:19,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 530 events. 263/530 cut-off events. For 3369/3369 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2563 event pairs, 21 based on Foata normal form. 5/535 useless extension candidates. Maximal degree in co-relation 3229. Up to 377 conditions per place. [2025-04-14 01:42:19,335 INFO L140 encePairwiseOnDemand]: 10/19 looper letters, 109 selfloop transitions, 43 changer transitions 3/155 dead transitions. [2025-04-14 01:42:19,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 155 transitions, 1875 flow [2025-04-14 01:42:19,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:42:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:42:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 119 transitions. [2025-04-14 01:42:19,336 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-04-14 01:42:19,336 INFO L175 Difference]: Start difference. First operand has 144 places, 115 transitions, 1365 flow. Second operand 17 states and 119 transitions. [2025-04-14 01:42:19,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 155 transitions, 1875 flow [2025-04-14 01:42:19,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 155 transitions, 1733 flow, removed 3 selfloop flow, removed 14 redundant places. [2025-04-14 01:42:19,347 INFO L231 Difference]: Finished difference. Result has 150 places, 121 transitions, 1407 flow [2025-04-14 01:42:19,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1407, PETRI_PLACES=150, PETRI_TRANSITIONS=121} [2025-04-14 01:42:19,347 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 130 predicate places. [2025-04-14 01:42:19,347 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 121 transitions, 1407 flow [2025-04-14 01:42:19,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 17 states have internal predecessors, (69), 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:42:19,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:19,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:19,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-14 01:42:19,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 01:42:19,548 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:42:19,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1341381207, now seen corresponding path program 3 times [2025-04-14 01:42:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:19,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927117121] [2025-04-14 01:42:19,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:19,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:19,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:19,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:42:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:19,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927117121] [2025-04-14 01:42:19,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927117121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:19,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366215983] [2025-04-14 01:42:19,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:19,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:19,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:19,636 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:42:19,638 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:42:19,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:19,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:19,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:42:19,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:19,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:42:19,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:19,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:19,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366215983] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:19,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:42:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251650716] [2025-04-14 01:42:19,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:19,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:42:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:19,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:42:19,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:42:19,836 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:19,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 121 transitions, 1407 flow. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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:42:19,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:19,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:19,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:20,300 INFO L116 PetriNetUnfolderBase]: 278/559 cut-off events. [2025-04-14 01:42:20,300 INFO L117 PetriNetUnfolderBase]: For 3568/3568 co-relation queries the response was YES. [2025-04-14 01:42:20,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3421 conditions, 559 events. 278/559 cut-off events. For 3568/3568 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2791 event pairs, 37 based on Foata normal form. 12/571 useless extension candidates. Maximal degree in co-relation 3344. Up to 159 conditions per place. [2025-04-14 01:42:20,304 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 98 selfloop transitions, 75 changer transitions 0/173 dead transitions. [2025-04-14 01:42:20,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 173 transitions, 2039 flow [2025-04-14 01:42:20,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:42:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:42:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 133 transitions. [2025-04-14 01:42:20,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-04-14 01:42:20,305 INFO L175 Difference]: Start difference. First operand has 150 places, 121 transitions, 1407 flow. Second operand 17 states and 133 transitions. [2025-04-14 01:42:20,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 173 transitions, 2039 flow [2025-04-14 01:42:20,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 173 transitions, 1920 flow, removed 24 selfloop flow, removed 11 redundant places. [2025-04-14 01:42:20,317 INFO L231 Difference]: Finished difference. Result has 156 places, 131 transitions, 1595 flow [2025-04-14 01:42:20,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1277, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1595, PETRI_PLACES=156, PETRI_TRANSITIONS=131} [2025-04-14 01:42:20,317 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 136 predicate places. [2025-04-14 01:42:20,317 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 131 transitions, 1595 flow [2025-04-14 01:42:20,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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:42:20,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:20,318 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:20,323 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:42:20,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:20,518 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:42:20,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1261118487, now seen corresponding path program 4 times [2025-04-14 01:42:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:20,519 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125227579] [2025-04-14 01:42:20,519 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:20,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:20,523 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:20,532 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:20,532 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:20,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:20,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125227579] [2025-04-14 01:42:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125227579] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:20,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446194492] [2025-04-14 01:42:20,633 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:20,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:20,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:20,635 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:42:20,636 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:42:20,679 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:20,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:20,813 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:20,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:20,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:42:20,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:20,852 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446194492] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:20,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 01:42:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777035800] [2025-04-14 01:42:20,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:20,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:42:20,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:20,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:42:20,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:42:20,919 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:20,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 131 transitions, 1595 flow. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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:42:20,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:20,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:20,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:22,016 INFO L116 PetriNetUnfolderBase]: 326/634 cut-off events. [2025-04-14 01:42:22,016 INFO L117 PetriNetUnfolderBase]: For 4600/4600 co-relation queries the response was YES. [2025-04-14 01:42:22,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4035 conditions, 634 events. 326/634 cut-off events. For 4600/4600 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3137 event pairs, 67 based on Foata normal form. 8/641 useless extension candidates. Maximal degree in co-relation 3961. Up to 286 conditions per place. [2025-04-14 01:42:22,021 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 112 selfloop transitions, 77 changer transitions 0/189 dead transitions. [2025-04-14 01:42:22,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 189 transitions, 2366 flow [2025-04-14 01:42:22,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:42:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:42:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2025-04-14 01:42:22,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4309210526315789 [2025-04-14 01:42:22,022 INFO L175 Difference]: Start difference. First operand has 156 places, 131 transitions, 1595 flow. Second operand 16 states and 131 transitions. [2025-04-14 01:42:22,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 189 transitions, 2366 flow [2025-04-14 01:42:22,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 189 transitions, 2078 flow, removed 100 selfloop flow, removed 13 redundant places. [2025-04-14 01:42:22,036 INFO L231 Difference]: Finished difference. Result has 159 places, 148 transitions, 1721 flow [2025-04-14 01:42:22,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1721, PETRI_PLACES=159, PETRI_TRANSITIONS=148} [2025-04-14 01:42:22,037 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 139 predicate places. [2025-04-14 01:42:22,037 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 148 transitions, 1721 flow [2025-04-14 01:42:22,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 11 states have internal predecessors, (44), 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:42:22,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:22,037 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:22,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-14 01:42:22,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-14 01:42:22,241 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:42:22,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1234528161, now seen corresponding path program 5 times [2025-04-14 01:42:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:22,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259997113] [2025-04-14 01:42:22,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:42:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:22,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:22,252 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:22,252 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:22,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:22,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259997113] [2025-04-14 01:42:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259997113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:22,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183683589] [2025-04-14 01:42:22,317 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:42:22,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:22,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:22,320 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:42:22,321 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:42:22,366 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:22,386 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:22,386 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:22,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:22,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:42:22,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:22,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:22,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183683589] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:22,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-14 01:42:22,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743253540] [2025-04-14 01:42:22,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:22,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:42:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:22,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:42:22,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:42:22,494 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:22,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 148 transitions, 1721 flow. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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:42:22,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:22,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:23,268 INFO L116 PetriNetUnfolderBase]: 403/756 cut-off events. [2025-04-14 01:42:23,268 INFO L117 PetriNetUnfolderBase]: For 4090/4090 co-relation queries the response was YES. [2025-04-14 01:42:23,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 756 events. 403/756 cut-off events. For 4090/4090 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3791 event pairs, 55 based on Foata normal form. 15/770 useless extension candidates. Maximal degree in co-relation 4339. Up to 252 conditions per place. [2025-04-14 01:42:23,273 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 119 selfloop transitions, 96 changer transitions 0/215 dead transitions. [2025-04-14 01:42:23,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 215 transitions, 2696 flow [2025-04-14 01:42:23,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:42:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:42:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 116 transitions. [2025-04-14 01:42:23,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2025-04-14 01:42:23,274 INFO L175 Difference]: Start difference. First operand has 159 places, 148 transitions, 1721 flow. Second operand 16 states and 116 transitions. [2025-04-14 01:42:23,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 215 transitions, 2696 flow [2025-04-14 01:42:23,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 215 transitions, 2562 flow, removed 43 selfloop flow, removed 6 redundant places. [2025-04-14 01:42:23,288 INFO L231 Difference]: Finished difference. Result has 170 places, 175 transitions, 2136 flow [2025-04-14 01:42:23,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1630, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2136, PETRI_PLACES=170, PETRI_TRANSITIONS=175} [2025-04-14 01:42:23,289 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 150 predicate places. [2025-04-14 01:42:23,289 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 175 transitions, 2136 flow [2025-04-14 01:42:23,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 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:42:23,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:23,289 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:23,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 01:42:23,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:23,490 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:42:23,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 445332299, now seen corresponding path program 6 times [2025-04-14 01:42:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:23,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544918371] [2025-04-14 01:42:23,490 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:23,494 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:23,501 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:23,501 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:42:23,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:23,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:23,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544918371] [2025-04-14 01:42:23,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544918371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:23,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714811650] [2025-04-14 01:42:23,588 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:23,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:23,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:23,590 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:42:23,591 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:42:23,632 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:23,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:23,666 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:42:23,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:23,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:42:23,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:23,705 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714811650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:23,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 01:42:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588144425] [2025-04-14 01:42:23,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:23,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:42:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:23,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:42:23,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:42:23,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:23,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 175 transitions, 2136 flow. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:42:23,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:23,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:23,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:24,321 INFO L116 PetriNetUnfolderBase]: 586/1117 cut-off events. [2025-04-14 01:42:24,321 INFO L117 PetriNetUnfolderBase]: For 7215/7215 co-relation queries the response was YES. [2025-04-14 01:42:24,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6753 conditions, 1117 events. 586/1117 cut-off events. For 7215/7215 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6267 event pairs, 29 based on Foata normal form. 6/1122 useless extension candidates. Maximal degree in co-relation 6680. Up to 339 conditions per place. [2025-04-14 01:42:24,329 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 160 selfloop transitions, 145 changer transitions 0/305 dead transitions. [2025-04-14 01:42:24,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 305 transitions, 4118 flow [2025-04-14 01:42:24,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:42:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:42:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2025-04-14 01:42:24,330 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-04-14 01:42:24,330 INFO L175 Difference]: Start difference. First operand has 170 places, 175 transitions, 2136 flow. Second operand 15 states and 135 transitions. [2025-04-14 01:42:24,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 305 transitions, 4118 flow [2025-04-14 01:42:24,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 305 transitions, 3937 flow, removed 65 selfloop flow, removed 5 redundant places. [2025-04-14 01:42:24,356 INFO L231 Difference]: Finished difference. Result has 187 places, 233 transitions, 3269 flow [2025-04-14 01:42:24,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1997, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3269, PETRI_PLACES=187, PETRI_TRANSITIONS=233} [2025-04-14 01:42:24,357 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 167 predicate places. [2025-04-14 01:42:24,357 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 233 transitions, 3269 flow [2025-04-14 01:42:24,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:42:24,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:24,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:24,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 01:42:24,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:24,558 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:42:24,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 441930359, now seen corresponding path program 7 times [2025-04-14 01:42:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:24,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939121365] [2025-04-14 01:42:24,558 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:42:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:24,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:42:24,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:24,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:24,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:24,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:24,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939121365] [2025-04-14 01:42:24,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939121365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:24,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244527202] [2025-04-14 01:42:24,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:42:24,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:24,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:24,661 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:42:24,661 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:42:24,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:42:24,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:24,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:24,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:24,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:42:24,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:24,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:24,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:24,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244527202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:24,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:24,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-14 01:42:24,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655108742] [2025-04-14 01:42:24,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:24,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:42:24,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:24,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:42:24,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:42:24,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:24,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 233 transitions, 3269 flow. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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:42:24,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:24,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:24,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:25,770 INFO L116 PetriNetUnfolderBase]: 577/1093 cut-off events. [2025-04-14 01:42:25,770 INFO L117 PetriNetUnfolderBase]: For 9128/9128 co-relation queries the response was YES. [2025-04-14 01:42:25,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 1093 events. 577/1093 cut-off events. For 9128/9128 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6058 event pairs, 33 based on Foata normal form. 12/1104 useless extension candidates. Maximal degree in co-relation 7136. Up to 339 conditions per place. [2025-04-14 01:42:25,777 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 148 selfloop transitions, 149 changer transitions 0/297 dead transitions. [2025-04-14 01:42:25,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 297 transitions, 4428 flow [2025-04-14 01:42:25,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:42:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:42:25,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 135 transitions. [2025-04-14 01:42:25,778 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4179566563467492 [2025-04-14 01:42:25,778 INFO L175 Difference]: Start difference. First operand has 187 places, 233 transitions, 3269 flow. Second operand 17 states and 135 transitions. [2025-04-14 01:42:25,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 297 transitions, 4428 flow [2025-04-14 01:42:25,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 297 transitions, 4218 flow, removed 61 selfloop flow, removed 4 redundant places. [2025-04-14 01:42:25,812 INFO L231 Difference]: Finished difference. Result has 203 places, 238 transitions, 3475 flow [2025-04-14 01:42:25,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3014, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3475, PETRI_PLACES=203, PETRI_TRANSITIONS=238} [2025-04-14 01:42:25,813 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 183 predicate places. [2025-04-14 01:42:25,813 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 238 transitions, 3475 flow [2025-04-14 01:42:25,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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:42:25,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:25,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:25,819 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:42:26,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 01:42:26,017 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:42:26,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1304801475, now seen corresponding path program 8 times [2025-04-14 01:42:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:26,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561381384] [2025-04-14 01:42:26,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:26,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:26,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:26,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:26,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:26,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561381384] [2025-04-14 01:42:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561381384] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:26,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896498797] [2025-04-14 01:42:26,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:26,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:26,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:26,110 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:42:26,111 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:42:26,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:26,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:26,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:26,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:26,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:42:26,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:26,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896498797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:26,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:42:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156754124] [2025-04-14 01:42:26,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:26,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:42:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:26,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:42:26,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:42:26,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:26,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 238 transitions, 3475 flow. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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:42:26,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:26,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:26,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:27,445 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:42:27,820 INFO L116 PetriNetUnfolderBase]: 637/1205 cut-off events. [2025-04-14 01:42:27,820 INFO L117 PetriNetUnfolderBase]: For 10894/10894 co-relation queries the response was YES. [2025-04-14 01:42:27,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8242 conditions, 1205 events. 637/1205 cut-off events. For 10894/10894 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6801 event pairs, 136 based on Foata normal form. 10/1214 useless extension candidates. Maximal degree in co-relation 8157. Up to 658 conditions per place. [2025-04-14 01:42:27,827 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 184 selfloop transitions, 120 changer transitions 0/304 dead transitions. [2025-04-14 01:42:27,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 304 transitions, 4759 flow [2025-04-14 01:42:27,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:42:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:42:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 115 transitions. [2025-04-14 01:42:27,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4323308270676692 [2025-04-14 01:42:27,828 INFO L175 Difference]: Start difference. First operand has 203 places, 238 transitions, 3475 flow. Second operand 14 states and 115 transitions. [2025-04-14 01:42:27,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 304 transitions, 4759 flow [2025-04-14 01:42:27,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 304 transitions, 4414 flow, removed 31 selfloop flow, removed 10 redundant places. [2025-04-14 01:42:27,868 INFO L231 Difference]: Finished difference. Result has 212 places, 261 transitions, 3919 flow [2025-04-14 01:42:27,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3919, PETRI_PLACES=212, PETRI_TRANSITIONS=261} [2025-04-14 01:42:27,869 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 192 predicate places. [2025-04-14 01:42:27,869 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 261 transitions, 3919 flow [2025-04-14 01:42:27,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 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:42:27,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:27,869 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:27,875 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:42:28,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:28,070 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:42:28,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1073417953, now seen corresponding path program 9 times [2025-04-14 01:42:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:28,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137771976] [2025-04-14 01:42:28,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:28,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:28,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:28,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:42:28,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:28,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:28,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137771976] [2025-04-14 01:42:28,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137771976] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:28,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878733243] [2025-04-14 01:42:28,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:28,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:28,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:28,210 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:42:28,211 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:42:28,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:28,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:28,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:42:28,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:28,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:42:28,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:28,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:28,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878733243] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:28,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:28,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:42:28,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479326407] [2025-04-14 01:42:28,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:28,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:42:28,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:28,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:42:28,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:42:28,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:28,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 261 transitions, 3919 flow. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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:42:28,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:28,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:28,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:28,848 INFO L116 PetriNetUnfolderBase]: 634/1187 cut-off events. [2025-04-14 01:42:28,849 INFO L117 PetriNetUnfolderBase]: For 10686/10686 co-relation queries the response was YES. [2025-04-14 01:42:28,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8254 conditions, 1187 events. 634/1187 cut-off events. For 10686/10686 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6615 event pairs, 37 based on Foata normal form. 6/1192 useless extension candidates. Maximal degree in co-relation 8163. Up to 364 conditions per place. [2025-04-14 01:42:28,855 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 157 selfloop transitions, 159 changer transitions 0/316 dead transitions. [2025-04-14 01:42:28,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 316 transitions, 5038 flow [2025-04-14 01:42:28,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:42:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:42:28,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 125 transitions. [2025-04-14 01:42:28,856 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-04-14 01:42:28,856 INFO L175 Difference]: Start difference. First operand has 212 places, 261 transitions, 3919 flow. Second operand 15 states and 125 transitions. [2025-04-14 01:42:28,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 316 transitions, 5038 flow [2025-04-14 01:42:28,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 316 transitions, 4879 flow, removed 50 selfloop flow, removed 6 redundant places. [2025-04-14 01:42:28,900 INFO L231 Difference]: Finished difference. Result has 222 places, 266 transitions, 4199 flow [2025-04-14 01:42:28,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=3744, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4199, PETRI_PLACES=222, PETRI_TRANSITIONS=266} [2025-04-14 01:42:28,901 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 202 predicate places. [2025-04-14 01:42:28,901 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 266 transitions, 4199 flow [2025-04-14 01:42:28,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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:42:28,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:28,901 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:28,907 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:42:29,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:29,101 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:42:29,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1330660063, now seen corresponding path program 10 times [2025-04-14 01:42:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:29,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676904043] [2025-04-14 01:42:29,102 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:29,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:29,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:29,111 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:29,112 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:29,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:29,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:29,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676904043] [2025-04-14 01:42:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676904043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:29,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858968956] [2025-04-14 01:42:29,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:29,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:29,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:29,270 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:42:29,272 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:42:29,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:29,335 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:29,336 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:29,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:29,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:42:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:29,522 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:29,522 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2025-04-14 01:42:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:29,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:29,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:29,698 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 154 [2025-04-14 01:42:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858968956] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:30,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:30,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-14 01:42:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853325277] [2025-04-14 01:42:30,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:30,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:42:30,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:30,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:42:30,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:42:30,017 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:30,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 266 transitions, 4199 flow. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 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:42:30,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:30,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:30,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:30,527 INFO L116 PetriNetUnfolderBase]: 693/1320 cut-off events. [2025-04-14 01:42:30,528 INFO L117 PetriNetUnfolderBase]: For 12948/12948 co-relation queries the response was YES. [2025-04-14 01:42:30,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9402 conditions, 1320 events. 693/1320 cut-off events. For 12948/12948 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7575 event pairs, 3 based on Foata normal form. 3/1322 useless extension candidates. Maximal degree in co-relation 9310. Up to 914 conditions per place. [2025-04-14 01:42:30,535 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 200 selfloop transitions, 136 changer transitions 8/344 dead transitions. [2025-04-14 01:42:30,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 344 transitions, 5799 flow [2025-04-14 01:42:30,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:42:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:42:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 105 transitions. [2025-04-14 01:42:30,536 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-04-14 01:42:30,536 INFO L175 Difference]: Start difference. First operand has 222 places, 266 transitions, 4199 flow. Second operand 15 states and 105 transitions. [2025-04-14 01:42:30,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 344 transitions, 5799 flow [2025-04-14 01:42:30,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 344 transitions, 5616 flow, removed 33 selfloop flow, removed 5 redundant places. [2025-04-14 01:42:30,591 INFO L231 Difference]: Finished difference. Result has 234 places, 311 transitions, 5147 flow [2025-04-14 01:42:30,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4050, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5147, PETRI_PLACES=234, PETRI_TRANSITIONS=311} [2025-04-14 01:42:30,592 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 214 predicate places. [2025-04-14 01:42:30,592 INFO L485 AbstractCegarLoop]: Abstraction has has 234 places, 311 transitions, 5147 flow [2025-04-14 01:42:30,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 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:42:30,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:30,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:30,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 01:42:30,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:30,796 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:42:30,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1301399535, now seen corresponding path program 10 times [2025-04-14 01:42:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:30,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144285047] [2025-04-14 01:42:30,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:30,801 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:30,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:30,807 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:30,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:30,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:30,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144285047] [2025-04-14 01:42:30,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144285047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:30,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61961758] [2025-04-14 01:42:30,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:42:30,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:30,905 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:42:30,906 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:42:30,957 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-14 01:42:30,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:42:30,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:42:30,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:30,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:42:30,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:31,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61961758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:31,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-14 01:42:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437556818] [2025-04-14 01:42:31,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:31,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:42:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:31,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:42:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:42:31,099 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:31,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 311 transitions, 5147 flow. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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:42:31,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:31,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:31,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:31,734 INFO L116 PetriNetUnfolderBase]: 668/1265 cut-off events. [2025-04-14 01:42:31,734 INFO L117 PetriNetUnfolderBase]: For 14201/14201 co-relation queries the response was YES. [2025-04-14 01:42:31,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9572 conditions, 1265 events. 668/1265 cut-off events. For 14201/14201 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7136 event pairs, 133 based on Foata normal form. 18/1282 useless extension candidates. Maximal degree in co-relation 9477. Up to 752 conditions per place. [2025-04-14 01:42:31,742 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 206 selfloop transitions, 141 changer transitions 0/347 dead transitions. [2025-04-14 01:42:31,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 347 transitions, 5991 flow [2025-04-14 01:42:31,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 01:42:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 01:42:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 128 transitions. [2025-04-14 01:42:31,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3742690058479532 [2025-04-14 01:42:31,745 INFO L175 Difference]: Start difference. First operand has 234 places, 311 transitions, 5147 flow. Second operand 18 states and 128 transitions. [2025-04-14 01:42:31,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 347 transitions, 5991 flow [2025-04-14 01:42:31,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 347 transitions, 5821 flow, removed 56 selfloop flow, removed 13 redundant places. [2025-04-14 01:42:31,833 INFO L231 Difference]: Finished difference. Result has 239 places, 310 transitions, 5289 flow [2025-04-14 01:42:31,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=4865, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5289, PETRI_PLACES=239, PETRI_TRANSITIONS=310} [2025-04-14 01:42:31,834 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 219 predicate places. [2025-04-14 01:42:31,834 INFO L485 AbstractCegarLoop]: Abstraction has has 239 places, 310 transitions, 5289 flow [2025-04-14 01:42:31,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 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:42:31,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:31,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:42:31,840 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:42:32,034 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,SelfDestructingSolverStorable26 [2025-04-14 01:42:32,035 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:32,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1145722064, now seen corresponding path program 1 times [2025-04-14 01:42:32,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:32,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559619424] [2025-04-14 01:42:32,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:42:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:32,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:42:32,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:32,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:32,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:32,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:32,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559619424] [2025-04-14 01:42:32,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559619424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:32,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618238811] [2025-04-14 01:42:32,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:42:32,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:32,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:32,173 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:42:32,174 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:42:32,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:42:32,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:32,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:42:32,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:32,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:42:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:32,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:32,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618238811] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:32,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:32,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-14 01:42:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009475150] [2025-04-14 01:42:32,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:32,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:42:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:32,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:42:32,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:42:32,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:32,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 310 transitions, 5289 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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:42:32,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:32,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:32,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:33,938 INFO L116 PetriNetUnfolderBase]: 890/1729 cut-off events. [2025-04-14 01:42:33,939 INFO L117 PetriNetUnfolderBase]: For 18802/18802 co-relation queries the response was YES. [2025-04-14 01:42:33,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12759 conditions, 1729 events. 890/1729 cut-off events. For 18802/18802 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10705 event pairs, 68 based on Foata normal form. 33/1761 useless extension candidates. Maximal degree in co-relation 12667. Up to 477 conditions per place. [2025-04-14 01:42:33,948 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 227 selfloop transitions, 245 changer transitions 0/472 dead transitions. [2025-04-14 01:42:33,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 472 transitions, 7838 flow [2025-04-14 01:42:33,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:42:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:42:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 239 transitions. [2025-04-14 01:42:33,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4057724957555178 [2025-04-14 01:42:33,949 INFO L175 Difference]: Start difference. First operand has 239 places, 310 transitions, 5289 flow. Second operand 31 states and 239 transitions. [2025-04-14 01:42:33,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 472 transitions, 7838 flow [2025-04-14 01:42:34,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 472 transitions, 7610 flow, removed 28 selfloop flow, removed 11 redundant places. [2025-04-14 01:42:34,024 INFO L231 Difference]: Finished difference. Result has 270 places, 382 transitions, 7115 flow [2025-04-14 01:42:34,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=5046, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=7115, PETRI_PLACES=270, PETRI_TRANSITIONS=382} [2025-04-14 01:42:34,025 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 250 predicate places. [2025-04-14 01:42:34,025 INFO L485 AbstractCegarLoop]: Abstraction has has 270 places, 382 transitions, 7115 flow [2025-04-14 01:42:34,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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:42:34,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:34,025 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:34,030 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:42:34,225 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,SelfDestructingSolverStorable27 [2025-04-14 01:42:34,225 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:34,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1225313246, now seen corresponding path program 11 times [2025-04-14 01:42:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:34,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994241380] [2025-04-14 01:42:34,226 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:42:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:34,230 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:42:34,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:34,250 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:34,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:34,915 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:42:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:34,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994241380] [2025-04-14 01:42:34,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994241380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:34,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414185832] [2025-04-14 01:42:34,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:42:34,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:34,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:34,917 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:42:34,918 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:42:34,963 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:42:34,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:34,982 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:34,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:34,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:42:34,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:35,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:35,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2025-04-14 01:42:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:35,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:35,696 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-14 01:42:35,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 118 [2025-04-14 01:42:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:35,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414185832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:35,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:35,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 21 [2025-04-14 01:42:35,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128799724] [2025-04-14 01:42:35,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:35,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:42:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:35,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:42:35,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:42:35,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:35,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 382 transitions, 7115 flow. Second operand has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 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:42:35,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:35,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:35,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:38,512 INFO L116 PetriNetUnfolderBase]: 981/1957 cut-off events. [2025-04-14 01:42:38,513 INFO L117 PetriNetUnfolderBase]: For 24822/24822 co-relation queries the response was YES. [2025-04-14 01:42:38,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15740 conditions, 1957 events. 981/1957 cut-off events. For 24822/24822 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12563 event pairs, 20 based on Foata normal form. 1/1956 useless extension candidates. Maximal degree in co-relation 15546. Up to 1179 conditions per place. [2025-04-14 01:42:38,524 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 314 selfloop transitions, 176 changer transitions 4/494 dead transitions. [2025-04-14 01:42:38,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 494 transitions, 9368 flow [2025-04-14 01:42:38,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:42:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:42:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 193 transitions. [2025-04-14 01:42:38,525 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36278195488721804 [2025-04-14 01:42:38,525 INFO L175 Difference]: Start difference. First operand has 270 places, 382 transitions, 7115 flow. Second operand 28 states and 193 transitions. [2025-04-14 01:42:38,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 494 transitions, 9368 flow [2025-04-14 01:42:38,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 494 transitions, 8937 flow, removed 152 selfloop flow, removed 9 redundant places. [2025-04-14 01:42:38,647 INFO L231 Difference]: Finished difference. Result has 296 places, 435 transitions, 8209 flow [2025-04-14 01:42:38,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=6717, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=8209, PETRI_PLACES=296, PETRI_TRANSITIONS=435} [2025-04-14 01:42:38,648 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 276 predicate places. [2025-04-14 01:42:38,648 INFO L485 AbstractCegarLoop]: Abstraction has has 296 places, 435 transitions, 8209 flow [2025-04-14 01:42:38,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.8260869565217392) internal successors, (88), 23 states have internal predecessors, (88), 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:42:38,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:38,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:38,654 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:42:38,849 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 01:42:38,849 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:38,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:38,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2080619900, now seen corresponding path program 12 times [2025-04-14 01:42:38,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:38,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499644160] [2025-04-14 01:42:38,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:38,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:38,855 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:42:38,867 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:38,867 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:42:38,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:39,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:39,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499644160] [2025-04-14 01:42:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499644160] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:39,034 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463848625] [2025-04-14 01:42:39,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:42:39,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:39,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:39,036 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:42:39,037 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:42:39,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:42:39,151 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:39,151 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:42:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:39,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 01:42:39,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:39,262 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:39,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 23 [2025-04-14 01:42:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:42:39,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:39,764 INFO L325 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-04-14 01:42:39,764 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 77 [2025-04-14 01:42:39,800 INFO L325 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-04-14 01:42:39,800 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 39 [2025-04-14 01:42:39,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:42:39,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2025-04-14 01:42:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463848625] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:39,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 12 [2025-04-14 01:42:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906838618] [2025-04-14 01:42:39,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:39,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:42:39,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:39,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:42:39,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:42:39,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:39,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 435 transitions, 8209 flow. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 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:42:39,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:39,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:39,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:42:40,318 INFO L116 PetriNetUnfolderBase]: 982/1960 cut-off events. [2025-04-14 01:42:40,318 INFO L117 PetriNetUnfolderBase]: For 27481/27481 co-relation queries the response was YES. [2025-04-14 01:42:40,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15784 conditions, 1960 events. 982/1960 cut-off events. For 27481/27481 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12553 event pairs, 83 based on Foata normal form. 1/1960 useless extension candidates. Maximal degree in co-relation 15580. Up to 1824 conditions per place. [2025-04-14 01:42:40,334 INFO L140 encePairwiseOnDemand]: 11/19 looper letters, 395 selfloop transitions, 50 changer transitions 3/448 dead transitions. [2025-04-14 01:42:40,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 448 transitions, 9176 flow [2025-04-14 01:42:40,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:42:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:42:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2025-04-14 01:42:40,336 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3742690058479532 [2025-04-14 01:42:40,336 INFO L175 Difference]: Start difference. First operand has 296 places, 435 transitions, 8209 flow. Second operand 9 states and 64 transitions. [2025-04-14 01:42:40,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 448 transitions, 9176 flow [2025-04-14 01:42:40,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 448 transitions, 8930 flow, removed 39 selfloop flow, removed 11 redundant places. [2025-04-14 01:42:40,493 INFO L231 Difference]: Finished difference. Result has 293 places, 436 transitions, 8094 flow [2025-04-14 01:42:40,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=7965, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8094, PETRI_PLACES=293, PETRI_TRANSITIONS=436} [2025-04-14 01:42:40,494 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 273 predicate places. [2025-04-14 01:42:40,494 INFO L485 AbstractCegarLoop]: Abstraction has has 293 places, 436 transitions, 8094 flow [2025-04-14 01:42:40,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 14 states have internal predecessors, (60), 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:42:40,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:40,494 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:42:40,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-14 01:42:40,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:40,695 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:42:40,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -626978622, now seen corresponding path program 2 times [2025-04-14 01:42:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:40,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438998243] [2025-04-14 01:42:40,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:40,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:42:40,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:42:40,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:40,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:40,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:40,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:40,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438998243] [2025-04-14 01:42:40,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438998243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:40,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335754609] [2025-04-14 01:42:40,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:42:40,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:40,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:40,820 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:42:40,820 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:42:40,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-14 01:42:40,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:42:40,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:42:40,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:40,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-14 01:42:40,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:42:40,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:42:41,223 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:42:41,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:42:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:42:58,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335754609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:42:58,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:42:58,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 22 [2025-04-14 01:42:58,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156216043] [2025-04-14 01:42:58,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:42:58,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:42:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:42:58,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:42:58,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:42:58,811 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:42:58,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 436 transitions, 8094 flow. Second operand has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 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:42:58,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:42:58,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:42:58,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:07,116 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:43:11,222 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:43:15,225 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:43:39,461 WARN L286 SmtUtils]: Spent 24.19s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:43:46,911 WARN L286 SmtUtils]: Spent 6.79s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:44:01,211 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 155 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:44:06,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:44:10,905 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:44:22,164 WARN L286 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 166 DAG size of output: 166 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:44:43,725 WARN L286 SmtUtils]: Spent 14.97s on a formula simplification. DAG size of input: 135 DAG size of output: 136 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:44:57,210 WARN L286 SmtUtils]: Spent 11.62s on a formula simplification. DAG size of input: 142 DAG size of output: 142 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:45:06,801 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 137 DAG size of output: 122 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:45:08,758 INFO L116 PetriNetUnfolderBase]: 1271/2531 cut-off events. [2025-04-14 01:45:08,758 INFO L117 PetriNetUnfolderBase]: For 34731/34731 co-relation queries the response was YES. [2025-04-14 01:45:08,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20148 conditions, 2531 events. 1271/2531 cut-off events. For 34731/34731 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 17460 event pairs, 21 based on Foata normal form. 12/2543 useless extension candidates. Maximal degree in co-relation 19947. Up to 872 conditions per place. [2025-04-14 01:45:08,774 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 297 selfloop transitions, 371 changer transitions 13/681 dead transitions. [2025-04-14 01:45:08,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 681 transitions, 12506 flow [2025-04-14 01:45:08,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 01:45:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-04-14 01:45:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 337 transitions. [2025-04-14 01:45:08,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37737961926091823 [2025-04-14 01:45:08,776 INFO L175 Difference]: Start difference. First operand has 293 places, 436 transitions, 8094 flow. Second operand 47 states and 337 transitions. [2025-04-14 01:45:08,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 681 transitions, 12506 flow [2025-04-14 01:45:08,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 681 transitions, 12382 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-04-14 01:45:08,958 INFO L231 Difference]: Finished difference. Result has 350 places, 557 transitions, 11671 flow [2025-04-14 01:45:08,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=7965, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=11671, PETRI_PLACES=350, PETRI_TRANSITIONS=557} [2025-04-14 01:45:08,959 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 330 predicate places. [2025-04-14 01:45:08,959 INFO L485 AbstractCegarLoop]: Abstraction has has 350 places, 557 transitions, 11671 flow [2025-04-14 01:45:08,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 22 states have internal predecessors, (87), 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:45:08,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:08,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:08,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-14 01:45:09,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:09,160 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:09,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:09,160 INFO L85 PathProgramCache]: Analyzing trace with hash -638680702, now seen corresponding path program 13 times [2025-04-14 01:45:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:09,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751803976] [2025-04-14 01:45:09,160 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:45:09,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:09,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:45:09,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:45:09,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:09,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:09,532 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:45:09,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:09,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751803976] [2025-04-14 01:45:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751803976] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:09,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469552938] [2025-04-14 01:45:09,532 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:45:09,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:09,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:09,534 INFO L229 MonitoredProcess]: Starting monitored process 26 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:45:09,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:45:09,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:45:09,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:45:09,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:09,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-14 01:45:09,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:09,807 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:09,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-04-14 01:45:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:45:09,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:10,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:10,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 162 treesize of output 198 [2025-04-14 01:45:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469552938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:11,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 19 [2025-04-14 01:45:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070461742] [2025-04-14 01:45:11,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:11,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-14 01:45:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:11,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-14 01:45:11,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:45:11,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:11,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 557 transitions, 11671 flow. Second operand has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 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:45:11,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:11,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:11,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:12,252 INFO L116 PetriNetUnfolderBase]: 1364/2695 cut-off events. [2025-04-14 01:45:12,252 INFO L117 PetriNetUnfolderBase]: For 44058/44058 co-relation queries the response was YES. [2025-04-14 01:45:12,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23630 conditions, 2695 events. 1364/2695 cut-off events. For 44058/44058 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18667 event pairs, 10 based on Foata normal form. 2/2697 useless extension candidates. Maximal degree in co-relation 23404. Up to 1348 conditions per place. [2025-04-14 01:45:12,272 INFO L140 encePairwiseOnDemand]: 9/19 looper letters, 352 selfloop transitions, 283 changer transitions 36/671 dead transitions. [2025-04-14 01:45:12,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 671 transitions, 14524 flow [2025-04-14 01:45:12,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:45:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:45:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 180 transitions. [2025-04-14 01:45:12,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3508771929824561 [2025-04-14 01:45:12,273 INFO L175 Difference]: Start difference. First operand has 350 places, 557 transitions, 11671 flow. Second operand 27 states and 180 transitions. [2025-04-14 01:45:12,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 671 transitions, 14524 flow [2025-04-14 01:45:12,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 671 transitions, 14031 flow, removed 208 selfloop flow, removed 14 redundant places. [2025-04-14 01:45:12,600 INFO L231 Difference]: Finished difference. Result has 367 places, 601 transitions, 12818 flow [2025-04-14 01:45:12,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=11185, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=12818, PETRI_PLACES=367, PETRI_TRANSITIONS=601} [2025-04-14 01:45:12,601 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 347 predicate places. [2025-04-14 01:45:12,601 INFO L485 AbstractCegarLoop]: Abstraction has has 367 places, 601 transitions, 12818 flow [2025-04-14 01:45:12,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 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:45:12,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:12,601 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:12,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:45:12,801 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-14 01:45:12,802 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:12,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1770605875, now seen corresponding path program 14 times [2025-04-14 01:45:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:12,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130761079] [2025-04-14 01:45:12,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:12,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:12,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:12,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:12,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:12,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130761079] [2025-04-14 01:45:12,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130761079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:12,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707902731] [2025-04-14 01:45:12,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:12,951 INFO L229 MonitoredProcess]: Starting monitored process 27 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:45:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:45:13,006 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:13,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:13,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:13,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:13,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:45:13,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:13,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707902731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:13,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-04-14 01:45:13,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331079781] [2025-04-14 01:45:13,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:13,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:45:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:13,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:45:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:45:13,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:13,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 601 transitions, 12818 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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:45:13,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:13,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:13,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:22,394 INFO L116 PetriNetUnfolderBase]: 1694/3383 cut-off events. [2025-04-14 01:45:22,394 INFO L117 PetriNetUnfolderBase]: For 61875/61875 co-relation queries the response was YES. [2025-04-14 01:45:22,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30027 conditions, 3383 events. 1694/3383 cut-off events. For 61875/61875 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 23941 event pairs, 145 based on Foata normal form. 84/3467 useless extension candidates. Maximal degree in co-relation 29916. Up to 907 conditions per place. [2025-04-14 01:45:22,421 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 549 selfloop transitions, 246 changer transitions 2/797 dead transitions. [2025-04-14 01:45:22,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 797 transitions, 17471 flow [2025-04-14 01:45:22,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:45:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:45:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2025-04-14 01:45:22,422 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-04-14 01:45:22,422 INFO L175 Difference]: Start difference. First operand has 367 places, 601 transitions, 12818 flow. Second operand 20 states and 188 transitions. [2025-04-14 01:45:22,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 797 transitions, 17471 flow [2025-04-14 01:45:22,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 797 transitions, 16841 flow, removed 194 selfloop flow, removed 21 redundant places. [2025-04-14 01:45:22,935 INFO L231 Difference]: Finished difference. Result has 354 places, 622 transitions, 13288 flow [2025-04-14 01:45:22,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=11819, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=13288, PETRI_PLACES=354, PETRI_TRANSITIONS=622} [2025-04-14 01:45:22,936 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 334 predicate places. [2025-04-14 01:45:22,936 INFO L485 AbstractCegarLoop]: Abstraction has has 354 places, 622 transitions, 13288 flow [2025-04-14 01:45:22,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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:45:22,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:22,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:22,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 01:45:23,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-14 01:45:23,137 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:23,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1569374777, now seen corresponding path program 3 times [2025-04-14 01:45:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:23,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874217375] [2025-04-14 01:45:23,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:45:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:23,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:23,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:23,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:45:23,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:23,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874217375] [2025-04-14 01:45:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874217375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:23,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757748030] [2025-04-14 01:45:23,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:45:23,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:23,367 INFO L229 MonitoredProcess]: Starting monitored process 28 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:45:23,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:45:23,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:23,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:23,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:45:23,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:23,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:45:23,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:23,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757748030] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:23,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 01:45:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232660556] [2025-04-14 01:45:23,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:23,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:45:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:23,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:45:23,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:45:23,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:23,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 622 transitions, 13288 flow. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:23,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:23,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:23,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:24,899 INFO L116 PetriNetUnfolderBase]: 1702/3403 cut-off events. [2025-04-14 01:45:24,899 INFO L117 PetriNetUnfolderBase]: For 61963/61963 co-relation queries the response was YES. [2025-04-14 01:45:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29936 conditions, 3403 events. 1702/3403 cut-off events. For 61963/61963 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24196 event pairs, 448 based on Foata normal form. 12/3415 useless extension candidates. Maximal degree in co-relation 29829. Up to 1972 conditions per place. [2025-04-14 01:45:24,925 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 467 selfloop transitions, 207 changer transitions 0/674 dead transitions. [2025-04-14 01:45:24,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 674 transitions, 15048 flow [2025-04-14 01:45:24,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:45:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:45:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2025-04-14 01:45:24,926 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3848684210526316 [2025-04-14 01:45:24,926 INFO L175 Difference]: Start difference. First operand has 354 places, 622 transitions, 13288 flow. Second operand 16 states and 117 transitions. [2025-04-14 01:45:24,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 674 transitions, 15048 flow [2025-04-14 01:45:25,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 674 transitions, 14384 flow, removed 131 selfloop flow, removed 13 redundant places. [2025-04-14 01:45:25,343 INFO L231 Difference]: Finished difference. Result has 360 places, 626 transitions, 13128 flow [2025-04-14 01:45:25,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=12624, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=13128, PETRI_PLACES=360, PETRI_TRANSITIONS=626} [2025-04-14 01:45:25,344 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 340 predicate places. [2025-04-14 01:45:25,344 INFO L485 AbstractCegarLoop]: Abstraction has has 360 places, 626 transitions, 13128 flow [2025-04-14 01:45:25,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:25,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:25,344 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:25,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 01:45:25,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:25,544 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:25,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:25,545 INFO L85 PathProgramCache]: Analyzing trace with hash 244199169, now seen corresponding path program 15 times [2025-04-14 01:45:25,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:25,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37089509] [2025-04-14 01:45:25,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:45:25,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:25,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:25,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:25,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:45:25,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:25,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37089509] [2025-04-14 01:45:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37089509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:25,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021719481] [2025-04-14 01:45:25,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:45:25,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:25,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:25,672 INFO L229 MonitoredProcess]: Starting monitored process 29 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:45:25,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:45:25,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:25,776 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:25,776 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:45:25,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:25,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:45:25,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:25,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021719481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:25,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-14 01:45:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118888381] [2025-04-14 01:45:25,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:25,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:45:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:25,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:45:25,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:45:25,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:25,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 626 transitions, 13128 flow. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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:45:25,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:25,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:25,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:27,080 INFO L116 PetriNetUnfolderBase]: 1751/3487 cut-off events. [2025-04-14 01:45:27,080 INFO L117 PetriNetUnfolderBase]: For 62654/62654 co-relation queries the response was YES. [2025-04-14 01:45:27,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30310 conditions, 3487 events. 1751/3487 cut-off events. For 62654/62654 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24755 event pairs, 169 based on Foata normal form. 20/3507 useless extension candidates. Maximal degree in co-relation 30204. Up to 865 conditions per place. [2025-04-14 01:45:27,107 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 556 selfloop transitions, 216 changer transitions 1/773 dead transitions. [2025-04-14 01:45:27,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 773 transitions, 16943 flow [2025-04-14 01:45:27,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:45:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:45:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 146 transitions. [2025-04-14 01:45:27,109 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.512280701754386 [2025-04-14 01:45:27,109 INFO L175 Difference]: Start difference. First operand has 360 places, 626 transitions, 13128 flow. Second operand 15 states and 146 transitions. [2025-04-14 01:45:27,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 773 transitions, 16943 flow [2025-04-14 01:45:27,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 773 transitions, 16559 flow, removed 28 selfloop flow, removed 9 redundant places. [2025-04-14 01:45:27,534 INFO L231 Difference]: Finished difference. Result has 369 places, 643 transitions, 13561 flow [2025-04-14 01:45:27,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=12744, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13561, PETRI_PLACES=369, PETRI_TRANSITIONS=643} [2025-04-14 01:45:27,535 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 349 predicate places. [2025-04-14 01:45:27,535 INFO L485 AbstractCegarLoop]: Abstraction has has 369 places, 643 transitions, 13561 flow [2025-04-14 01:45:27,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 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:45:27,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:27,535 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:27,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 01:45:27,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:27,736 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:27,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1636457065, now seen corresponding path program 4 times [2025-04-14 01:45:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:27,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771654280] [2025-04-14 01:45:27,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:45:27,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:27,741 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:27,747 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:27,747 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:45:27,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:27,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771654280] [2025-04-14 01:45:27,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771654280] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:27,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657485694] [2025-04-14 01:45:27,816 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:45:27,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:27,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:27,818 INFO L229 MonitoredProcess]: Starting monitored process 30 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:45:27,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:45:27,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:27,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:27,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:45:27,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:27,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 01:45:27,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:27,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657485694] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:28,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:28,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-04-14 01:45:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998317943] [2025-04-14 01:45:28,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:28,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 01:45:28,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 01:45:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:45:28,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:28,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 643 transitions, 13561 flow. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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:45:28,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:28,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:29,365 INFO L116 PetriNetUnfolderBase]: 1692/3392 cut-off events. [2025-04-14 01:45:29,365 INFO L117 PetriNetUnfolderBase]: For 62608/62608 co-relation queries the response was YES. [2025-04-14 01:45:29,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29726 conditions, 3392 events. 1692/3392 cut-off events. For 62608/62608 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 24078 event pairs, 163 based on Foata normal form. 27/3419 useless extension candidates. Maximal degree in co-relation 29616. Up to 682 conditions per place. [2025-04-14 01:45:29,403 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 399 selfloop transitions, 282 changer transitions 12/693 dead transitions. [2025-04-14 01:45:29,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 693 transitions, 15327 flow [2025-04-14 01:45:29,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:45:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:45:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2025-04-14 01:45:29,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41403508771929826 [2025-04-14 01:45:29,404 INFO L175 Difference]: Start difference. First operand has 369 places, 643 transitions, 13561 flow. Second operand 15 states and 118 transitions. [2025-04-14 01:45:29,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 693 transitions, 15327 flow [2025-04-14 01:45:29,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 693 transitions, 14892 flow, removed 47 selfloop flow, removed 8 redundant places. [2025-04-14 01:45:29,932 INFO L231 Difference]: Finished difference. Result has 376 places, 635 transitions, 13496 flow [2025-04-14 01:45:29,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=12885, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13496, PETRI_PLACES=376, PETRI_TRANSITIONS=635} [2025-04-14 01:45:29,932 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 356 predicate places. [2025-04-14 01:45:29,932 INFO L485 AbstractCegarLoop]: Abstraction has has 376 places, 635 transitions, 13496 flow [2025-04-14 01:45:29,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 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:45:29,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:29,933 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:29,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:45:30,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:30,133 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:30,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 167810825, now seen corresponding path program 5 times [2025-04-14 01:45:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:30,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426033119] [2025-04-14 01:45:30,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:45:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:30,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:30,144 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:30,144 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:30,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426033119] [2025-04-14 01:45:30,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426033119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:30,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504532618] [2025-04-14 01:45:30,244 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:45:30,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:30,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:30,246 INFO L229 MonitoredProcess]: Starting monitored process 31 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:45:30,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 01:45:30,303 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:30,359 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:30,359 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:30,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:30,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:45:30,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:30,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504532618] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:30,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-04-14 01:45:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116159644] [2025-04-14 01:45:30,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:30,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:45:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:30,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:45:30,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:45:30,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:30,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 635 transitions, 13496 flow. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 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:45:30,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:30,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:30,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:32,424 INFO L116 PetriNetUnfolderBase]: 1780/3534 cut-off events. [2025-04-14 01:45:32,424 INFO L117 PetriNetUnfolderBase]: For 69597/69597 co-relation queries the response was YES. [2025-04-14 01:45:32,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31581 conditions, 3534 events. 1780/3534 cut-off events. For 69597/69597 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 25056 event pairs, 266 based on Foata normal form. 40/3574 useless extension candidates. Maximal degree in co-relation 31470. Up to 1131 conditions per place. [2025-04-14 01:45:32,454 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 416 selfloop transitions, 342 changer transitions 5/763 dead transitions. [2025-04-14 01:45:32,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 763 transitions, 16404 flow [2025-04-14 01:45:32,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:45:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:45:32,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 228 transitions. [2025-04-14 01:45:32,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-14 01:45:32,455 INFO L175 Difference]: Start difference. First operand has 376 places, 635 transitions, 13496 flow. Second operand 30 states and 228 transitions. [2025-04-14 01:45:32,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 763 transitions, 16404 flow [2025-04-14 01:45:32,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 763 transitions, 15617 flow, removed 118 selfloop flow, removed 10 redundant places. [2025-04-14 01:45:32,972 INFO L231 Difference]: Finished difference. Result has 401 places, 670 transitions, 14332 flow [2025-04-14 01:45:32,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=12785, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=306, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=14332, PETRI_PLACES=401, PETRI_TRANSITIONS=670} [2025-04-14 01:45:32,973 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 381 predicate places. [2025-04-14 01:45:32,973 INFO L485 AbstractCegarLoop]: Abstraction has has 401 places, 670 transitions, 14332 flow [2025-04-14 01:45:32,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 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:45:32,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:32,973 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:32,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-04-14 01:45:33,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-14 01:45:33,174 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:33,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash 134982421, now seen corresponding path program 6 times [2025-04-14 01:45:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:33,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175477318] [2025-04-14 01:45:33,175 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:45:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:33,179 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:33,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:33,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:45:33,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:33,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:33,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175477318] [2025-04-14 01:45:33,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175477318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:33,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612155314] [2025-04-14 01:45:33,312 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:45:33,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:33,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:33,314 INFO L229 MonitoredProcess]: Starting monitored process 32 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:45:33,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 01:45:33,368 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:45:33,408 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:33,408 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:45:33,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:33,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-14 01:45:33,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:33,435 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:45:33,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:45:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:34,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:40,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612155314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:40,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:40,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 25 [2025-04-14 01:45:40,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548307110] [2025-04-14 01:45:40,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:40,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:45:40,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:40,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:45:40,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:45:40,954 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:40,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 670 transitions, 14332 flow. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:40,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:40,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:40,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:55,251 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:45:55,911 INFO L116 PetriNetUnfolderBase]: 1865/3698 cut-off events. [2025-04-14 01:45:55,912 INFO L117 PetriNetUnfolderBase]: For 64694/64694 co-relation queries the response was YES. [2025-04-14 01:45:55,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33041 conditions, 3698 events. 1865/3698 cut-off events. For 64694/64694 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26470 event pairs, 91 based on Foata normal form. 10/3708 useless extension candidates. Maximal degree in co-relation 32925. Up to 1308 conditions per place. [2025-04-14 01:45:55,944 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 415 selfloop transitions, 390 changer transitions 7/812 dead transitions. [2025-04-14 01:45:55,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 812 transitions, 17336 flow [2025-04-14 01:45:55,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 01:45:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 01:45:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 294 transitions. [2025-04-14 01:45:55,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-04-14 01:45:55,945 INFO L175 Difference]: Start difference. First operand has 401 places, 670 transitions, 14332 flow. Second operand 42 states and 294 transitions. [2025-04-14 01:45:55,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 812 transitions, 17336 flow [2025-04-14 01:45:56,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 812 transitions, 16866 flow, removed 85 selfloop flow, removed 16 redundant places. [2025-04-14 01:45:56,470 INFO L231 Difference]: Finished difference. Result has 432 places, 715 transitions, 15829 flow [2025-04-14 01:45:56,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=13870, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=346, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=15829, PETRI_PLACES=432, PETRI_TRANSITIONS=715} [2025-04-14 01:45:56,471 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 412 predicate places. [2025-04-14 01:45:56,471 INFO L485 AbstractCegarLoop]: Abstraction has has 432 places, 715 transitions, 15829 flow [2025-04-14 01:45:56,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:56,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:56,471 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:56,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-14 01:45:56,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-14 01:45:56,671 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:45:56,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:56,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1496842455, now seen corresponding path program 7 times [2025-04-14 01:45:56,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:56,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38392943] [2025-04-14 01:45:56,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:45:56,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:56,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:45:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:56,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:56,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:56,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:56,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38392943] [2025-04-14 01:45:56,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38392943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:56,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050834334] [2025-04-14 01:45:56,827 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:45:56,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:56,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:56,829 INFO L229 MonitoredProcess]: Starting monitored process 33 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:45:56,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 01:45:56,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:45:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:45:56,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:56,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:56,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:45:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:57,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:57,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:45:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050834334] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:57,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:45:57,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-14 01:45:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21290324] [2025-04-14 01:45:57,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:57,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:45:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:57,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:45:57,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:45:57,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:45:57,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 715 transitions, 15829 flow. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 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:45:57,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:57,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:45:57,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:02,656 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:03,614 INFO L116 PetriNetUnfolderBase]: 1936/3830 cut-off events. [2025-04-14 01:46:03,614 INFO L117 PetriNetUnfolderBase]: For 71983/71983 co-relation queries the response was YES. [2025-04-14 01:46:03,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35216 conditions, 3830 events. 1936/3830 cut-off events. For 71983/71983 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27603 event pairs, 272 based on Foata normal form. 8/3838 useless extension candidates. Maximal degree in co-relation 35097. Up to 1279 conditions per place. [2025-04-14 01:46:03,643 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 386 selfloop transitions, 451 changer transitions 0/837 dead transitions. [2025-04-14 01:46:03,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 837 transitions, 18937 flow [2025-04-14 01:46:03,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 01:46:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 01:46:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 219 transitions. [2025-04-14 01:46:03,644 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4116541353383459 [2025-04-14 01:46:03,644 INFO L175 Difference]: Start difference. First operand has 432 places, 715 transitions, 15829 flow. Second operand 28 states and 219 transitions. [2025-04-14 01:46:03,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 837 transitions, 18937 flow [2025-04-14 01:46:04,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 837 transitions, 18444 flow, removed 103 selfloop flow, removed 19 redundant places. [2025-04-14 01:46:04,180 INFO L231 Difference]: Finished difference. Result has 445 places, 762 transitions, 17497 flow [2025-04-14 01:46:04,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=15364, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=17497, PETRI_PLACES=445, PETRI_TRANSITIONS=762} [2025-04-14 01:46:04,181 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 425 predicate places. [2025-04-14 01:46:04,181 INFO L485 AbstractCegarLoop]: Abstraction has has 445 places, 762 transitions, 17497 flow [2025-04-14 01:46:04,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 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:46:04,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:04,181 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:04,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-14 01:46:04,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-14 01:46:04,384 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:04,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1378673607, now seen corresponding path program 16 times [2025-04-14 01:46:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:04,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388455747] [2025-04-14 01:46:04,385 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:46:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:04,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:04,394 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:04,394 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:46:04,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:04,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:04,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388455747] [2025-04-14 01:46:04,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388455747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:04,470 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109251299] [2025-04-14 01:46:04,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:46:04,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:04,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:04,472 INFO L229 MonitoredProcess]: Starting monitored process 34 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:46:04,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 01:46:04,528 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:04,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:04,572 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:46:04,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:04,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:46:04,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:04,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:04,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109251299] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:04,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:04,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-14 01:46:04,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815974189] [2025-04-14 01:46:04,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:04,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:46:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:04,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:46:04,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:46:04,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:04,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 762 transitions, 17497 flow. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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:46:04,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:04,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:04,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:06,168 INFO L116 PetriNetUnfolderBase]: 2073/4183 cut-off events. [2025-04-14 01:46:06,169 INFO L117 PetriNetUnfolderBase]: For 83451/83451 co-relation queries the response was YES. [2025-04-14 01:46:06,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39410 conditions, 4183 events. 2073/4183 cut-off events. For 83451/83451 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31340 event pairs, 184 based on Foata normal form. 12/4195 useless extension candidates. Maximal degree in co-relation 39286. Up to 1067 conditions per place. [2025-04-14 01:46:06,214 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 558 selfloop transitions, 293 changer transitions 3/854 dead transitions. [2025-04-14 01:46:06,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 854 transitions, 20426 flow [2025-04-14 01:46:06,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-14 01:46:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-14 01:46:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 166 transitions. [2025-04-14 01:46:06,216 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39712918660287083 [2025-04-14 01:46:06,216 INFO L175 Difference]: Start difference. First operand has 445 places, 762 transitions, 17497 flow. Second operand 22 states and 166 transitions. [2025-04-14 01:46:06,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 854 transitions, 20426 flow [2025-04-14 01:46:06,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 854 transitions, 19608 flow, removed 146 selfloop flow, removed 13 redundant places. [2025-04-14 01:46:06,904 INFO L231 Difference]: Finished difference. Result has 459 places, 779 transitions, 17854 flow [2025-04-14 01:46:06,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=16691, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=17854, PETRI_PLACES=459, PETRI_TRANSITIONS=779} [2025-04-14 01:46:06,909 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 439 predicate places. [2025-04-14 01:46:06,910 INFO L485 AbstractCegarLoop]: Abstraction has has 459 places, 779 transitions, 17854 flow [2025-04-14 01:46:06,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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:46:06,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:06,910 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:06,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-14 01:46:07,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-14 01:46:07,110 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:07,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:07,111 INFO L85 PathProgramCache]: Analyzing trace with hash -669367639, now seen corresponding path program 17 times [2025-04-14 01:46:07,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:07,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932670924] [2025-04-14 01:46:07,111 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:46:07,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:07,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:07,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:07,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:07,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:07,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:07,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932670924] [2025-04-14 01:46:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932670924] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:07,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693313548] [2025-04-14 01:46:07,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:46:07,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:07,214 INFO L229 MonitoredProcess]: Starting monitored process 35 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:46:07,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-14 01:46:07,283 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:07,341 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:07,342 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:07,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:07,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:46:07,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:07,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:07,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693313548] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:07,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:07,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2025-04-14 01:46:07,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919022961] [2025-04-14 01:46:07,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:07,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:46:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:07,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:46:07,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:46:07,481 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:07,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 779 transitions, 17854 flow. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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:46:07,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:07,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:07,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:09,294 INFO L116 PetriNetUnfolderBase]: 2057/4128 cut-off events. [2025-04-14 01:46:09,295 INFO L117 PetriNetUnfolderBase]: For 84812/84812 co-relation queries the response was YES. [2025-04-14 01:46:09,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38845 conditions, 4128 events. 2057/4128 cut-off events. For 84812/84812 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30587 event pairs, 216 based on Foata normal form. 4/4132 useless extension candidates. Maximal degree in co-relation 38716. Up to 1346 conditions per place. [2025-04-14 01:46:09,332 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 542 selfloop transitions, 266 changer transitions 9/817 dead transitions. [2025-04-14 01:46:09,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 817 transitions, 19781 flow [2025-04-14 01:46:09,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:46:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:46:09,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2025-04-14 01:46:09,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40131578947368424 [2025-04-14 01:46:09,333 INFO L175 Difference]: Start difference. First operand has 459 places, 779 transitions, 17854 flow. Second operand 16 states and 122 transitions. [2025-04-14 01:46:09,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 817 transitions, 19781 flow [2025-04-14 01:46:09,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 817 transitions, 19494 flow, removed 72 selfloop flow, removed 8 redundant places. [2025-04-14 01:46:10,004 INFO L231 Difference]: Finished difference. Result has 462 places, 767 transitions, 17858 flow [2025-04-14 01:46:10,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=17473, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=17858, PETRI_PLACES=462, PETRI_TRANSITIONS=767} [2025-04-14 01:46:10,005 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 442 predicate places. [2025-04-14 01:46:10,005 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 767 transitions, 17858 flow [2025-04-14 01:46:10,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 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:46:10,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:10,005 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:10,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-14 01:46:10,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:10,209 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:10,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash 962457237, now seen corresponding path program 18 times [2025-04-14 01:46:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:10,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698764284] [2025-04-14 01:46:10,209 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:46:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:10,214 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:10,221 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:10,221 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:46:10,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:10,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698764284] [2025-04-14 01:46:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698764284] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:10,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713962133] [2025-04-14 01:46:10,310 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:46:10,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:10,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:10,312 INFO L229 MonitoredProcess]: Starting monitored process 36 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:46:10,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-14 01:46:10,369 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:10,406 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:10,406 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:46:10,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:10,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:46:10,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:10,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:10,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713962133] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:10,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:10,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2025-04-14 01:46:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296277261] [2025-04-14 01:46:10,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:10,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:46:10,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:10,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:46:10,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:46:10,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:10,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 767 transitions, 17858 flow. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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:46:10,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:10,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:10,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:12,218 INFO L116 PetriNetUnfolderBase]: 2094/4150 cut-off events. [2025-04-14 01:46:12,218 INFO L117 PetriNetUnfolderBase]: For 86705/86705 co-relation queries the response was YES. [2025-04-14 01:46:12,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39389 conditions, 4150 events. 2094/4150 cut-off events. For 86705/86705 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 30369 event pairs, 79 based on Foata normal form. 20/4170 useless extension candidates. Maximal degree in co-relation 39262. Up to 1553 conditions per place. [2025-04-14 01:46:12,253 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 442 selfloop transitions, 423 changer transitions 0/865 dead transitions. [2025-04-14 01:46:12,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 865 transitions, 20592 flow [2025-04-14 01:46:12,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:46:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:46:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 210 transitions. [2025-04-14 01:46:12,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4093567251461988 [2025-04-14 01:46:12,254 INFO L175 Difference]: Start difference. First operand has 462 places, 767 transitions, 17858 flow. Second operand 27 states and 210 transitions. [2025-04-14 01:46:12,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 865 transitions, 20592 flow [2025-04-14 01:46:12,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 865 transitions, 19663 flow, removed 6 selfloop flow, removed 14 redundant places. [2025-04-14 01:46:12,878 INFO L231 Difference]: Finished difference. Result has 469 places, 794 transitions, 18599 flow [2025-04-14 01:46:12,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=16886, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=764, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=18599, PETRI_PLACES=469, PETRI_TRANSITIONS=794} [2025-04-14 01:46:12,879 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 449 predicate places. [2025-04-14 01:46:12,879 INFO L485 AbstractCegarLoop]: Abstraction has has 469 places, 794 transitions, 18599 flow [2025-04-14 01:46:12,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 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:46:12,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:12,879 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:12,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-14 01:46:13,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-14 01:46:13,079 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:13,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash 75334859, now seen corresponding path program 19 times [2025-04-14 01:46:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:13,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659789642] [2025-04-14 01:46:13,080 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:46:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:13,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:46:13,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:13,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:13,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:13,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:13,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659789642] [2025-04-14 01:46:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659789642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:13,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047337177] [2025-04-14 01:46:13,161 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:46:13,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:13,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:13,163 INFO L229 MonitoredProcess]: Starting monitored process 37 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:46:13,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-14 01:46:13,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:46:13,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:13,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:13,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:13,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:46:13,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:13,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047337177] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:13,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-04-14 01:46:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655222699] [2025-04-14 01:46:13,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:13,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:46:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:13,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:46:13,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:46:13,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:13,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 794 transitions, 18599 flow. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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:46:13,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:13,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:13,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:18,824 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:22,913 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:46:23,773 INFO L116 PetriNetUnfolderBase]: 2269/4486 cut-off events. [2025-04-14 01:46:23,774 INFO L117 PetriNetUnfolderBase]: For 95489/95489 co-relation queries the response was YES. [2025-04-14 01:46:23,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42973 conditions, 4486 events. 2269/4486 cut-off events. For 95489/95489 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 33360 event pairs, 396 based on Foata normal form. 8/4494 useless extension candidates. Maximal degree in co-relation 42844. Up to 2143 conditions per place. [2025-04-14 01:46:23,819 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 604 selfloop transitions, 312 changer transitions 5/921 dead transitions. [2025-04-14 01:46:23,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 921 transitions, 22590 flow [2025-04-14 01:46:23,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:46:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:46:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 140 transitions. [2025-04-14 01:46:23,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2025-04-14 01:46:23,820 INFO L175 Difference]: Start difference. First operand has 469 places, 794 transitions, 18599 flow. Second operand 20 states and 140 transitions. [2025-04-14 01:46:23,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 921 transitions, 22590 flow [2025-04-14 01:46:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 921 transitions, 22295 flow, removed 76 selfloop flow, removed 13 redundant places. [2025-04-14 01:46:24,649 INFO L231 Difference]: Finished difference. Result has 481 places, 837 transitions, 20425 flow [2025-04-14 01:46:24,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=18307, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=793, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=266, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=486, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=20425, PETRI_PLACES=481, PETRI_TRANSITIONS=837} [2025-04-14 01:46:24,649 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 461 predicate places. [2025-04-14 01:46:24,649 INFO L485 AbstractCegarLoop]: Abstraction has has 481 places, 837 transitions, 20425 flow [2025-04-14 01:46:24,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 states have internal predecessors, (58), 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:46:24,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:24,649 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:24,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-14 01:46:24,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:24,850 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:24,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1564888523, now seen corresponding path program 11 times [2025-04-14 01:46:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:24,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439111414] [2025-04-14 01:46:24,851 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:46:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:24,855 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:46:24,866 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:24,866 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:46:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:24,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439111414] [2025-04-14 01:46:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439111414] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:24,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889413326] [2025-04-14 01:46:24,997 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:46:24,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:24,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:24,999 INFO L229 MonitoredProcess]: Starting monitored process 38 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:46:24,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-14 01:46:25,057 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:46:25,218 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:25,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:46:25,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:25,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:46:25,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:25,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:25,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:25,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889413326] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:25,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:46:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117181664] [2025-04-14 01:46:25,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:25,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:46:25,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:25,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:46:25,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:46:25,409 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:25,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 837 transitions, 20425 flow. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:25,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:25,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:25,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:28,893 INFO L116 PetriNetUnfolderBase]: 2499/4904 cut-off events. [2025-04-14 01:46:28,894 INFO L117 PetriNetUnfolderBase]: For 119110/119110 co-relation queries the response was YES. [2025-04-14 01:46:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48679 conditions, 4904 events. 2499/4904 cut-off events. For 119110/119110 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 37051 event pairs, 614 based on Foata normal form. 57/4961 useless extension candidates. Maximal degree in co-relation 48546. Up to 2804 conditions per place. [2025-04-14 01:46:28,943 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 636 selfloop transitions, 396 changer transitions 0/1032 dead transitions. [2025-04-14 01:46:28,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 1032 transitions, 25490 flow [2025-04-14 01:46:28,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 01:46:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-14 01:46:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 273 transitions. [2025-04-14 01:46:28,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3991228070175439 [2025-04-14 01:46:28,945 INFO L175 Difference]: Start difference. First operand has 481 places, 837 transitions, 20425 flow. Second operand 36 states and 273 transitions. [2025-04-14 01:46:28,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 1032 transitions, 25490 flow [2025-04-14 01:46:29,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 1032 transitions, 25111 flow, removed 52 selfloop flow, removed 9 redundant places. [2025-04-14 01:46:29,959 INFO L231 Difference]: Finished difference. Result has 511 places, 939 transitions, 23750 flow [2025-04-14 01:46:29,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=19956, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=313, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=23750, PETRI_PLACES=511, PETRI_TRANSITIONS=939} [2025-04-14 01:46:29,960 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 491 predicate places. [2025-04-14 01:46:29,961 INFO L485 AbstractCegarLoop]: Abstraction has has 511 places, 939 transitions, 23750 flow [2025-04-14 01:46:29,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:29,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:29,961 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:29,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-14 01:46:30,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:30,161 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:30,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash -832402677, now seen corresponding path program 8 times [2025-04-14 01:46:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:30,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607396624] [2025-04-14 01:46:30,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:30,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:30,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:30,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:30,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:30,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:30,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:30,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607396624] [2025-04-14 01:46:30,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607396624] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:46:30,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166952561] [2025-04-14 01:46:30,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:46:30,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:30,309 INFO L229 MonitoredProcess]: Starting monitored process 39 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:46:30,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-14 01:46:30,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:46:30,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:46:30,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:46:30,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:30,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:46:30,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:30,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:30,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:46:30,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166952561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:46:30,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:46:30,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:46:30,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097882991] [2025-04-14 01:46:30,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:46:30,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:46:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:30,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:46:30,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:46:30,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:46:30,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 939 transitions, 23750 flow. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:30,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:30,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:46:30,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:34,817 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:37,658 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:41,762 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:50,537 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:46:54,626 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:57,262 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:46:59,206 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:05,016 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:07,586 INFO L116 PetriNetUnfolderBase]: 2631/5135 cut-off events. [2025-04-14 01:47:07,586 INFO L117 PetriNetUnfolderBase]: For 123945/123945 co-relation queries the response was YES. [2025-04-14 01:47:07,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51879 conditions, 5135 events. 2631/5135 cut-off events. For 123945/123945 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 38996 event pairs, 335 based on Foata normal form. 36/5171 useless extension candidates. Maximal degree in co-relation 51739. Up to 1464 conditions per place. [2025-04-14 01:47:07,640 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 576 selfloop transitions, 546 changer transitions 0/1122 dead transitions. [2025-04-14 01:47:07,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 1122 transitions, 28477 flow [2025-04-14 01:47:07,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 01:47:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 01:47:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 273 transitions. [2025-04-14 01:47:07,641 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3781163434903047 [2025-04-14 01:47:07,641 INFO L175 Difference]: Start difference. First operand has 511 places, 939 transitions, 23750 flow. Second operand 38 states and 273 transitions. [2025-04-14 01:47:07,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 1122 transitions, 28477 flow [2025-04-14 01:47:08,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1122 transitions, 27477 flow, removed 398 selfloop flow, removed 9 redundant places. [2025-04-14 01:47:08,879 INFO L231 Difference]: Finished difference. Result has 551 places, 1024 transitions, 26686 flow [2025-04-14 01:47:08,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=22723, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=468, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=26686, PETRI_PLACES=551, PETRI_TRANSITIONS=1024} [2025-04-14 01:47:08,880 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 531 predicate places. [2025-04-14 01:47:08,880 INFO L485 AbstractCegarLoop]: Abstraction has has 551 places, 1024 transitions, 26686 flow [2025-04-14 01:47:08,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:08,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:08,881 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:08,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2025-04-14 01:47:09,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-14 01:47:09,081 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:09,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:09,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1710561675, now seen corresponding path program 20 times [2025-04-14 01:47:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:09,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49296817] [2025-04-14 01:47:09,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:09,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:47:09,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:09,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:09,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:09,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:09,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49296817] [2025-04-14 01:47:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49296817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:09,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357143908] [2025-04-14 01:47:09,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:47:09,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:09,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:09,182 INFO L229 MonitoredProcess]: Starting monitored process 40 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:47:09,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-14 01:47:09,244 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:47:09,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:09,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:47:09,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:09,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:47:09,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:09,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:09,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:09,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357143908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:09,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:09,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-14 01:47:09,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457856996] [2025-04-14 01:47:09,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:09,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:47:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:09,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:47:09,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:47:09,394 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:47:09,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 1024 transitions, 26686 flow. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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:47:09,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:09,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:47:09,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:11,392 INFO L116 PetriNetUnfolderBase]: 2661/5202 cut-off events. [2025-04-14 01:47:11,392 INFO L117 PetriNetUnfolderBase]: For 144973/144973 co-relation queries the response was YES. [2025-04-14 01:47:11,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53929 conditions, 5202 events. 2661/5202 cut-off events. For 144973/144973 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 39699 event pairs, 691 based on Foata normal form. 20/5222 useless extension candidates. Maximal degree in co-relation 53779. Up to 2804 conditions per place. [2025-04-14 01:47:11,447 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 855 selfloop transitions, 229 changer transitions 0/1084 dead transitions. [2025-04-14 01:47:11,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 1084 transitions, 29517 flow [2025-04-14 01:47:11,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:47:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:47:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2025-04-14 01:47:11,448 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4309210526315789 [2025-04-14 01:47:11,448 INFO L175 Difference]: Start difference. First operand has 551 places, 1024 transitions, 26686 flow. Second operand 16 states and 131 transitions. [2025-04-14 01:47:11,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 1084 transitions, 29517 flow [2025-04-14 01:47:12,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 1084 transitions, 28875 flow, removed 171 selfloop flow, removed 22 redundant places. [2025-04-14 01:47:12,851 INFO L231 Difference]: Finished difference. Result has 546 places, 1019 transitions, 26582 flow [2025-04-14 01:47:12,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=25713, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1010, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=783, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=26582, PETRI_PLACES=546, PETRI_TRANSITIONS=1019} [2025-04-14 01:47:12,852 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 526 predicate places. [2025-04-14 01:47:12,852 INFO L485 AbstractCegarLoop]: Abstraction has has 546 places, 1019 transitions, 26582 flow [2025-04-14 01:47:12,852 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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:47:12,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:12,852 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:12,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-14 01:47:13,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-14 01:47:13,053 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:13,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1793678565, now seen corresponding path program 21 times [2025-04-14 01:47:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:13,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928482969] [2025-04-14 01:47:13,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:13,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:47:13,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:13,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:47:13,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:13,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928482969] [2025-04-14 01:47:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928482969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:13,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472805904] [2025-04-14 01:47:13,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:13,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:13,143 INFO L229 MonitoredProcess]: Starting monitored process 41 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:47:13,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-14 01:47:13,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:47:13,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:13,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:47:13,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:13,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 01:47:13,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:13,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472805904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:13,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-14 01:47:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676532143] [2025-04-14 01:47:13,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:13,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:47:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:13,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:47:13,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:47:13,365 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:47:13,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 1019 transitions, 26582 flow. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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:47:13,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:13,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:47:13,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:15,518 INFO L116 PetriNetUnfolderBase]: 2652/5170 cut-off events. [2025-04-14 01:47:15,518 INFO L117 PetriNetUnfolderBase]: For 141724/141724 co-relation queries the response was YES. [2025-04-14 01:47:15,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53705 conditions, 5170 events. 2652/5170 cut-off events. For 141724/141724 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 39254 event pairs, 487 based on Foata normal form. 2/5172 useless extension candidates. Maximal degree in co-relation 53558. Up to 1408 conditions per place. [2025-04-14 01:47:15,570 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 779 selfloop transitions, 324 changer transitions 3/1106 dead transitions. [2025-04-14 01:47:15,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 1106 transitions, 29865 flow [2025-04-14 01:47:15,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 01:47:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 01:47:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 162 transitions. [2025-04-14 01:47:15,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2025-04-14 01:47:15,571 INFO L175 Difference]: Start difference. First operand has 546 places, 1019 transitions, 26582 flow. Second operand 24 states and 162 transitions. [2025-04-14 01:47:15,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 1106 transitions, 29865 flow [2025-04-14 01:47:16,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1106 transitions, 29359 flow, removed 60 selfloop flow, removed 14 redundant places. [2025-04-14 01:47:16,912 INFO L231 Difference]: Finished difference. Result has 555 places, 1018 transitions, 26722 flow [2025-04-14 01:47:16,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=25993, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1015, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=319, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=26722, PETRI_PLACES=555, PETRI_TRANSITIONS=1018} [2025-04-14 01:47:16,913 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 535 predicate places. [2025-04-14 01:47:16,913 INFO L485 AbstractCegarLoop]: Abstraction has has 555 places, 1018 transitions, 26722 flow [2025-04-14 01:47:16,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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:47:16,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:16,913 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:16,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-14 01:47:17,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-14 01:47:17,118 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:17,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1618744885, now seen corresponding path program 9 times [2025-04-14 01:47:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:17,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569756854] [2025-04-14 01:47:17,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:17,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:47:17,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:17,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:47:17,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:17,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569756854] [2025-04-14 01:47:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569756854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:17,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440944493] [2025-04-14 01:47:17,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:47:17,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:17,379 INFO L229 MonitoredProcess]: Starting monitored process 42 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:47:17,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-14 01:47:17,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:47:17,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:17,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:47:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:17,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 01:47:17,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:17,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440944493] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:17,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-14 01:47:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282268942] [2025-04-14 01:47:17,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:17,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 01:47:17,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:17,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 01:47:17,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-14 01:47:17,715 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:47:17,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 1018 transitions, 26722 flow. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:17,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:17,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:47:17,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:20,371 INFO L116 PetriNetUnfolderBase]: 2688/5229 cut-off events. [2025-04-14 01:47:20,372 INFO L117 PetriNetUnfolderBase]: For 151398/151398 co-relation queries the response was YES. [2025-04-14 01:47:20,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54533 conditions, 5229 events. 2688/5229 cut-off events. For 151398/151398 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 39713 event pairs, 928 based on Foata normal form. 14/5243 useless extension candidates. Maximal degree in co-relation 54389. Up to 4336 conditions per place. [2025-04-14 01:47:20,430 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 881 selfloop transitions, 202 changer transitions 0/1083 dead transitions. [2025-04-14 01:47:20,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1083 transitions, 29818 flow [2025-04-14 01:47:20,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 01:47:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 01:47:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 137 transitions. [2025-04-14 01:47:20,431 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40058479532163743 [2025-04-14 01:47:20,431 INFO L175 Difference]: Start difference. First operand has 555 places, 1018 transitions, 26722 flow. Second operand 18 states and 137 transitions. [2025-04-14 01:47:20,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 1083 transitions, 29818 flow [2025-04-14 01:47:21,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 1083 transitions, 29289 flow, removed 22 selfloop flow, removed 17 redundant places. [2025-04-14 01:47:21,801 INFO L231 Difference]: Finished difference. Result has 555 places, 1038 transitions, 27346 flow [2025-04-14 01:47:21,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=26156, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=816, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=27346, PETRI_PLACES=555, PETRI_TRANSITIONS=1038} [2025-04-14 01:47:21,802 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 535 predicate places. [2025-04-14 01:47:21,803 INFO L485 AbstractCegarLoop]: Abstraction has has 555 places, 1038 transitions, 27346 flow [2025-04-14 01:47:21,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:21,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:21,803 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:21,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-14 01:47:22,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-14 01:47:22,004 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:22,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2035187201, now seen corresponding path program 12 times [2025-04-14 01:47:22,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:22,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424862165] [2025-04-14 01:47:22,005 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:47:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:22,010 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:47:22,045 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:22,045 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:47:22,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:22,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:22,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424862165] [2025-04-14 01:47:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424862165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:47:22,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838706687] [2025-04-14 01:47:22,137 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:47:22,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:47:22,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:47:22,139 INFO L229 MonitoredProcess]: Starting monitored process 43 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:47:22,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-14 01:47:22,201 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:47:22,272 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:22,272 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:47:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:22,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:47:22,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:47:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:22,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:47:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:47:22,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838706687] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:22,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:47:22,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2025-04-14 01:47:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562384932] [2025-04-14 01:47:22,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:22,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 01:47:22,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:22,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 01:47:22,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-04-14 01:47:22,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:47:22,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 1038 transitions, 27346 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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:47:22,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:22,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:47:22,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:25,308 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:28,316 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:33,147 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:38,307 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:41,964 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:46,099 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:47,446 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:51,260 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:52,678 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:57,051 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:47:58,563 INFO L116 PetriNetUnfolderBase]: 2875/5547 cut-off events. [2025-04-14 01:47:58,563 INFO L117 PetriNetUnfolderBase]: For 158944/158944 co-relation queries the response was YES. [2025-04-14 01:47:58,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58203 conditions, 5547 events. 2875/5547 cut-off events. For 158944/158944 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 42249 event pairs, 458 based on Foata normal form. 39/5586 useless extension candidates. Maximal degree in co-relation 58056. Up to 2170 conditions per place. [2025-04-14 01:47:58,619 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 695 selfloop transitions, 497 changer transitions 0/1192 dead transitions. [2025-04-14 01:47:58,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 1192 transitions, 32322 flow [2025-04-14 01:47:58,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:47:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:47:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 216 transitions. [2025-04-14 01:47:58,620 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.366723259762309 [2025-04-14 01:47:58,620 INFO L175 Difference]: Start difference. First operand has 555 places, 1038 transitions, 27346 flow. Second operand 31 states and 216 transitions. [2025-04-14 01:47:58,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 1192 transitions, 32322 flow [2025-04-14 01:48:00,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 1192 transitions, 31901 flow, removed 27 selfloop flow, removed 13 redundant places. [2025-04-14 01:48:00,186 INFO L231 Difference]: Finished difference. Result has 581 places, 1101 transitions, 30450 flow [2025-04-14 01:48:00,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=26814, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1034, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=30450, PETRI_PLACES=581, PETRI_TRANSITIONS=1101} [2025-04-14 01:48:00,187 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 561 predicate places. [2025-04-14 01:48:00,187 INFO L485 AbstractCegarLoop]: Abstraction has has 581 places, 1101 transitions, 30450 flow [2025-04-14 01:48:00,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 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:48:00,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:48:00,187 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:00,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-14 01:48:00,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:00,388 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:48:00,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:48:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1064398061, now seen corresponding path program 10 times [2025-04-14 01:48:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:48:00,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115594281] [2025-04-14 01:48:00,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:48:00,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:48:00,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:48:00,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:48:00,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:48:00,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:48:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:48:00,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115594281] [2025-04-14 01:48:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115594281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:48:00,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876990584] [2025-04-14 01:48:00,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:48:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:48:00,567 INFO L229 MonitoredProcess]: Starting monitored process 44 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:48:00,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-14 01:48:00,635 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:48:00,679 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:48:00,679 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:48:00,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:00,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:48:00,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:48:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:48:00,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:48:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:48:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876990584] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:48:00,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:48:00,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 01:48:00,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3204452] [2025-04-14 01:48:00,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:48:00,921 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:48:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:48:00,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:48:00,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:48:00,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:48:00,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 1101 transitions, 30450 flow. Second operand has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:48:00,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:48:00,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:48:00,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:48:05,239 INFO L116 PetriNetUnfolderBase]: 4016/7827 cut-off events. [2025-04-14 01:48:05,239 INFO L117 PetriNetUnfolderBase]: For 252845/252845 co-relation queries the response was YES. [2025-04-14 01:48:05,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83876 conditions, 7827 events. 4016/7827 cut-off events. For 252845/252845 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 62823 event pairs, 203 based on Foata normal form. 24/7851 useless extension candidates. Maximal degree in co-relation 83721. Up to 1659 conditions per place. [2025-04-14 01:48:05,326 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 726 selfloop transitions, 939 changer transitions 0/1665 dead transitions. [2025-04-14 01:48:05,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 1665 transitions, 47109 flow [2025-04-14 01:48:05,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:48:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:48:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 290 transitions. [2025-04-14 01:48:05,328 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3913630229419703 [2025-04-14 01:48:05,328 INFO L175 Difference]: Start difference. First operand has 581 places, 1101 transitions, 30450 flow. Second operand 39 states and 290 transitions. [2025-04-14 01:48:05,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 1665 transitions, 47109 flow [2025-04-14 01:48:08,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 1665 transitions, 46492 flow, removed 222 selfloop flow, removed 9 redundant places. [2025-04-14 01:48:08,218 INFO L231 Difference]: Finished difference. Result has 626 places, 1369 transitions, 40802 flow [2025-04-14 01:48:08,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=29865, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=706, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=40802, PETRI_PLACES=626, PETRI_TRANSITIONS=1369} [2025-04-14 01:48:08,219 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 606 predicate places. [2025-04-14 01:48:08,219 INFO L485 AbstractCegarLoop]: Abstraction has has 626 places, 1369 transitions, 40802 flow [2025-04-14 01:48:08,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:48:08,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:48:08,220 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:48:08,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-14 01:48:08,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 01:48:08,420 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:48:08,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:48:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1080889307, now seen corresponding path program 11 times [2025-04-14 01:48:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:48:08,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230666779] [2025-04-14 01:48:08,421 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:48:08,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:48:08,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:48:08,432 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:48:08,433 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:48:08,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:48:08,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:48:08,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230666779] [2025-04-14 01:48:08,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230666779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:48:08,549 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609099031] [2025-04-14 01:48:08,549 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:48:08,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:48:08,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:48:08,550 INFO L229 MonitoredProcess]: Starting monitored process 45 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:48:08,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-14 01:48:08,613 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:48:08,758 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:48:08,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 01:48:08,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:48:08,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-14 01:48:08,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:48:08,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:48:08,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:48:09,579 INFO L325 Elim1Store]: treesize reduction 165, result has 30.4 percent of original size [2025-04-14 01:48:09,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 430 treesize of output 239 [2025-04-14 01:48:09,907 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:48:09,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:48:28,300 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 116 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:48:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:48:28,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609099031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:48:28,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:48:28,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 25 [2025-04-14 01:48:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087530240] [2025-04-14 01:48:28,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:48:28,529 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:48:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:48:28,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:48:28,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:48:28,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:48:28,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 1369 transitions, 40802 flow. Second operand has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 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:48:28,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:48:28,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:48:28,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:48:37,786 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:48:52,565 WARN L286 SmtUtils]: Spent 7.67s on a formula simplification. DAG size of input: 149 DAG size of output: 142 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:48:53,717 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:48:55,621 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:49:09,203 WARN L286 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 158 DAG size of output: 153 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:15,953 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:49:39,852 WARN L286 SmtUtils]: Spent 21.81s on a formula simplification. DAG size of input: 168 DAG size of output: 160 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:45,362 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:50:04,485 WARN L286 SmtUtils]: Spent 16.36s on a formula simplification. DAG size of input: 196 DAG size of output: 191 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:50:21,685 WARN L286 SmtUtils]: Spent 10.59s on a formula simplification. DAG size of input: 167 DAG size of output: 162 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:50:33,772 WARN L286 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 201 DAG size of output: 196 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:51:08,419 WARN L286 SmtUtils]: Spent 33.44s on a formula simplification. DAG size of input: 196 DAG size of output: 182 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:51:15,366 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:21,786 INFO L116 PetriNetUnfolderBase]: 4429/8615 cut-off events. [2025-04-14 01:51:21,787 INFO L117 PetriNetUnfolderBase]: For 334511/334511 co-relation queries the response was YES. [2025-04-14 01:51:21,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99431 conditions, 8615 events. 4429/8615 cut-off events. For 334511/334511 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 70387 event pairs, 181 based on Foata normal form. 16/8631 useless extension candidates. Maximal degree in co-relation 99260. Up to 5141 conditions per place. [2025-04-14 01:51:21,898 INFO L140 encePairwiseOnDemand]: 8/19 looper letters, 932 selfloop transitions, 754 changer transitions 10/1696 dead transitions. [2025-04-14 01:51:21,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 1696 transitions, 51127 flow [2025-04-14 01:51:21,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-14 01:51:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2025-04-14 01:51:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 422 transitions. [2025-04-14 01:51:21,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38294010889292196 [2025-04-14 01:51:21,900 INFO L175 Difference]: Start difference. First operand has 626 places, 1369 transitions, 40802 flow. Second operand 58 states and 422 transitions. [2025-04-14 01:51:21,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 1696 transitions, 51127 flow [2025-04-14 01:51:26,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 1696 transitions, 49376 flow, removed 681 selfloop flow, removed 15 redundant places. [2025-04-14 01:51:26,439 INFO L231 Difference]: Finished difference. Result has 684 places, 1553 transitions, 47732 flow [2025-04-14 01:51:26,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=39255, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=47732, PETRI_PLACES=684, PETRI_TRANSITIONS=1553} [2025-04-14 01:51:26,440 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 664 predicate places. [2025-04-14 01:51:26,440 INFO L485 AbstractCegarLoop]: Abstraction has has 684 places, 1553 transitions, 47732 flow [2025-04-14 01:51:26,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.68) internal successors, (92), 25 states have internal predecessors, (92), 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:51:26,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:51:26,441 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:51:26,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-14 01:51:26,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:51:26,641 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:51:26,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:51:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1868660157, now seen corresponding path program 13 times [2025-04-14 01:51:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:51:26,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537632528] [2025-04-14 01:51:26,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:51:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:51:26,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:51:26,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:51:26,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:51:26,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:51:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:51:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:51:26,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537632528] [2025-04-14 01:51:26,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537632528] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:51:26,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260360409] [2025-04-14 01:51:26,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:51:26,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:51:26,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:51:26,743 INFO L229 MonitoredProcess]: Starting monitored process 46 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:51:26,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-14 01:51:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:51:26,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:51:26,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:51:26,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:51:26,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 01:51:26,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:51:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:51:26,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:51:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:51:27,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260360409] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:51:27,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:51:27,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-04-14 01:51:27,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169148280] [2025-04-14 01:51:27,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:51:27,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:51:27,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:51:27,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:51:27,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:51:27,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:51:27,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 1553 transitions, 47732 flow. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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:51:27,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:51:27,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:51:27,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:51:28,988 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:33,464 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:36,528 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:38,164 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:42,195 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:46,785 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:50,259 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:51:53,167 INFO L116 PetriNetUnfolderBase]: 4594/8853 cut-off events. [2025-04-14 01:51:53,167 INFO L117 PetriNetUnfolderBase]: For 367463/367463 co-relation queries the response was YES. [2025-04-14 01:51:53,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104584 conditions, 8853 events. 4594/8853 cut-off events. For 367463/367463 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 71884 event pairs, 370 based on Foata normal form. 33/8886 useless extension candidates. Maximal degree in co-relation 104405. Up to 3032 conditions per place. [2025-04-14 01:51:53,259 INFO L140 encePairwiseOnDemand]: 12/19 looper letters, 788 selfloop transitions, 950 changer transitions 0/1738 dead transitions. [2025-04-14 01:51:53,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 1738 transitions, 54577 flow [2025-04-14 01:51:53,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 01:51:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 01:51:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 265 transitions. [2025-04-14 01:51:53,261 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37695590327169276 [2025-04-14 01:51:53,261 INFO L175 Difference]: Start difference. First operand has 684 places, 1553 transitions, 47732 flow. Second operand 37 states and 265 transitions. [2025-04-14 01:51:53,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 1738 transitions, 54577 flow [2025-04-14 01:51:58,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 1738 transitions, 53476 flow, removed 429 selfloop flow, removed 20 redundant places. [2025-04-14 01:51:58,121 INFO L231 Difference]: Finished difference. Result has 707 places, 1611 transitions, 51204 flow [2025-04-14 01:51:58,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=46600, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=892, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=51204, PETRI_PLACES=707, PETRI_TRANSITIONS=1611} [2025-04-14 01:51:58,122 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 687 predicate places. [2025-04-14 01:51:58,122 INFO L485 AbstractCegarLoop]: Abstraction has has 707 places, 1611 transitions, 51204 flow [2025-04-14 01:51:58,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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:51:58,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:51:58,123 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:51:58,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-14 01:51:58,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-14 01:51:58,323 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:51:58,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:51:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1084291247, now seen corresponding path program 12 times [2025-04-14 01:51:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:51:58,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784507171] [2025-04-14 01:51:58,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:51:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:51:58,329 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:51:58,336 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:51:58,336 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:51:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:51:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:51:58,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:51:58,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784507171] [2025-04-14 01:51:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784507171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:51:58,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315371839] [2025-04-14 01:51:58,451 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:51:58,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:51:58,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:51:58,453 INFO L229 MonitoredProcess]: Starting monitored process 47 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:51:58,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-14 01:51:58,517 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-04-14 01:51:58,565 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:51:58,565 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:51:58,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:51:58,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-14 01:51:58,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:51:58,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:51:59,138 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:51:59,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:52:33,798 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:52:52,006 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 105 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:52:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:52:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315371839] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:52:52,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:52:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 25 [2025-04-14 01:52:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774597446] [2025-04-14 01:52:52,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:52:52,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:52:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:52:52,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:52:52,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:52:52,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2025-04-14 01:52:52,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 1611 transitions, 51204 flow. Second operand has 25 states, 25 states have (on average 3.72) internal successors, (93), 25 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:52:52,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:52:52,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2025-04-14 01:52:52,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:53:08,432 WARN L286 SmtUtils]: Spent 16.12s on a formula simplification. DAG size of input: 93 DAG size of output: 55 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:53:45,987 WARN L286 SmtUtils]: Spent 32.98s on a formula simplification. DAG size of input: 118 DAG size of output: 74 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:53:49,645 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 01:54:11,953 WARN L286 SmtUtils]: Spent 19.85s on a formula simplification. DAG size of input: 180 DAG size of output: 138 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:54:22,259 WARN L286 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 112 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:54:42,128 WARN L286 SmtUtils]: Spent 19.51s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2025-04-14 01:55:35,128 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:55:35,129 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:55:36,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-14 01:55:36,333 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 01:55:36,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 01:55:36,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:55:36,365 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:55:36,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-14 01:55:36,366 WARN L610 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2025-04-14 01:55:36,371 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:55:36,375 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:55:36,376 INFO L422 BasicCegarLoop]: Path program histogram: [21, 13, 12, 6, 1] [2025-04-14 01:55:36,380 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:55:36,380 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:55:36,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:55:36 BasicIcfg [2025-04-14 01:55:36,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:55:36,392 INFO L158 Benchmark]: Toolchain (without parser) took 860898.52ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 99.0MB in the beginning and 92.9MB in the end (delta: 6.1MB). Peak memory consumption was 917.8MB. Max. memory is 8.0GB. [2025-04-14 01:55:36,392 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:55:36,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.67ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 83.8MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:55:36,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.43ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 81.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:55:36,393 INFO L158 Benchmark]: Boogie Preprocessor took 47.31ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:55:36,393 INFO L158 Benchmark]: IcfgBuilder took 641.68ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 96.3MB in the end (delta: -16.8MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2025-04-14 01:55:36,393 INFO L158 Benchmark]: TraceAbstraction took 859921.53ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 95.6MB in the beginning and 92.9MB in the end (delta: 2.7MB). Peak memory consumption was 915.6MB. Max. memory is 8.0GB. [2025-04-14 01:55:36,394 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.30ms. Allocated memory is still 159.4MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.67ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 83.8MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.43ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 81.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.31ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 641.68ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 96.3MB in the end (delta: -16.8MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. * TraceAbstraction took 859921.53ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 910.2MB). Free memory was 95.6MB in the beginning and 92.9MB in the end (delta: 2.7MB). Peak memory consumption was 915.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 25 locations, 29 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: 859.8s, OverallIterations: 53, TraceHistogramMax: 3, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 688.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 4655 SdHoareTripleChecker+Valid, 177.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4655 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 175.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 917 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24054 IncrementalHoareTripleChecker+Invalid, 24990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 917 mSolverCounterUnsat, 0 mSDtfsCounter, 24054 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2898 GetRequests, 1541 SyntacticMatches, 7 SemanticMatches, 1349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11005 ImplicationChecksByTransitivity, 426.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51204occurred in iteration=52, InterpolantAutomatonStates: 1069, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 156.2s InterpolantComputationTime, 1651 NumberOfCodeBlocks, 1648 NumberOfCodeBlocksAsserted, 183 NumberOfCheckSat, 2283 ConstructedInterpolants, 11 QuantifiedInterpolants, 35052 SizeOfPredicates, 535 NumberOfNonLiveVariables, 7065 ConjunctsInSsa, 897 ConjunctsInUnsatCore, 145 InterpolantComputations, 7 PerfectInterpolantSequences, 368/756 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