/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 FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:14:32,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:14:33,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:14:33,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:14:33,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:14:33,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:14:33,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:14:33,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:14:33,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:14:33,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:14:33,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:14:33,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:14:33,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:14:33,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:14:33,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:14:33,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:14:33,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:14:33,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:14:33,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:14:33,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:14:33,038 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 -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:14:33,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:14:33,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:14:33,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:14:33,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:14:33,268 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:14:33,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2025-04-13 22:14:34,573 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278d43931/820f5f2d02434ad1a5dcfbec77e7e4e8/FLAG03f7aead7 [2025-04-13 22:14:34,792 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:14:34,793 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2025-04-13 22:14:34,801 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278d43931/820f5f2d02434ad1a5dcfbec77e7e4e8/FLAG03f7aead7 [2025-04-13 22:14:35,623 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278d43931/820f5f2d02434ad1a5dcfbec77e7e4e8 [2025-04-13 22:14:35,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:14:35,626 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:14:35,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:14:35,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:14:35,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:14:35,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afd9519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35, skipping insertion in model container [2025-04-13 22:14:35,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:14:35,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c[3882,3895] [2025-04-13 22:14:35,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:14:35,833 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:14:35,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c[3882,3895] [2025-04-13 22:14:35,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:14:35,877 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:14:35,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35 WrapperNode [2025-04-13 22:14:35,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:14:35,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:14:35,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:14:35,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:14:35,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,908 INFO L138 Inliner]: procedures = 24, calls = 24, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 214 [2025-04-13 22:14:35,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:14:35,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:14:35,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:14:35,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:14:35,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,927 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 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-13 22:14:35,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,931 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:14:35,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:14:35,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:14:35,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:14:35,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (1/1) ... [2025-04-13 22:14:35,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:14:35,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:35,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:14:35,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:14:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:14:35,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:14:35,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:14:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:14:35,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:14:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:14:35,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:14:35,974 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:14:36,060 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:14:36,061 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:14:36,322 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:14:36,322 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:14:36,323 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:14:36,623 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:14:36,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:14:36 BoogieIcfgContainer [2025-04-13 22:14:36,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:14:36,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:14:36,625 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:14:36,629 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:14:36,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:14:35" (1/3) ... [2025-04-13 22:14:36,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f9fbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:14:36, skipping insertion in model container [2025-04-13 22:14:36,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:14:35" (2/3) ... [2025-04-13 22:14:36,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f9fbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:14:36, skipping insertion in model container [2025-04-13 22:14:36,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:14:36" (3/3) ... [2025-04-13 22:14:36,631 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-04-13 22:14:36,640 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:14:36,641 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 17 locations, 17 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 22:14:36,642 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:14:36,679 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:14:36,698 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23 places, 19 transitions, 52 flow [2025-04-13 22:14:36,708 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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-13 22:14:36,725 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:14:36,733 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=FINITE_AUTOMATA, 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;@2d52adc3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:14:36,734 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:14:36,735 INFO L278 IsEmpty]: Start isEmpty. Operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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-13 22:14:36,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 22:14:36,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:36,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:36,740 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-13 22:14:36,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash 900725740, now seen corresponding path program 1 times [2025-04-13 22:14:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:36,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119313545] [2025-04-13 22:14:36,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:36,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:36,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 22:14:36,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 22:14:36,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:36,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:14:37,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:37,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119313545] [2025-04-13 22:14:37,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119313545] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:37,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:14:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766336120] [2025-04-13 22:14:37,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:37,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:14:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:37,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:14:37,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:14:37,048 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 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) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:37,098 INFO L93 Difference]: Finished difference Result 63 states and 137 transitions. [2025-04-13 22:14:37,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:14:37,100 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-13 22:14:37,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:37,105 INFO L225 Difference]: With dead ends: 63 [2025-04-13 22:14:37,105 INFO L226 Difference]: Without dead ends: 33 [2025-04-13 22:14:37,107 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:14:37,109 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:37,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:14:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-04-13 22:14:37,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-04-13 22:14:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.1875) internal successors, (70), 32 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-13 22:14:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 70 transitions. [2025-04-13 22:14:37,129 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 70 transitions. Word has length 13 [2025-04-13 22:14:37,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:37,129 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 70 transitions. [2025-04-13 22:14:37,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,129 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 70 transitions. [2025-04-13 22:14:37,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:14:37,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:37,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:37,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:14:37,130 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-13 22:14:37,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash -385090699, now seen corresponding path program 1 times [2025-04-13 22:14:37,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:37,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265047354] [2025-04-13 22:14:37,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:37,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:37,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:14:37,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:14:37,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:37,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:14:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:37,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265047354] [2025-04-13 22:14:37,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265047354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:37,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782633178] [2025-04-13 22:14:37,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:37,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:37,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:37,300 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-13 22:14:37,302 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-13 22:14:37,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:14:37,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:14:37,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:37,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:37,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:14:37,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:14:37,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:14:37,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782633178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:37,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:37,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-13 22:14:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944436368] [2025-04-13 22:14:37,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:37,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 22:14:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:37,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 22:14:37,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:14:37,454 INFO L87 Difference]: Start difference. First operand 33 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:37,492 INFO L93 Difference]: Finished difference Result 65 states and 140 transitions. [2025-04-13 22:14:37,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:37,492 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-04-13 22:14:37,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:37,493 INFO L225 Difference]: With dead ends: 65 [2025-04-13 22:14:37,493 INFO L226 Difference]: Without dead ends: 35 [2025-04-13 22:14:37,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:14:37,494 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:37,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:14:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-13 22:14:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-13 22:14:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2025-04-13 22:14:37,497 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 14 [2025-04-13 22:14:37,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:37,497 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2025-04-13 22:14:37,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:37,498 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2025-04-13 22:14:37,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:14:37,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:37,498 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:37,505 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-13 22:14:37,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:37,699 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-13 22:14:37,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -309711275, now seen corresponding path program 2 times [2025-04-13 22:14:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:37,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395373017] [2025-04-13 22:14:37,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:37,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:14:37,739 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 16 statements. [2025-04-13 22:14:37,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:14:37,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:38,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:38,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395373017] [2025-04-13 22:14:38,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395373017] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:38,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:38,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:14:38,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604736198] [2025-04-13 22:14:38,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:38,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:14:38,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:38,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:14:38,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:14:38,069 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:38,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:38,201 INFO L93 Difference]: Finished difference Result 71 states and 142 transitions. [2025-04-13 22:14:38,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:38,201 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 22:14:38,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:38,202 INFO L225 Difference]: With dead ends: 71 [2025-04-13 22:14:38,202 INFO L226 Difference]: Without dead ends: 51 [2025-04-13 22:14:38,202 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:14:38,203 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:38,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-13 22:14:38,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2025-04-13 22:14:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 38 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-13 22:14:38,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 81 transitions. [2025-04-13 22:14:38,209 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 81 transitions. Word has length 16 [2025-04-13 22:14:38,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:38,209 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 81 transitions. [2025-04-13 22:14:38,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:38,209 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 81 transitions. [2025-04-13 22:14:38,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:14:38,210 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:38,210 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:38,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:14:38,211 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-13 22:14:38,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash -286647275, now seen corresponding path program 3 times [2025-04-13 22:14:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:38,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114253119] [2025-04-13 22:14:38,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:38,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:38,224 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-04-13 22:14:38,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 16 statements. [2025-04-13 22:14:38,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:14:38,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:38,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:38,466 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114253119] [2025-04-13 22:14:38,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114253119] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:38,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:38,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:14:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150598546] [2025-04-13 22:14:38,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:38,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:14:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:38,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:14:38,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:14:38,467 INFO L87 Difference]: Start difference. First operand 39 states and 81 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:38,607 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2025-04-13 22:14:38,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:38,607 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 22:14:38,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:38,608 INFO L225 Difference]: With dead ends: 57 [2025-04-13 22:14:38,608 INFO L226 Difference]: Without dead ends: 44 [2025-04-13 22:14:38,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:14:38,608 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:38,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-13 22:14:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-04-13 22:14:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 2.1627906976744184) internal successors, (93), 43 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-13 22:14:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 93 transitions. [2025-04-13 22:14:38,614 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 93 transitions. Word has length 16 [2025-04-13 22:14:38,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:38,614 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 93 transitions. [2025-04-13 22:14:38,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:38,614 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 93 transitions. [2025-04-13 22:14:38,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:14:38,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:38,615 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:38,615 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:14:38,615 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-13 22:14:38,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1530917445, now seen corresponding path program 4 times [2025-04-13 22:14:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:38,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864099701] [2025-04-13 22:14:38,616 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:38,625 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 22:14:38,652 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:14:38,652 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:38,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:38,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864099701] [2025-04-13 22:14:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864099701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:38,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:14:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553862424] [2025-04-13 22:14:38,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:38,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:14:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:38,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:14:38,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:14:38,946 INFO L87 Difference]: Start difference. First operand 44 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:39,062 INFO L93 Difference]: Finished difference Result 73 states and 147 transitions. [2025-04-13 22:14:39,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:39,063 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 22:14:39,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:39,063 INFO L225 Difference]: With dead ends: 73 [2025-04-13 22:14:39,063 INFO L226 Difference]: Without dead ends: 58 [2025-04-13 22:14:39,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:14:39,064 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:39,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-13 22:14:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2025-04-13 22:14:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.1777777777777776) internal successors, (98), 45 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 98 transitions. [2025-04-13 22:14:39,074 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 98 transitions. Word has length 16 [2025-04-13 22:14:39,075 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:39,075 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 98 transitions. [2025-04-13 22:14:39,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:39,075 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 98 transitions. [2025-04-13 22:14:39,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:14:39,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:39,075 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:39,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:14:39,075 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-13 22:14:39,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1392389295, now seen corresponding path program 5 times [2025-04-13 22:14:39,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:39,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639962663] [2025-04-13 22:14:39,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:39,085 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 3 equivalence classes. [2025-04-13 22:14:39,112 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:14:39,112 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:14:39,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:39,504 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-13 22:14:39,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:39,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639962663] [2025-04-13 22:14:39,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639962663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:39,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471946852] [2025-04-13 22:14:39,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:39,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:39,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:39,506 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-13 22:14:39,508 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-13 22:14:39,563 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 3 equivalence classes. [2025-04-13 22:14:39,587 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:14:39,587 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:14:39,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:39,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:14:39,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:39,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:14:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471946852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:14:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-04-13 22:14:39,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441879776] [2025-04-13 22:14:39,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:39,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:14:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:14:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:14:39,733 INFO L87 Difference]: Start difference. First operand 46 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:39,855 INFO L93 Difference]: Finished difference Result 70 states and 150 transitions. [2025-04-13 22:14:39,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:39,856 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 22:14:39,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:39,856 INFO L225 Difference]: With dead ends: 70 [2025-04-13 22:14:39,856 INFO L226 Difference]: Without dead ends: 65 [2025-04-13 22:14:39,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:14:39,857 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:39,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-13 22:14:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2025-04-13 22:14:39,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.2448979591836733) internal successors, (110), 49 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 110 transitions. [2025-04-13 22:14:39,867 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 110 transitions. Word has length 16 [2025-04-13 22:14:39,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:39,868 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 110 transitions. [2025-04-13 22:14:39,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:39,868 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 110 transitions. [2025-04-13 22:14:39,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:39,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:39,869 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:39,877 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-13 22:14:40,069 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,SelfDestructingSolverStorable5 [2025-04-13 22:14:40,069 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-13 22:14:40,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -322255483, now seen corresponding path program 1 times [2025-04-13 22:14:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:40,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758309064] [2025-04-13 22:14:40,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:40,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:14:40,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:40,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:40,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:40,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758309064] [2025-04-13 22:14:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758309064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:40,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188964756] [2025-04-13 22:14:40,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:40,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:40,170 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-13 22:14:40,171 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-13 22:14:40,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:14:40,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:40,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:40,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:40,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:14:40,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:40,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:40,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188964756] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:40,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:14:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 22:14:40,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968194823] [2025-04-13 22:14:40,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:40,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:40,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:40,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:40,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:14:40,401 INFO L87 Difference]: Start difference. First operand 50 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:40,491 INFO L93 Difference]: Finished difference Result 90 states and 191 transitions. [2025-04-13 22:14:40,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:40,491 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:40,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:40,492 INFO L225 Difference]: With dead ends: 90 [2025-04-13 22:14:40,492 INFO L226 Difference]: Without dead ends: 82 [2025-04-13 22:14:40,492 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:14:40,493 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:40,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-13 22:14:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 54. [2025-04-13 22:14:40,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.339622641509434) internal successors, (124), 53 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 124 transitions. [2025-04-13 22:14:40,500 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 124 transitions. Word has length 17 [2025-04-13 22:14:40,500 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:40,500 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 124 transitions. [2025-04-13 22:14:40,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,500 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 124 transitions. [2025-04-13 22:14:40,500 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:40,500 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:40,500 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:40,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:40,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:40,701 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-13 22:14:40,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:40,702 INFO L85 PathProgramCache]: Analyzing trace with hash -380347933, now seen corresponding path program 2 times [2025-04-13 22:14:40,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:40,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508613633] [2025-04-13 22:14:40,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:40,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 22:14:40,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:40,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:40,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:40,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508613633] [2025-04-13 22:14:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508613633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:14:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522010010] [2025-04-13 22:14:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:40,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:40,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:14:40,831 INFO L87 Difference]: Start difference. First operand 54 states and 124 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:40,917 INFO L93 Difference]: Finished difference Result 80 states and 172 transitions. [2025-04-13 22:14:40,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:40,918 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:40,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:40,918 INFO L225 Difference]: With dead ends: 80 [2025-04-13 22:14:40,918 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 22:14:40,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:14:40,919 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:40,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 22:14:40,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2025-04-13 22:14:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.30188679245283) internal successors, (122), 53 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2025-04-13 22:14:40,930 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 122 transitions. Word has length 17 [2025-04-13 22:14:40,930 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:40,930 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 122 transitions. [2025-04-13 22:14:40,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:40,930 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 122 transitions. [2025-04-13 22:14:40,931 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:40,931 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:40,931 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:40,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:14:40,931 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-13 22:14:40,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -532670391, now seen corresponding path program 3 times [2025-04-13 22:14:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:40,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373340056] [2025-04-13 22:14:40,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:40,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:40,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-04-13 22:14:40,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 17 statements. [2025-04-13 22:14:40,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:40,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:41,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373340056] [2025-04-13 22:14:41,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373340056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:41,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551767076] [2025-04-13 22:14:41,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:41,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:41,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:41,034 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-13 22:14:41,035 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-13 22:14:41,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 3 equivalence classes. [2025-04-13 22:14:41,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 17 statements. [2025-04-13 22:14:41,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:41,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:41,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:14:41,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:41,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:41,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551767076] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:41,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:14:41,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-04-13 22:14:41,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105308473] [2025-04-13 22:14:41,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:41,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:41,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:41,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:14:41,159 INFO L87 Difference]: Start difference. First operand 54 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:41,234 INFO L93 Difference]: Finished difference Result 80 states and 177 transitions. [2025-04-13 22:14:41,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:41,235 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:41,235 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:41,236 INFO L225 Difference]: With dead ends: 80 [2025-04-13 22:14:41,236 INFO L226 Difference]: Without dead ends: 72 [2025-04-13 22:14:41,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:14:41,236 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:41,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 0 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:41,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-13 22:14:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2025-04-13 22:14:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.30188679245283) internal successors, (122), 53 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2025-04-13 22:14:41,248 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 122 transitions. Word has length 17 [2025-04-13 22:14:41,248 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:41,248 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 122 transitions. [2025-04-13 22:14:41,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:41,248 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 122 transitions. [2025-04-13 22:14:41,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:41,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:41,249 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:41,256 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-13 22:14:41,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:41,449 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-13 22:14:41,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash 188270635, now seen corresponding path program 4 times [2025-04-13 22:14:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:41,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095339207] [2025-04-13 22:14:41,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:41,461 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 22:14:41,466 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:41,466 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:41,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:41,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095339207] [2025-04-13 22:14:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095339207] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:41,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238849710] [2025-04-13 22:14:41,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:41,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:41,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:41,537 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-13 22:14:41,539 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-13 22:14:41,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 22:14:41,618 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:41,619 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:41,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:41,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:14:41,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:41,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:41,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:41,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238849710] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:14:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-13 22:14:41,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596128768] [2025-04-13 22:14:41,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:41,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:41,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:41,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:41,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:14:41,716 INFO L87 Difference]: Start difference. First operand 54 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:41,808 INFO L93 Difference]: Finished difference Result 85 states and 185 transitions. [2025-04-13 22:14:41,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:41,809 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:41,810 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:41,810 INFO L225 Difference]: With dead ends: 85 [2025-04-13 22:14:41,810 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 22:14:41,811 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:14:41,811 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:41,811 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 22:14:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2025-04-13 22:14:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.30188679245283) internal successors, (122), 53 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:41,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2025-04-13 22:14:41,817 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 122 transitions. Word has length 17 [2025-04-13 22:14:41,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:41,817 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 122 transitions. [2025-04-13 22:14:41,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:41,818 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 122 transitions. [2025-04-13 22:14:41,818 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:41,818 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:41,818 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:41,824 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-13 22:14:42,018 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,SelfDestructingSolverStorable9 [2025-04-13 22:14:42,019 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-13 22:14:42,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 213205702, now seen corresponding path program 1 times [2025-04-13 22:14:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:42,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606577916] [2025-04-13 22:14:42,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:42,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:14:42,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:42,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:42,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:42,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:42,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606577916] [2025-04-13 22:14:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606577916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:14:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902387675] [2025-04-13 22:14:42,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:42,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:42,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:42,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:14:42,117 INFO L87 Difference]: Start difference. First operand 54 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:42,204 INFO L93 Difference]: Finished difference Result 78 states and 165 transitions. [2025-04-13 22:14:42,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:42,204 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:42,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:42,205 INFO L225 Difference]: With dead ends: 78 [2025-04-13 22:14:42,205 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 22:14:42,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:14:42,205 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:42,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 22:14:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2025-04-13 22:14:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 53 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 120 transitions. [2025-04-13 22:14:42,212 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 120 transitions. Word has length 17 [2025-04-13 22:14:42,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:42,213 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 120 transitions. [2025-04-13 22:14:42,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,213 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 120 transitions. [2025-04-13 22:14:42,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:42,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:42,213 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:42,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:14:42,213 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-13 22:14:42,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash 102383182, now seen corresponding path program 2 times [2025-04-13 22:14:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:42,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588818630] [2025-04-13 22:14:42,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:42,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 22:14:42,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:42,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:42,312 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:42,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588818630] [2025-04-13 22:14:42,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588818630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:42,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143161107] [2025-04-13 22:14:42,313 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:42,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:42,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:42,315 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-13 22:14:42,317 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-13 22:14:42,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 22:14:42,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:42,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:42,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:42,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 22:14:42,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:42,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143161107] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:42,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:14:42,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 22:14:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033740978] [2025-04-13 22:14:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:42,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:42,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:42,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:14:42,484 INFO L87 Difference]: Start difference. First operand 54 states and 120 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:42,553 INFO L93 Difference]: Finished difference Result 69 states and 151 transitions. [2025-04-13 22:14:42,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:42,553 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:42,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:42,554 INFO L225 Difference]: With dead ends: 69 [2025-04-13 22:14:42,554 INFO L226 Difference]: Without dead ends: 62 [2025-04-13 22:14:42,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:14:42,554 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:42,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:14:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-13 22:14:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2025-04-13 22:14:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.2641509433962264) internal successors, (120), 53 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 120 transitions. [2025-04-13 22:14:42,560 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 120 transitions. Word has length 17 [2025-04-13 22:14:42,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:42,560 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 120 transitions. [2025-04-13 22:14:42,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,561 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 120 transitions. [2025-04-13 22:14:42,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:14:42,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:42,561 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:42,567 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-13 22:14:42,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:42,762 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-13 22:14:42,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash 130178185, now seen corresponding path program 5 times [2025-04-13 22:14:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:42,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946903546] [2025-04-13 22:14:42,762 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:42,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:42,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 3 equivalence classes. [2025-04-13 22:14:42,775 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:14:42,775 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:14:42,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:42,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:42,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946903546] [2025-04-13 22:14:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946903546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:14:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:14:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:14:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709833489] [2025-04-13 22:14:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:14:42,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:14:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:42,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:14:42,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:14:42,831 INFO L87 Difference]: Start difference. First operand 54 states and 120 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:42,900 INFO L93 Difference]: Finished difference Result 69 states and 147 transitions. [2025-04-13 22:14:42,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:14:42,901 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:14:42,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:42,901 INFO L225 Difference]: With dead ends: 69 [2025-04-13 22:14:42,901 INFO L226 Difference]: Without dead ends: 58 [2025-04-13 22:14:42,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:14:42,902 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:42,902 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:14:42,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-04-13 22:14:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2025-04-13 22:14:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.215686274509804) internal successors, (113), 51 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 113 transitions. [2025-04-13 22:14:42,907 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 113 transitions. Word has length 17 [2025-04-13 22:14:42,907 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:42,907 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 113 transitions. [2025-04-13 22:14:42,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:42,907 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 113 transitions. [2025-04-13 22:14:42,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:42,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:42,908 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:42,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:14:42,908 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-13 22:14:42,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2101807460, now seen corresponding path program 1 times [2025-04-13 22:14:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:42,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489877993] [2025-04-13 22:14:42,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:42,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:14:42,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:42,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:42,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:43,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:43,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489877993] [2025-04-13 22:14:43,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489877993] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:43,536 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249640178] [2025-04-13 22:14:43,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:14:43,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:43,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:43,538 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-13 22:14:43,539 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-13 22:14:43,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:14:43,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:43,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:43,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:43,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:14:43,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:43,841 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 143 treesize of output 91 [2025-04-13 22:14:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:43,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:44,624 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:44,624 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 208 treesize of output 132 [2025-04-13 22:14:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:44,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249640178] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:44,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:44,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-13 22:14:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251729931] [2025-04-13 22:14:44,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:44,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:14:44,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:44,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:14:44,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:14:44,764 INFO L87 Difference]: Start difference. First operand 52 states and 113 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:46,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:46,107 INFO L93 Difference]: Finished difference Result 156 states and 341 transitions. [2025-04-13 22:14:46,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:14:46,107 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:14:46,107 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:46,108 INFO L225 Difference]: With dead ends: 156 [2025-04-13 22:14:46,108 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 22:14:46,109 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=1369, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:14:46,109 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:46,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 22:14:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 74. [2025-04-13 22:14:46,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.3013698630136985) internal successors, (168), 73 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 168 transitions. [2025-04-13 22:14:46,121 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 168 transitions. Word has length 18 [2025-04-13 22:14:46,121 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:46,121 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 168 transitions. [2025-04-13 22:14:46,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:46,121 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 168 transitions. [2025-04-13 22:14:46,121 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:46,121 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:46,121 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:46,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:46,326 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-13 22:14:46,326 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-13 22:14:46,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1401174864, now seen corresponding path program 2 times [2025-04-13 22:14:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:46,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615957614] [2025-04-13 22:14:46,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:46,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:46,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 22:14:46,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:46,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:46,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:46,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:46,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615957614] [2025-04-13 22:14:46,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615957614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:46,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926454235] [2025-04-13 22:14:46,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:46,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:46,884 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-13 22:14:46,885 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-13 22:14:46,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 22:14:46,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:46,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:46,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:46,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:14:46,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:47,143 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 158 treesize of output 102 [2025-04-13 22:14:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:47,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:47,942 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:47,943 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 245 treesize of output 157 [2025-04-13 22:14:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926454235] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:48,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-04-13 22:14:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548246622] [2025-04-13 22:14:48,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:48,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:14:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:48,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:14:48,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:14:48,147 INFO L87 Difference]: Start difference. First operand 74 states and 168 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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-13 22:14:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:48,605 INFO L93 Difference]: Finished difference Result 107 states and 234 transitions. [2025-04-13 22:14:48,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:14:48,605 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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) Word has length 18 [2025-04-13 22:14:48,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:48,606 INFO L225 Difference]: With dead ends: 107 [2025-04-13 22:14:48,606 INFO L226 Difference]: Without dead ends: 102 [2025-04-13 22:14:48,606 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:48,607 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:48,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-04-13 22:14:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2025-04-13 22:14:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.3164556962025316) internal successors, (183), 79 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2025-04-13 22:14:48,620 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 18 [2025-04-13 22:14:48,620 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:48,620 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2025-04-13 22:14:48,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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-13 22:14:48,620 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2025-04-13 22:14:48,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:48,621 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:48,621 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:48,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:48,821 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-13 22:14:48,821 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-13 22:14:48,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1511997384, now seen corresponding path program 3 times [2025-04-13 22:14:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:48,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712555919] [2025-04-13 22:14:48,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:48,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:14:48,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-04-13 22:14:48,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:48,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:49,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712555919] [2025-04-13 22:14:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712555919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:49,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553795667] [2025-04-13 22:14:49,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:49,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:49,302 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-13 22:14:49,303 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-13 22:14:49,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:14:49,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-04-13 22:14:49,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:49,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:14:49,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:49,509 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 137 treesize of output 89 [2025-04-13 22:14:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:49,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:50,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:50,253 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 234 treesize of output 154 [2025-04-13 22:14:50,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:50,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553795667] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:50,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:50,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-04-13 22:14:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478361364] [2025-04-13 22:14:50,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:50,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:14:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:50,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:14:50,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:14:50,516 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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-13 22:14:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:50,996 INFO L93 Difference]: Finished difference Result 119 states and 254 transitions. [2025-04-13 22:14:50,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:14:50,997 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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) Word has length 18 [2025-04-13 22:14:50,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:50,997 INFO L225 Difference]: With dead ends: 119 [2025-04-13 22:14:50,997 INFO L226 Difference]: Without dead ends: 114 [2025-04-13 22:14:50,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:50,998 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:50,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:50,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-04-13 22:14:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 80. [2025-04-13 22:14:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.3164556962025316) internal successors, (183), 79 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 183 transitions. [2025-04-13 22:14:51,012 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 183 transitions. Word has length 18 [2025-04-13 22:14:51,012 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:51,012 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 183 transitions. [2025-04-13 22:14:51,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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-13 22:14:51,012 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 183 transitions. [2025-04-13 22:14:51,013 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:51,013 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:51,013 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:51,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 22:14:51,213 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-13 22:14:51,213 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-13 22:14:51,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash 206346322, now seen corresponding path program 4 times [2025-04-13 22:14:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:51,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229734647] [2025-04-13 22:14:51,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:51,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 22:14:51,233 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:51,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:51,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:51,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:51,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:51,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229734647] [2025-04-13 22:14:51,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229734647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:51,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874882858] [2025-04-13 22:14:51,671 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:51,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:51,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:51,673 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-13 22:14:51,675 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-13 22:14:51,731 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 22:14:51,750 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:51,750 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:51,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:51,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:14:51,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:51,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 182 treesize of output 118 [2025-04-13 22:14:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:52,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:52,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:52,682 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 268 treesize of output 180 [2025-04-13 22:14:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874882858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:52,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-04-13 22:14:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350255346] [2025-04-13 22:14:52,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:52,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:14:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:52,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:14:52,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:14:52,914 INFO L87 Difference]: Start difference. First operand 80 states and 183 transitions. Second operand has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:54,983 INFO L93 Difference]: Finished difference Result 190 states and 416 transitions. [2025-04-13 22:14:54,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:14:54,983 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:14:54,983 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:54,984 INFO L225 Difference]: With dead ends: 190 [2025-04-13 22:14:54,984 INFO L226 Difference]: Without dead ends: 167 [2025-04-13 22:14:54,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=459, Invalid=1797, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:14:54,985 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:54,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-13 22:14:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 90. [2025-04-13 22:14:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.4719101123595504) internal successors, (220), 89 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 220 transitions. [2025-04-13 22:14:55,006 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 220 transitions. Word has length 18 [2025-04-13 22:14:55,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:55,006 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 220 transitions. [2025-04-13 22:14:55,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:55,006 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 220 transitions. [2025-04-13 22:14:55,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:55,007 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:55,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 22:14:55,207 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-13 22:14:55,207 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-13 22:14:55,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash 665897580, now seen corresponding path program 5 times [2025-04-13 22:14:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:55,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858592401] [2025-04-13 22:14:55,211 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:55,218 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:14:55,230 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:55,230 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:14:55,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:14:55,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:55,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858592401] [2025-04-13 22:14:55,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858592401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:55,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080056364] [2025-04-13 22:14:55,780 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:55,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:55,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:55,783 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-13 22:14:55,784 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-13 22:14:55,844 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:14:55,865 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:55,865 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:14:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:55,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:14:55,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:56,038 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 164 treesize of output 104 [2025-04-13 22:14:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:56,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:56,536 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:56,537 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 238 treesize of output 146 [2025-04-13 22:14:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080056364] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:56,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-04-13 22:14:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041797143] [2025-04-13 22:14:56,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:56,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:14:56,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:56,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:14:56,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:14:56,643 INFO L87 Difference]: Start difference. First operand 90 states and 220 transitions. Second operand has 21 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:57,840 INFO L93 Difference]: Finished difference Result 180 states and 419 transitions. [2025-04-13 22:14:57,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:14:57,841 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:14:57,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:57,842 INFO L225 Difference]: With dead ends: 180 [2025-04-13 22:14:57,842 INFO L226 Difference]: Without dead ends: 155 [2025-04-13 22:14:57,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=1134, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:14:57,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:57,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:57,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-13 22:14:57,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 96. [2025-04-13 22:14:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.473684210526316) internal successors, (235), 95 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 235 transitions. [2025-04-13 22:14:57,865 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 235 transitions. Word has length 18 [2025-04-13 22:14:57,865 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:57,865 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 235 transitions. [2025-04-13 22:14:57,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:57,865 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 235 transitions. [2025-04-13 22:14:57,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:57,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:57,866 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:57,871 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-13 22:14:58,066 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-13 22:14:58,066 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-13 22:14:58,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1540232906, now seen corresponding path program 6 times [2025-04-13 22:14:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:58,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862633457] [2025-04-13 22:14:58,067 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:58,073 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:14:58,086 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:58,087 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:58,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:58,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:58,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862633457] [2025-04-13 22:14:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862633457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:58,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208812563] [2025-04-13 22:14:58,541 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:58,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:58,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:58,542 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-13 22:14:58,544 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-13 22:14:58,604 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:14:58,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:14:58,625 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:58,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:58,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:14:58,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:58,797 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 98 treesize of output 62 [2025-04-13 22:14:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:58,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:59,268 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:59,269 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 298 treesize of output 178 [2025-04-13 22:14:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:59,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208812563] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:59,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:59,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:14:59,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41858154] [2025-04-13 22:14:59,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:59,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:14:59,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:59,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:14:59,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:14:59,480 INFO L87 Difference]: Start difference. First operand 96 states and 235 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:59,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:59,967 INFO L93 Difference]: Finished difference Result 124 states and 288 transitions. [2025-04-13 22:14:59,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:14:59,967 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:14:59,967 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:59,968 INFO L225 Difference]: With dead ends: 124 [2025-04-13 22:14:59,968 INFO L226 Difference]: Without dead ends: 119 [2025-04-13 22:14:59,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:14:59,969 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:59,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-13 22:14:59,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2025-04-13 22:14:59,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.4948453608247423) internal successors, (242), 97 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 242 transitions. [2025-04-13 22:14:59,992 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 242 transitions. Word has length 18 [2025-04-13 22:14:59,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:59,992 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 242 transitions. [2025-04-13 22:14:59,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:14:59,993 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 242 transitions. [2025-04-13 22:14:59,993 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:14:59,993 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:59,993 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:14:59,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:00,193 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-13 22:15:00,193 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-13 22:15:00,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:00,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1429410386, now seen corresponding path program 7 times [2025-04-13 22:15:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:00,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701985665] [2025-04-13 22:15:00,194 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:00,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:15:00,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:15:00,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:00,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:00,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701985665] [2025-04-13 22:15:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701985665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:00,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882300937] [2025-04-13 22:15:00,627 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:00,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:00,628 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-13 22:15:00,630 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-13 22:15:00,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:15:00,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:15:00,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:00,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:00,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:15:00,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:00,837 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 203 treesize of output 131 [2025-04-13 22:15:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:00,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:01,610 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:01,610 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 337 treesize of output 209 [2025-04-13 22:15:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882300937] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:01,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-04-13 22:15:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907443271] [2025-04-13 22:15:01,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:01,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:15:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:01,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:15:01,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:15:01,783 INFO L87 Difference]: Start difference. First operand 98 states and 242 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:03,584 INFO L93 Difference]: Finished difference Result 204 states and 431 transitions. [2025-04-13 22:15:03,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:15:03,585 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:15:03,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:03,586 INFO L225 Difference]: With dead ends: 204 [2025-04-13 22:15:03,586 INFO L226 Difference]: Without dead ends: 177 [2025-04-13 22:15:03,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=322, Invalid=1658, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:15:03,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:03,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-13 22:15:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 104. [2025-04-13 22:15:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.5533980582524274) internal successors, (263), 103 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 263 transitions. [2025-04-13 22:15:03,617 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 263 transitions. Word has length 18 [2025-04-13 22:15:03,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:03,617 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 263 transitions. [2025-04-13 22:15:03,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:03,617 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 263 transitions. [2025-04-13 22:15:03,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:15:03,617 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:03,617 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:03,624 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-13 22:15:03,819 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-13 22:15:03,819 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-13 22:15:03,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:03,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1147213204, now seen corresponding path program 8 times [2025-04-13 22:15:03,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:03,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963442068] [2025-04-13 22:15:03,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:03,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:03,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 22:15:03,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:15:03,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:03,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:04,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:04,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963442068] [2025-04-13 22:15:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963442068] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:04,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247138310] [2025-04-13 22:15:04,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:04,210 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-13 22:15:04,210 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-13 22:15:04,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 22:15:04,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:15:04,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:04,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:04,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:15:04,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:04,483 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 137 treesize of output 89 [2025-04-13 22:15:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:04,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:05,183 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:05,183 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 367 treesize of output 239 [2025-04-13 22:15:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247138310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:05,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:15:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473782562] [2025-04-13 22:15:05,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:05,596 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:15:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:05,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:15:05,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:15:05,596 INFO L87 Difference]: Start difference. First operand 104 states and 263 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:06,435 INFO L93 Difference]: Finished difference Result 173 states and 390 transitions. [2025-04-13 22:15:06,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:15:06,436 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:15:06,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:06,437 INFO L225 Difference]: With dead ends: 173 [2025-04-13 22:15:06,437 INFO L226 Difference]: Without dead ends: 164 [2025-04-13 22:15:06,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:15:06,437 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:06,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-13 22:15:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2025-04-13 22:15:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.6422018348623855) internal successors, (288), 109 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 288 transitions. [2025-04-13 22:15:06,469 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 288 transitions. Word has length 18 [2025-04-13 22:15:06,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:06,469 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 288 transitions. [2025-04-13 22:15:06,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:06,469 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 288 transitions. [2025-04-13 22:15:06,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:15:06,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:06,469 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:06,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 22:15:06,670 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-13 22:15:06,670 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-13 22:15:06,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1205305654, now seen corresponding path program 9 times [2025-04-13 22:15:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:06,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585732894] [2025-04-13 22:15:06,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:06,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:15:06,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-04-13 22:15:06,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:06,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:07,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585732894] [2025-04-13 22:15:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585732894] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:07,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779659717] [2025-04-13 22:15:07,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:07,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:07,048 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-13 22:15:07,049 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-13 22:15:07,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-04-13 22:15:07,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 18 statements. [2025-04-13 22:15:07,126 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:07,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:07,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:15:07,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:07,363 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 131 treesize of output 83 [2025-04-13 22:15:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:07,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:07,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:07,962 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 396 treesize of output 244 [2025-04-13 22:15:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779659717] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:08,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:15:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632755882] [2025-04-13 22:15:08,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:08,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:15:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:08,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:15:08,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:15:08,243 INFO L87 Difference]: Start difference. First operand 110 states and 288 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:09,136 INFO L93 Difference]: Finished difference Result 170 states and 396 transitions. [2025-04-13 22:15:09,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:15:09,136 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:15:09,137 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:09,137 INFO L225 Difference]: With dead ends: 170 [2025-04-13 22:15:09,137 INFO L226 Difference]: Without dead ends: 148 [2025-04-13 22:15:09,139 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=1097, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:15:09,140 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:09,141 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-04-13 22:15:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 110. [2025-04-13 22:15:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 2.623853211009174) internal successors, (286), 109 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 286 transitions. [2025-04-13 22:15:09,173 INFO L79 Accepts]: Start accepts. Automaton has 110 states and 286 transitions. Word has length 18 [2025-04-13 22:15:09,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:09,173 INFO L485 AbstractCegarLoop]: Abstraction has 110 states and 286 transitions. [2025-04-13 22:15:09,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 21 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:09,173 INFO L278 IsEmpty]: Start isEmpty. Operand 110 states and 286 transitions. [2025-04-13 22:15:09,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:09,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:09,174 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:09,180 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-13 22:15:09,374 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-13 22:15:09,374 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-13 22:15:09,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash 252951141, now seen corresponding path program 10 times [2025-04-13 22:15:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:09,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399069615] [2025-04-13 22:15:09,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:09,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:09,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:09,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:09,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:09,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:09,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399069615] [2025-04-13 22:15:09,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399069615] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:09,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682024032] [2025-04-13 22:15:09,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:09,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:09,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:09,658 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-13 22:15:09,659 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-13 22:15:09,719 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:09,737 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:09,737 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:09,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:09,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:15:09,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:09,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:09,908 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:09,909 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 40 treesize of output 19 [2025-04-13 22:15:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:09,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682024032] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:09,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:09,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-04-13 22:15:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138402340] [2025-04-13 22:15:09,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:09,922 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:15:09,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:09,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:15:09,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:15:09,922 INFO L87 Difference]: Start difference. First operand 110 states and 286 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:10,452 INFO L93 Difference]: Finished difference Result 166 states and 411 transitions. [2025-04-13 22:15:10,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:15:10,453 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:10,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:10,454 INFO L225 Difference]: With dead ends: 166 [2025-04-13 22:15:10,454 INFO L226 Difference]: Without dead ends: 159 [2025-04-13 22:15:10,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:15:10,454 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:10,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-04-13 22:15:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2025-04-13 22:15:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.676470588235294) internal successors, (273), 102 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:10,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 273 transitions. [2025-04-13 22:15:10,488 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 273 transitions. Word has length 19 [2025-04-13 22:15:10,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:10,488 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 273 transitions. [2025-04-13 22:15:10,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:10,488 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 273 transitions. [2025-04-13 22:15:10,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:10,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:10,488 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:10,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:15:10,688 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-13 22:15:10,689 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-13 22:15:10,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash 586239140, now seen corresponding path program 11 times [2025-04-13 22:15:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:10,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997089473] [2025-04-13 22:15:10,689 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:10,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:10,695 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:10,702 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:10,702 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:10,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:15:10,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:10,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997089473] [2025-04-13 22:15:10,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997089473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:10,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807634194] [2025-04-13 22:15:10,945 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:10,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:10,947 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-13 22:15:10,948 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-13 22:15:11,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:11,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:11,027 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:11,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:11,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 22:15:11,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:11,097 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 112 treesize of output 72 [2025-04-13 22:15:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:11,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:11,242 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:11,242 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 109 treesize of output 56 [2025-04-13 22:15:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807634194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:11,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:11,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-04-13 22:15:11,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026832438] [2025-04-13 22:15:11,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:11,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:11,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:11,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:11,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:11,268 INFO L87 Difference]: Start difference. First operand 103 states and 273 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:11,665 INFO L93 Difference]: Finished difference Result 205 states and 467 transitions. [2025-04-13 22:15:11,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:15:11,666 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:11,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:11,667 INFO L225 Difference]: With dead ends: 205 [2025-04-13 22:15:11,667 INFO L226 Difference]: Without dead ends: 197 [2025-04-13 22:15:11,667 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:11,668 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:11,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:11,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-13 22:15:11,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 105. [2025-04-13 22:15:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.7115384615384617) internal successors, (282), 104 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 282 transitions. [2025-04-13 22:15:11,703 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 282 transitions. Word has length 19 [2025-04-13 22:15:11,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:11,703 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 282 transitions. [2025-04-13 22:15:11,704 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:11,704 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 282 transitions. [2025-04-13 22:15:11,704 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:11,704 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:11,704 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:11,710 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-13 22:15:11,904 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-13 22:15:11,904 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-13 22:15:11,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1840411113, now seen corresponding path program 12 times [2025-04-13 22:15:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:11,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434717202] [2025-04-13 22:15:11,905 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:11,910 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:11,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:11,921 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:11,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:12,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434717202] [2025-04-13 22:15:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434717202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:12,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762491444] [2025-04-13 22:15:12,148 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:12,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:12,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:12,151 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-13 22:15:12,152 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-13 22:15:12,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:12,234 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:12,234 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:12,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:12,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:15:12,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:12,353 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 91 treesize of output 59 [2025-04-13 22:15:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:12,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:12,466 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:12,466 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 44 treesize of output 28 [2025-04-13 22:15:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762491444] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:12,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:12,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783606265] [2025-04-13 22:15:12,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:12,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:12,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:12,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:12,482 INFO L87 Difference]: Start difference. First operand 105 states and 282 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:12,959 INFO L93 Difference]: Finished difference Result 177 states and 436 transitions. [2025-04-13 22:15:12,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:15:12,960 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:12,960 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:12,961 INFO L225 Difference]: With dead ends: 177 [2025-04-13 22:15:12,961 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 22:15:12,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:15:12,961 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:12,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:12,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 22:15:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 115. [2025-04-13 22:15:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.745614035087719) internal successors, (313), 114 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 313 transitions. [2025-04-13 22:15:13,002 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 313 transitions. Word has length 19 [2025-04-13 22:15:13,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:13,003 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 313 transitions. [2025-04-13 22:15:13,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:13,003 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 313 transitions. [2025-04-13 22:15:13,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:13,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:13,003 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:13,009 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-13 22:15:13,203 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-13 22:15:13,204 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-13 22:15:13,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash 497670497, now seen corresponding path program 13 times [2025-04-13 22:15:13,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:13,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484709793] [2025-04-13 22:15:13,204 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:13,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:13,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:13,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:13,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:13,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:13,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484709793] [2025-04-13 22:15:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484709793] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:13,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115441437] [2025-04-13 22:15:13,423 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:13,425 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-13 22:15:13,425 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-13 22:15:13,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:13,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:15:13,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:13,573 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 91 treesize of output 59 [2025-04-13 22:15:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:13,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:13,660 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:13,661 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 40 treesize of output 19 [2025-04-13 22:15:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115441437] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:13,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-04-13 22:15:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692981195] [2025-04-13 22:15:13,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:13,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:13,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:13,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:13,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:13,680 INFO L87 Difference]: Start difference. First operand 115 states and 313 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:14,148 INFO L93 Difference]: Finished difference Result 188 states and 463 transitions. [2025-04-13 22:15:14,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:15:14,149 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:14,149 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:14,150 INFO L225 Difference]: With dead ends: 188 [2025-04-13 22:15:14,150 INFO L226 Difference]: Without dead ends: 181 [2025-04-13 22:15:14,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:14,150 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:14,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-04-13 22:15:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 113. [2025-04-13 22:15:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.732142857142857) internal successors, (306), 112 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 306 transitions. [2025-04-13 22:15:14,191 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 306 transitions. Word has length 19 [2025-04-13 22:15:14,192 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:14,192 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 306 transitions. [2025-04-13 22:15:14,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:14,192 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 306 transitions. [2025-04-13 22:15:14,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:14,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:14,192 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:14,198 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-13 22:15:14,392 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-13 22:15:14,393 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-13 22:15:14,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:14,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1757383596, now seen corresponding path program 14 times [2025-04-13 22:15:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:14,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740751378] [2025-04-13 22:15:14,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:14,398 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:14,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:14,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:14,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:14,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:14,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740751378] [2025-04-13 22:15:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740751378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:14,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532785150] [2025-04-13 22:15:14,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:14,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:14,632 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-13 22:15:14,634 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-13 22:15:14,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:14,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:14,726 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:14,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:14,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:14,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:14,871 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 91 treesize of output 59 [2025-04-13 22:15:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:14,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:14,977 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:14,977 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 79 treesize of output 42 [2025-04-13 22:15:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532785150] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:14,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014250646] [2025-04-13 22:15:14,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:14,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:14,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:14,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:14,993 INFO L87 Difference]: Start difference. First operand 113 states and 306 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:15,367 INFO L93 Difference]: Finished difference Result 160 states and 404 transitions. [2025-04-13 22:15:15,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:15:15,367 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:15,367 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:15,368 INFO L225 Difference]: With dead ends: 160 [2025-04-13 22:15:15,368 INFO L226 Difference]: Without dead ends: 149 [2025-04-13 22:15:15,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:15,369 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:15,370 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-04-13 22:15:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 113. [2025-04-13 22:15:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.7142857142857144) internal successors, (304), 112 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 304 transitions. [2025-04-13 22:15:15,411 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 304 transitions. Word has length 19 [2025-04-13 22:15:15,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:15,411 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 304 transitions. [2025-04-13 22:15:15,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:15,411 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 304 transitions. [2025-04-13 22:15:15,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:15,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:15,412 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:15,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:15,616 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-13 22:15:15,616 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-13 22:15:15,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2076271903, now seen corresponding path program 15 times [2025-04-13 22:15:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:15,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081494213] [2025-04-13 22:15:15,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:15,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:15,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 22:15:15,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:15,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:15,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:15,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081494213] [2025-04-13 22:15:15,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081494213] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:15,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232107559] [2025-04-13 22:15:15,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:15,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:15,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:15,833 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-13 22:15:15,834 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-13 22:15:15,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:15,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 22:15:15,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:15,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:15,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:15:15,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:16,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:16,143 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:16,144 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 44 treesize of output 28 [2025-04-13 22:15:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232107559] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:16,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:15:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227782451] [2025-04-13 22:15:16,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:16,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:16,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:16,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:16,178 INFO L87 Difference]: Start difference. First operand 113 states and 304 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:16,540 INFO L93 Difference]: Finished difference Result 163 states and 408 transitions. [2025-04-13 22:15:16,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:15:16,540 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:16,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:16,541 INFO L225 Difference]: With dead ends: 163 [2025-04-13 22:15:16,541 INFO L226 Difference]: Without dead ends: 156 [2025-04-13 22:15:16,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:16,542 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:16,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-04-13 22:15:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2025-04-13 22:15:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.673076923076923) internal successors, (278), 104 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 278 transitions. [2025-04-13 22:15:16,581 INFO L79 Accepts]: Start accepts. Automaton has 105 states and 278 transitions. Word has length 19 [2025-04-13 22:15:16,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:16,581 INFO L485 AbstractCegarLoop]: Abstraction has 105 states and 278 transitions. [2025-04-13 22:15:16,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:16,581 INFO L278 IsEmpty]: Start isEmpty. Operand 105 states and 278 transitions. [2025-04-13 22:15:16,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:16,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:16,581 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:16,587 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-13 22:15:16,781 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-13 22:15:16,782 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-13 22:15:16,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:16,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1260924384, now seen corresponding path program 16 times [2025-04-13 22:15:16,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:16,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461711021] [2025-04-13 22:15:16,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:16,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:16,788 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:16,794 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:16,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:16,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:17,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:17,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461711021] [2025-04-13 22:15:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461711021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:17,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113173016] [2025-04-13 22:15:17,066 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:17,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:17,068 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-13 22:15:17,069 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-13 22:15:17,139 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:17,155 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:17,155 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:17,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:17,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:15:17,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:17,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:17,307 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:17,307 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 51 treesize of output 27 [2025-04-13 22:15:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:17,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113173016] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:17,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:17,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-04-13 22:15:17,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884663013] [2025-04-13 22:15:17,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:17,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:15:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:17,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:15:17,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:15:17,346 INFO L87 Difference]: Start difference. First operand 105 states and 278 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:17,572 INFO L93 Difference]: Finished difference Result 129 states and 334 transitions. [2025-04-13 22:15:17,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:15:17,573 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:17,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:17,574 INFO L225 Difference]: With dead ends: 129 [2025-04-13 22:15:17,574 INFO L226 Difference]: Without dead ends: 121 [2025-04-13 22:15:17,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:17,574 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:17,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-13 22:15:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2025-04-13 22:15:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.7037037037037037) internal successors, (292), 108 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 292 transitions. [2025-04-13 22:15:17,621 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 292 transitions. Word has length 19 [2025-04-13 22:15:17,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:17,622 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 292 transitions. [2025-04-13 22:15:17,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:17,622 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 292 transitions. [2025-04-13 22:15:17,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:17,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:17,622 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:17,628 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-13 22:15:17,822 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-13 22:15:17,823 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-13 22:15:17,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:17,823 INFO L85 PathProgramCache]: Analyzing trace with hash -487937307, now seen corresponding path program 17 times [2025-04-13 22:15:17,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:17,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402863017] [2025-04-13 22:15:17,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:17,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:17,829 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:17,835 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:17,835 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:15:17,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:17,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402863017] [2025-04-13 22:15:17,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402863017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:17,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348774129] [2025-04-13 22:15:17,996 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:17,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:17,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:17,998 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-13 22:15:18,000 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-13 22:15:18,080 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:18,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:18,100 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:18,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:18,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:15:18,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:18,172 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 61 treesize of output 37 [2025-04-13 22:15:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:18,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:18,329 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:18,330 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 61 [2025-04-13 22:15:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348774129] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:18,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:18,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-04-13 22:15:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397831659] [2025-04-13 22:15:18,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:18,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:15:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:18,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:15:18,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:15:18,383 INFO L87 Difference]: Start difference. First operand 109 states and 292 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:18,577 INFO L93 Difference]: Finished difference Result 124 states and 317 transitions. [2025-04-13 22:15:18,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:15:18,577 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:18,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:18,578 INFO L225 Difference]: With dead ends: 124 [2025-04-13 22:15:18,578 INFO L226 Difference]: Without dead ends: 113 [2025-04-13 22:15:18,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:15:18,579 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:18,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-13 22:15:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2025-04-13 22:15:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.685185185185185) internal successors, (290), 108 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 290 transitions. [2025-04-13 22:15:18,626 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 290 transitions. Word has length 19 [2025-04-13 22:15:18,626 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:18,626 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 290 transitions. [2025-04-13 22:15:18,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:18,627 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 290 transitions. [2025-04-13 22:15:18,627 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:18,627 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:18,627 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:18,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 22:15:18,827 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-13 22:15:18,828 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-13 22:15:18,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash 346596802, now seen corresponding path program 18 times [2025-04-13 22:15:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:18,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225453256] [2025-04-13 22:15:18,828 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:18,834 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:18,844 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:18,844 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:18,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:19,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225453256] [2025-04-13 22:15:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225453256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:19,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48001814] [2025-04-13 22:15:19,129 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:19,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:19,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:19,133 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-13 22:15:19,135 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-13 22:15:19,211 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:19,233 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:19,233 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:19,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:19,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:19,299 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 112 treesize of output 72 [2025-04-13 22:15:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:19,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:19,389 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:19,389 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 51 treesize of output 27 [2025-04-13 22:15:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:19,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48001814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:19,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278374567] [2025-04-13 22:15:19,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:19,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:19,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:19,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:19,420 INFO L87 Difference]: Start difference. First operand 109 states and 290 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:19,753 INFO L93 Difference]: Finished difference Result 150 states and 378 transitions. [2025-04-13 22:15:19,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:15:19,754 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:19,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:19,754 INFO L225 Difference]: With dead ends: 150 [2025-04-13 22:15:19,754 INFO L226 Difference]: Without dead ends: 142 [2025-04-13 22:15:19,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:19,755 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:19,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-04-13 22:15:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2025-04-13 22:15:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.7181818181818183) internal successors, (299), 110 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 299 transitions. [2025-04-13 22:15:19,798 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 299 transitions. Word has length 19 [2025-04-13 22:15:19,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:19,798 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 299 transitions. [2025-04-13 22:15:19,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:19,798 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 299 transitions. [2025-04-13 22:15:19,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:19,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:19,799 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:19,805 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-13 22:15:19,999 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-13 22:15:19,999 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-13 22:15:20,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash 371531869, now seen corresponding path program 19 times [2025-04-13 22:15:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:20,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500456647] [2025-04-13 22:15:20,000 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:20,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:20,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:20,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:20,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:20,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:20,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500456647] [2025-04-13 22:15:20,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500456647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:20,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345044585] [2025-04-13 22:15:20,196 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:20,198 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-13 22:15:20,199 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-13 22:15:20,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:20,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:20,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:20,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:15:20,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:20,370 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 91 treesize of output 59 [2025-04-13 22:15:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:20,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:20,497 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:20,497 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 87 treesize of output 47 [2025-04-13 22:15:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345044585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:20,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-04-13 22:15:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078896844] [2025-04-13 22:15:20,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:20,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:20,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:20,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:20,538 INFO L87 Difference]: Start difference. First operand 111 states and 299 transitions. Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:20,928 INFO L93 Difference]: Finished difference Result 146 states and 370 transitions. [2025-04-13 22:15:20,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:15:20,928 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:20,928 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:20,929 INFO L225 Difference]: With dead ends: 146 [2025-04-13 22:15:20,929 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 22:15:20,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:20,930 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:20,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:20,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 22:15:20,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 115. [2025-04-13 22:15:20,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.692982456140351) internal successors, (307), 114 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 307 transitions. [2025-04-13 22:15:20,982 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 307 transitions. Word has length 19 [2025-04-13 22:15:20,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:20,982 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 307 transitions. [2025-04-13 22:15:20,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:20,982 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 307 transitions. [2025-04-13 22:15:20,982 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:20,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:20,983 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:20,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:21,187 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-13 22:15:21,187 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-13 22:15:21,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash 260709349, now seen corresponding path program 20 times [2025-04-13 22:15:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:21,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644416878] [2025-04-13 22:15:21,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:21,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:21,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:21,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:21,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:21,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:21,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:21,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644416878] [2025-04-13 22:15:21,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644416878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:21,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860471290] [2025-04-13 22:15:21,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:21,411 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-13 22:15:21,412 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-13 22:15:21,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:21,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:21,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:21,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:21,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:21,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:21,578 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 112 treesize of output 72 [2025-04-13 22:15:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:21,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:21,654 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:21,654 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 61 [2025-04-13 22:15:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:21,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860471290] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:21,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:21,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940899771] [2025-04-13 22:15:21,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:21,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:21,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:21,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:21,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:21,692 INFO L87 Difference]: Start difference. First operand 115 states and 307 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:21,922 INFO L93 Difference]: Finished difference Result 135 states and 346 transitions. [2025-04-13 22:15:21,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:15:21,922 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:21,922 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:21,923 INFO L225 Difference]: With dead ends: 135 [2025-04-13 22:15:21,923 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 22:15:21,923 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:21,923 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:21,923 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 22:15:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2025-04-13 22:15:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.685185185185185) internal successors, (290), 108 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 290 transitions. [2025-04-13 22:15:21,968 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 290 transitions. Word has length 19 [2025-04-13 22:15:21,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:21,968 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 290 transitions. [2025-04-13 22:15:21,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:21,968 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 290 transitions. [2025-04-13 22:15:21,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:21,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:21,968 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:21,974 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-13 22:15:22,169 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-13 22:15:22,169 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-13 22:15:22,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2072962946, now seen corresponding path program 21 times [2025-04-13 22:15:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:22,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074902263] [2025-04-13 22:15:22,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:22,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:22,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:22,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:15:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:22,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074902263] [2025-04-13 22:15:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074902263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:22,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181210955] [2025-04-13 22:15:22,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:22,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:22,541 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-13 22:15:22,542 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-13 22:15:22,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:22,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:22,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:22,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:22,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:22,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:22,721 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 91 treesize of output 59 [2025-04-13 22:15:22,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:22,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:22,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:22,831 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 87 treesize of output 47 [2025-04-13 22:15:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:22,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181210955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:22,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 24 [2025-04-13 22:15:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705694008] [2025-04-13 22:15:22,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:22,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:15:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:22,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:15:22,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:15:22,899 INFO L87 Difference]: Start difference. First operand 109 states and 290 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:23,267 INFO L93 Difference]: Finished difference Result 145 states and 363 transitions. [2025-04-13 22:15:23,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:15:23,268 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:23,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:23,268 INFO L225 Difference]: With dead ends: 145 [2025-04-13 22:15:23,268 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 22:15:23,269 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:15:23,269 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:23,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 22:15:23,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2025-04-13 22:15:23,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.650943396226415) internal successors, (281), 106 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 281 transitions. [2025-04-13 22:15:23,311 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 281 transitions. Word has length 19 [2025-04-13 22:15:23,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:23,311 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 281 transitions. [2025-04-13 22:15:23,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:23,311 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 281 transitions. [2025-04-13 22:15:23,311 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:23,311 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:23,311 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:23,318 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-13 22:15:23,512 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-13 22:15:23,512 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-13 22:15:23,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1987075493, now seen corresponding path program 22 times [2025-04-13 22:15:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:23,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585162685] [2025-04-13 22:15:23,513 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:23,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:23,525 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:23,525 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:23,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:23,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:23,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:23,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585162685] [2025-04-13 22:15:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585162685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:23,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118674423] [2025-04-13 22:15:23,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:23,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:23,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:23,757 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-13 22:15:23,758 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-13 22:15:23,832 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:23,849 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:23,849 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:23,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:23,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:15:23,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:23,961 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 112 treesize of output 72 [2025-04-13 22:15:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:24,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:24,124 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:24,124 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 54 treesize of output 30 [2025-04-13 22:15:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118674423] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:24,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:24,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-04-13 22:15:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219471859] [2025-04-13 22:15:24,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:24,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:15:24,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:24,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:15:24,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:15:24,173 INFO L87 Difference]: Start difference. First operand 107 states and 281 transitions. Second operand has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:24,916 INFO L93 Difference]: Finished difference Result 213 states and 492 transitions. [2025-04-13 22:15:24,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:15:24,917 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:24,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:24,918 INFO L225 Difference]: With dead ends: 213 [2025-04-13 22:15:24,918 INFO L226 Difference]: Without dead ends: 204 [2025-04-13 22:15:24,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:15:24,919 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:24,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-04-13 22:15:24,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 113. [2025-04-13 22:15:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.732142857142857) internal successors, (306), 112 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 306 transitions. [2025-04-13 22:15:24,967 INFO L79 Accepts]: Start accepts. Automaton has 113 states and 306 transitions. Word has length 19 [2025-04-13 22:15:24,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:24,967 INFO L485 AbstractCegarLoop]: Abstraction has 113 states and 306 transitions. [2025-04-13 22:15:24,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:24,967 INFO L278 IsEmpty]: Start isEmpty. Operand 113 states and 306 transitions. [2025-04-13 22:15:24,967 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:24,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:24,967 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:24,974 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-13 22:15:25,168 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-13 22:15:25,168 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-13 22:15:25,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -589548097, now seen corresponding path program 23 times [2025-04-13 22:15:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:25,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963327400] [2025-04-13 22:15:25,168 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:25,174 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:25,181 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:25,182 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:25,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:25,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:25,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963327400] [2025-04-13 22:15:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963327400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:25,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806038896] [2025-04-13 22:15:25,351 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:25,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:25,353 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-13 22:15:25,354 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-13 22:15:25,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:25,454 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:25,454 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:25,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:25,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:15:25,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:25,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:25,603 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:25,603 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 51 treesize of output 27 [2025-04-13 22:15:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806038896] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:25,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2025-04-13 22:15:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260368211] [2025-04-13 22:15:25,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:25,634 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:25,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:25,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:25,634 INFO L87 Difference]: Start difference. First operand 113 states and 306 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:25,907 INFO L93 Difference]: Finished difference Result 142 states and 361 transitions. [2025-04-13 22:15:25,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:15:25,908 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:25,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:25,909 INFO L225 Difference]: With dead ends: 142 [2025-04-13 22:15:25,909 INFO L226 Difference]: Without dead ends: 129 [2025-04-13 22:15:25,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:25,909 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:25,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-13 22:15:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2025-04-13 22:15:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.6372549019607843) internal successors, (269), 102 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 269 transitions. [2025-04-13 22:15:25,953 INFO L79 Accepts]: Start accepts. Automaton has 103 states and 269 transitions. Word has length 19 [2025-04-13 22:15:25,953 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:25,953 INFO L485 AbstractCegarLoop]: Abstraction has 103 states and 269 transitions. [2025-04-13 22:15:25,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:25,953 INFO L278 IsEmpty]: Start isEmpty. Operand 103 states and 269 transitions. [2025-04-13 22:15:25,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:25,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:25,953 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:25,959 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-13 22:15:26,153 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-13 22:15:26,154 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-13 22:15:26,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 299802626, now seen corresponding path program 24 times [2025-04-13 22:15:26,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:26,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146873198] [2025-04-13 22:15:26,154 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:26,159 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:26,168 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:26,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:26,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:26,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:26,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146873198] [2025-04-13 22:15:26,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146873198] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:26,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127993311] [2025-04-13 22:15:26,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:26,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:26,383 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-13 22:15:26,384 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-13 22:15:26,462 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:26,480 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:26,480 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:26,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:26,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:26,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:26,557 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 82 treesize of output 50 [2025-04-13 22:15:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:26,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:26,611 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:26,611 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 61 [2025-04-13 22:15:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127993311] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:26,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358262987] [2025-04-13 22:15:26,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:26,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:26,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:26,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:26,657 INFO L87 Difference]: Start difference. First operand 103 states and 269 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:26,909 INFO L93 Difference]: Finished difference Result 121 states and 301 transitions. [2025-04-13 22:15:26,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:15:26,909 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:26,910 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:26,910 INFO L225 Difference]: With dead ends: 121 [2025-04-13 22:15:26,910 INFO L226 Difference]: Without dead ends: 107 [2025-04-13 22:15:26,910 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:15:26,911 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:26,911 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-13 22:15:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2025-04-13 22:15:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 2.62) internal successors, (262), 100 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 262 transitions. [2025-04-13 22:15:26,955 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 262 transitions. Word has length 19 [2025-04-13 22:15:26,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:26,956 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 262 transitions. [2025-04-13 22:15:26,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:26,956 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 262 transitions. [2025-04-13 22:15:26,956 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:26,956 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:26,956 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:26,962 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-13 22:15:27,156 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-13 22:15:27,157 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-13 22:15:27,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1833472582, now seen corresponding path program 25 times [2025-04-13 22:15:27,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:27,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837146405] [2025-04-13 22:15:27,158 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:27,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:27,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:27,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:27,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:27,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:27,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837146405] [2025-04-13 22:15:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837146405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:27,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258435640] [2025-04-13 22:15:27,412 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:27,414 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-13 22:15:27,415 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-13 22:15:27,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:27,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:27,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:27,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:27,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:15:27,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:27,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:27,733 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:27,733 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 40 treesize of output 19 [2025-04-13 22:15:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258435640] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:27,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-13 22:15:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085720042] [2025-04-13 22:15:27,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:27,743 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:27,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:27,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:27,744 INFO L87 Difference]: Start difference. First operand 101 states and 262 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:28,089 INFO L93 Difference]: Finished difference Result 180 states and 446 transitions. [2025-04-13 22:15:28,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:15:28,089 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:28,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:28,090 INFO L225 Difference]: With dead ends: 180 [2025-04-13 22:15:28,090 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 22:15:28,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:15:28,091 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:28,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 22:15:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 97. [2025-04-13 22:15:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.625) internal successors, (252), 96 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 252 transitions. [2025-04-13 22:15:28,134 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 252 transitions. Word has length 19 [2025-04-13 22:15:28,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:28,134 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 252 transitions. [2025-04-13 22:15:28,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:28,134 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 252 transitions. [2025-04-13 22:15:28,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:28,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:28,134 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:28,141 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-13 22:15:28,335 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-13 22:15:28,335 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-13 22:15:28,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1587754034, now seen corresponding path program 26 times [2025-04-13 22:15:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:28,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886316387] [2025-04-13 22:15:28,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:28,341 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:28,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:28,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:28,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:28,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886316387] [2025-04-13 22:15:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886316387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:28,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566633457] [2025-04-13 22:15:28,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:28,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:28,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:28,575 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-13 22:15:28,576 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-13 22:15:28,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:28,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:28,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:28,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:28,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:15:28,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:28,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:28,880 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:28,880 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2025-04-13 22:15:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566633457] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:28,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 18 [2025-04-13 22:15:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331258808] [2025-04-13 22:15:28,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:28,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:28,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:28,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:28,898 INFO L87 Difference]: Start difference. First operand 97 states and 252 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:29,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:29,533 INFO L93 Difference]: Finished difference Result 165 states and 396 transitions. [2025-04-13 22:15:29,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:15:29,534 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:29,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:29,534 INFO L225 Difference]: With dead ends: 165 [2025-04-13 22:15:29,534 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 22:15:29,535 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=929, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:15:29,535 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:29,535 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 22:15:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 97. [2025-04-13 22:15:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.625) internal successors, (252), 96 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 252 transitions. [2025-04-13 22:15:29,579 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 252 transitions. Word has length 19 [2025-04-13 22:15:29,579 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:29,579 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 252 transitions. [2025-04-13 22:15:29,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:29,579 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 252 transitions. [2025-04-13 22:15:29,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:29,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:29,580 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:29,586 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-13 22:15:29,780 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-13 22:15:29,780 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-13 22:15:29,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -814766957, now seen corresponding path program 27 times [2025-04-13 22:15:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:29,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007829535] [2025-04-13 22:15:29,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:29,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:29,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 22:15:29,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:29,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:29,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007829535] [2025-04-13 22:15:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007829535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:29,991 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952932758] [2025-04-13 22:15:29,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:29,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:29,993 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-13 22:15:29,994 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-13 22:15:30,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:30,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 22:15:30,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:30,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:30,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:30,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:30,194 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 82 treesize of output 50 [2025-04-13 22:15:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:30,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:30,285 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:30,285 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 109 treesize of output 56 [2025-04-13 22:15:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952932758] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:30,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642788481] [2025-04-13 22:15:30,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:30,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:30,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:30,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:30,303 INFO L87 Difference]: Start difference. First operand 97 states and 252 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:30,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:30,609 INFO L93 Difference]: Finished difference Result 137 states and 330 transitions. [2025-04-13 22:15:30,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:15:30,609 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:30,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:30,610 INFO L225 Difference]: With dead ends: 137 [2025-04-13 22:15:30,610 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 22:15:30,610 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:30,611 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:30,611 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 22:15:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 97. [2025-04-13 22:15:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.6041666666666665) internal successors, (250), 96 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 250 transitions. [2025-04-13 22:15:30,661 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 250 transitions. Word has length 19 [2025-04-13 22:15:30,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:30,661 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 250 transitions. [2025-04-13 22:15:30,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:30,661 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 250 transitions. [2025-04-13 22:15:30,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:30,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:30,661 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:30,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 22:15:30,862 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-13 22:15:30,862 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-13 22:15:30,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:30,862 INFO L85 PathProgramCache]: Analyzing trace with hash 19767152, now seen corresponding path program 28 times [2025-04-13 22:15:30,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:30,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363067017] [2025-04-13 22:15:30,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:30,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:30,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:30,873 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:30,873 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:30,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:31,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:31,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363067017] [2025-04-13 22:15:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363067017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:31,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359481750] [2025-04-13 22:15:31,064 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:31,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:31,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:31,066 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-13 22:15:31,067 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-13 22:15:31,147 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:31,163 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:31,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:31,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:31,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:15:31,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:31,246 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 91 treesize of output 59 [2025-04-13 22:15:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:31,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:31,410 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:31,410 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 44 treesize of output 28 [2025-04-13 22:15:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359481750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:31,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:31,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-13 22:15:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850437248] [2025-04-13 22:15:31,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:31,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:31,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:31,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:31,426 INFO L87 Difference]: Start difference. First operand 97 states and 250 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:32,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:32,731 INFO L93 Difference]: Finished difference Result 233 states and 523 transitions. [2025-04-13 22:15:32,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:15:32,731 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:32,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:32,732 INFO L225 Difference]: With dead ends: 233 [2025-04-13 22:15:32,732 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 22:15:32,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=595, Invalid=2267, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:15:32,733 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:32,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 22:15:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 97. [2025-04-13 22:15:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.6041666666666665) internal successors, (250), 96 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 250 transitions. [2025-04-13 22:15:32,779 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 250 transitions. Word has length 19 [2025-04-13 22:15:32,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:32,779 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 250 transitions. [2025-04-13 22:15:32,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:32,780 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 250 transitions. [2025-04-13 22:15:32,780 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:32,780 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:32,780 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:32,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 22:15:32,980 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-13 22:15:32,980 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-13 22:15:32,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:32,981 INFO L85 PathProgramCache]: Analyzing trace with hash -68801491, now seen corresponding path program 29 times [2025-04-13 22:15:32,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:32,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370032967] [2025-04-13 22:15:32,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:32,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:32,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:32,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:32,994 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:32,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:15:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:33,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370032967] [2025-04-13 22:15:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370032967] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:33,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791501562] [2025-04-13 22:15:33,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:33,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:33,188 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-13 22:15:33,189 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-13 22:15:33,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:33,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:33,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:33,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:33,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 22:15:33,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:33,363 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 112 treesize of output 72 [2025-04-13 22:15:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:33,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:33,455 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:15:33,455 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 109 treesize of output 56 [2025-04-13 22:15:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:33,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791501562] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:33,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:33,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-04-13 22:15:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134513611] [2025-04-13 22:15:33,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:33,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:15:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:33,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:15:33,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:15:33,471 INFO L87 Difference]: Start difference. First operand 97 states and 250 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:33,917 INFO L93 Difference]: Finished difference Result 156 states and 371 transitions. [2025-04-13 22:15:33,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:15:33,917 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:33,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:33,918 INFO L225 Difference]: With dead ends: 156 [2025-04-13 22:15:33,918 INFO L226 Difference]: Without dead ends: 147 [2025-04-13 22:15:33,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:33,919 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:33,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-13 22:15:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 97. [2025-04-13 22:15:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 2.6041666666666665) internal successors, (250), 96 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 250 transitions. [2025-04-13 22:15:33,967 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 250 transitions. Word has length 19 [2025-04-13 22:15:33,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:33,967 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 250 transitions. [2025-04-13 22:15:33,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:33,967 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 250 transitions. [2025-04-13 22:15:33,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:33,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:33,968 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:33,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:34,168 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-13 22:15:34,168 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-13 22:15:34,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash -271596730, now seen corresponding path program 30 times [2025-04-13 22:15:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:34,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14047] [2025-04-13 22:15:34,169 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:34,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:34,174 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:34,182 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:34,182 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:34,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:34,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14047] [2025-04-13 22:15:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:34,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853164008] [2025-04-13 22:15:34,398 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:34,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:34,400 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-13 22:15:34,401 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-13 22:15:34,484 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:34,507 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:34,507 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:34,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:34,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:15:34,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:34,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:34,702 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:34,702 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 54 treesize of output 30 [2025-04-13 22:15:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853164008] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:34,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:34,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:15:34,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500793517] [2025-04-13 22:15:34,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:34,744 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:15:34,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:34,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:15:34,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:15:34,744 INFO L87 Difference]: Start difference. First operand 97 states and 250 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:35,059 INFO L93 Difference]: Finished difference Result 138 states and 335 transitions. [2025-04-13 22:15:35,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:15:35,060 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:35,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:35,060 INFO L225 Difference]: With dead ends: 138 [2025-04-13 22:15:35,060 INFO L226 Difference]: Without dead ends: 130 [2025-04-13 22:15:35,061 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:35,061 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:35,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-13 22:15:35,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2025-04-13 22:15:35,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.5851063829787235) internal successors, (243), 94 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:35,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 243 transitions. [2025-04-13 22:15:35,106 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 243 transitions. Word has length 19 [2025-04-13 22:15:35,106 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:35,106 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 243 transitions. [2025-04-13 22:15:35,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:35,106 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 243 transitions. [2025-04-13 22:15:35,106 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:35,106 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:35,107 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:35,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 22:15:35,307 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-13 22:15:35,307 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-13 22:15:35,307 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash 501390347, now seen corresponding path program 31 times [2025-04-13 22:15:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:35,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457177631] [2025-04-13 22:15:35,307 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:35,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:35,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:35,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:35,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:35,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:35,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457177631] [2025-04-13 22:15:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457177631] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:35,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859638476] [2025-04-13 22:15:35,517 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:35,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:35,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:35,519 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-13 22:15:35,523 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-13 22:15:35,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:15:35,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:35,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:35,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:35,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:15:35,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:35,700 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 61 treesize of output 37 [2025-04-13 22:15:35,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:35,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:35,790 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:35,791 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 87 treesize of output 47 [2025-04-13 22:15:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:35,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859638476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:35,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:35,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-04-13 22:15:35,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785503828] [2025-04-13 22:15:35,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:35,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:35,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:35,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:35,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:35,829 INFO L87 Difference]: Start difference. First operand 95 states and 243 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:36,083 INFO L93 Difference]: Finished difference Result 114 states and 275 transitions. [2025-04-13 22:15:36,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:15:36,083 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:36,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:36,084 INFO L225 Difference]: With dead ends: 114 [2025-04-13 22:15:36,084 INFO L226 Difference]: Without dead ends: 103 [2025-04-13 22:15:36,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:36,085 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:36,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-13 22:15:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-04-13 22:15:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.5638297872340425) internal successors, (241), 94 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2025-04-13 22:15:36,130 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2025-04-13 22:15:36,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:36,130 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2025-04-13 22:15:36,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:36,130 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2025-04-13 22:15:36,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:36,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:36,130 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:36,137 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-13 22:15:36,331 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-13 22:15:36,331 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-13 22:15:36,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1333243266, now seen corresponding path program 32 times [2025-04-13 22:15:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:36,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192826422] [2025-04-13 22:15:36,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:36,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:36,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:36,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:36,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:36,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192826422] [2025-04-13 22:15:36,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192826422] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:36,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880314300] [2025-04-13 22:15:36,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:36,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:36,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:36,528 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-13 22:15:36,529 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-13 22:15:36,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:36,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:36,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:36,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:36,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:15:36,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:36,731 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 91 treesize of output 59 [2025-04-13 22:15:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:36,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:36,810 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:36,811 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 54 treesize of output 30 [2025-04-13 22:15:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880314300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:36,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:36,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-04-13 22:15:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345963441] [2025-04-13 22:15:36,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:36,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:15:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:36,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:15:36,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:15:36,847 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:37,171 INFO L93 Difference]: Finished difference Result 140 states and 338 transitions. [2025-04-13 22:15:37,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:15:37,172 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:37,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:37,173 INFO L225 Difference]: With dead ends: 140 [2025-04-13 22:15:37,173 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 22:15:37,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:15:37,173 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:37,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 22:15:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2025-04-13 22:15:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.5638297872340425) internal successors, (241), 94 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 241 transitions. [2025-04-13 22:15:37,219 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 241 transitions. Word has length 19 [2025-04-13 22:15:37,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:37,219 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 241 transitions. [2025-04-13 22:15:37,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:37,219 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 241 transitions. [2025-04-13 22:15:37,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:37,219 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:37,220 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:37,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 22:15:37,420 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-13 22:15:37,420 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-13 22:15:37,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1247355813, now seen corresponding path program 33 times [2025-04-13 22:15:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:37,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708641145] [2025-04-13 22:15:37,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:37,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:37,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:37,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:37,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:15:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:37,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708641145] [2025-04-13 22:15:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708641145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:37,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833207543] [2025-04-13 22:15:37,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:37,717 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-13 22:15:37,718 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-13 22:15:37,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:37,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:37,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:37,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:37,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:37,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:37,910 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 112 treesize of output 72 [2025-04-13 22:15:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:37,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:37,990 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:37,990 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 61 [2025-04-13 22:15:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:38,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833207543] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:38,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:38,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 19 [2025-04-13 22:15:38,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878121010] [2025-04-13 22:15:38,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:38,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:15:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:38,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:15:38,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:15:38,027 INFO L87 Difference]: Start difference. First operand 95 states and 241 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:38,293 INFO L93 Difference]: Finished difference Result 117 states and 287 transitions. [2025-04-13 22:15:38,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:15:38,293 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:38,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:38,294 INFO L225 Difference]: With dead ends: 117 [2025-04-13 22:15:38,294 INFO L226 Difference]: Without dead ends: 108 [2025-04-13 22:15:38,294 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:38,294 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:38,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-13 22:15:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 87. [2025-04-13 22:15:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.4767441860465116) internal successors, (213), 86 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 213 transitions. [2025-04-13 22:15:38,336 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 213 transitions. Word has length 19 [2025-04-13 22:15:38,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:38,336 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 213 transitions. [2025-04-13 22:15:38,337 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:38,337 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 213 transitions. [2025-04-13 22:15:38,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:38,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:38,337 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:38,343 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-13 22:15:38,537 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-13 22:15:38,537 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-13 22:15:38,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:38,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1232676696, now seen corresponding path program 34 times [2025-04-13 22:15:38,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:38,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194075378] [2025-04-13 22:15:38,538 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:38,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:38,543 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:38,549 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:38,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:38,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:38,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194075378] [2025-04-13 22:15:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194075378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:38,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204234406] [2025-04-13 22:15:38,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:38,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:38,756 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-13 22:15:38,757 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-13 22:15:38,844 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 22:15:38,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:38,861 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:38,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:38,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:15:38,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:38,981 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 91 treesize of output 59 [2025-04-13 22:15:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:39,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:39,125 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:39,125 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 125 treesize of output 69 [2025-04-13 22:15:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204234406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:39,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-04-13 22:15:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490894233] [2025-04-13 22:15:39,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:39,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:39,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:39,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:39,175 INFO L87 Difference]: Start difference. First operand 87 states and 213 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:39,639 INFO L93 Difference]: Finished difference Result 171 states and 363 transitions. [2025-04-13 22:15:39,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:15:39,639 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:39,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:39,640 INFO L225 Difference]: With dead ends: 171 [2025-04-13 22:15:39,640 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 22:15:39,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:15:39,641 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:39,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 22:15:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 85. [2025-04-13 22:15:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.4285714285714284) internal successors, (204), 84 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 204 transitions. [2025-04-13 22:15:39,682 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 204 transitions. Word has length 19 [2025-04-13 22:15:39,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:39,683 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 204 transitions. [2025-04-13 22:15:39,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:39,683 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 204 transitions. [2025-04-13 22:15:39,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:39,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:39,683 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:39,689 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-13 22:15:39,883 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-13 22:15:39,883 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-13 22:15:39,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1205060439, now seen corresponding path program 35 times [2025-04-13 22:15:39,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:39,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821840728] [2025-04-13 22:15:39,884 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:39,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:39,889 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:39,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:39,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:39,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:15:40,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:40,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821840728] [2025-04-13 22:15:40,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821840728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:40,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532355478] [2025-04-13 22:15:40,056 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:40,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:40,058 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-13 22:15:40,059 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-13 22:15:40,148 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:40,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:40,168 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:40,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:40,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:15:40,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:40,265 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 91 treesize of output 59 [2025-04-13 22:15:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:40,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:40,353 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:40,353 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 51 treesize of output 27 [2025-04-13 22:15:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532355478] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:40,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:40,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:15:40,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988348959] [2025-04-13 22:15:40,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:40,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:15:40,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:40,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:15:40,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:15:40,380 INFO L87 Difference]: Start difference. First operand 85 states and 204 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:40,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:40,795 INFO L93 Difference]: Finished difference Result 128 states and 286 transitions. [2025-04-13 22:15:40,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:15:40,796 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:40,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:40,796 INFO L225 Difference]: With dead ends: 128 [2025-04-13 22:15:40,796 INFO L226 Difference]: Without dead ends: 119 [2025-04-13 22:15:40,797 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:15:40,797 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:40,797 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:40,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-13 22:15:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2025-04-13 22:15:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.4555555555555557) internal successors, (221), 90 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 221 transitions. [2025-04-13 22:15:40,843 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 221 transitions. Word has length 19 [2025-04-13 22:15:40,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:40,843 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 221 transitions. [2025-04-13 22:15:40,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:40,843 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 221 transitions. [2025-04-13 22:15:40,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:15:40,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:40,844 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:40,850 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-13 22:15:41,044 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-13 22:15:41,044 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-13 22:15:41,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:41,044 INFO L85 PathProgramCache]: Analyzing trace with hash 402460747, now seen corresponding path program 36 times [2025-04-13 22:15:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:41,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282916711] [2025-04-13 22:15:41,045 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:41,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:41,050 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:41,058 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:41,058 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:41,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:41,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282916711] [2025-04-13 22:15:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282916711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:41,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862344083] [2025-04-13 22:15:41,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:41,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:41,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:41,253 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-13 22:15:41,254 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-13 22:15:41,344 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-04-13 22:15:41,361 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:15:41,362 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:41,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:41,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:15:41,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:41,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:41,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:41,528 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 54 treesize of output 30 [2025-04-13 22:15:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862344083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:41,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:41,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 17 [2025-04-13 22:15:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75791217] [2025-04-13 22:15:41,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:41,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:15:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:41,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:15:41,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:15:41,555 INFO L87 Difference]: Start difference. First operand 91 states and 221 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:41,856 INFO L93 Difference]: Finished difference Result 128 states and 283 transitions. [2025-04-13 22:15:41,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:15:41,856 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:15:41,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:41,857 INFO L225 Difference]: With dead ends: 128 [2025-04-13 22:15:41,857 INFO L226 Difference]: Without dead ends: 121 [2025-04-13 22:15:41,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:41,857 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:41,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-04-13 22:15:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2025-04-13 22:15:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 2.3780487804878048) internal successors, (195), 82 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 195 transitions. [2025-04-13 22:15:41,900 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 195 transitions. Word has length 19 [2025-04-13 22:15:41,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:41,900 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 195 transitions. [2025-04-13 22:15:41,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:41,900 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 195 transitions. [2025-04-13 22:15:41,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:15:41,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:41,901 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:41,907 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-13 22:15:42,101 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-13 22:15:42,101 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-13 22:15:42,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:42,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1310199819, now seen corresponding path program 37 times [2025-04-13 22:15:42,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:42,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705299243] [2025-04-13 22:15:42,102 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:42,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:15:42,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:42,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:42,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:15:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:42,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705299243] [2025-04-13 22:15:42,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705299243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:42,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832905319] [2025-04-13 22:15:42,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:42,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:42,575 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-13 22:15:42,576 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-13 22:15:42,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:15:42,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:42,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:42,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:42,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:15:42,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:42,888 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 194 treesize of output 104 [2025-04-13 22:15:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:42,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:43,471 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:43,471 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 278 treesize of output 160 [2025-04-13 22:15:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832905319] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:43,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:43,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-04-13 22:15:43,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48515291] [2025-04-13 22:15:43,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:43,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:43,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:43,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:43,590 INFO L87 Difference]: Start difference. First operand 83 states and 195 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:15:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:46,384 INFO L93 Difference]: Finished difference Result 202 states and 444 transitions. [2025-04-13 22:15:46,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:15:46,385 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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) Word has length 20 [2025-04-13 22:15:46,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:46,386 INFO L225 Difference]: With dead ends: 202 [2025-04-13 22:15:46,386 INFO L226 Difference]: Without dead ends: 168 [2025-04-13 22:15:46,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=442, Invalid=3098, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:15:46,387 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:46,387 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:15:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-13 22:15:46,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 104. [2025-04-13 22:15:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.5242718446601944) internal successors, (260), 103 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 260 transitions. [2025-04-13 22:15:46,455 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 260 transitions. Word has length 20 [2025-04-13 22:15:46,456 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:46,456 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 260 transitions. [2025-04-13 22:15:46,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:15:46,456 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 260 transitions. [2025-04-13 22:15:46,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:15:46,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:46,456 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:46,462 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-13 22:15:46,656 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-13 22:15:46,657 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-13 22:15:46,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 443993095, now seen corresponding path program 38 times [2025-04-13 22:15:46,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:46,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910446693] [2025-04-13 22:15:46,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:46,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:46,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:15:46,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:46,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:46,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:15:47,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:47,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910446693] [2025-04-13 22:15:47,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910446693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:47,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927039733] [2025-04-13 22:15:47,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:47,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:47,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:47,100 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-13 22:15:47,101 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-13 22:15:47,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:15:47,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:47,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:47,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:47,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:15:47,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:47,401 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 164 treesize of output 104 [2025-04-13 22:15:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:15:47,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:48,005 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:48,005 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 282 treesize of output 178 [2025-04-13 22:15:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927039733] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 28 [2025-04-13 22:15:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849552899] [2025-04-13 22:15:48,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:48,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:48,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:48,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:48,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:48,181 INFO L87 Difference]: Start difference. First operand 104 states and 260 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:15:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:50,298 INFO L93 Difference]: Finished difference Result 319 states and 712 transitions. [2025-04-13 22:15:50,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:15:50,298 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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) Word has length 20 [2025-04-13 22:15:50,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:50,300 INFO L225 Difference]: With dead ends: 319 [2025-04-13 22:15:50,300 INFO L226 Difference]: Without dead ends: 292 [2025-04-13 22:15:50,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=449, Invalid=3333, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:15:50,300 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:50,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:15:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-13 22:15:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 130. [2025-04-13 22:15:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.7829457364341086) internal successors, (359), 129 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 359 transitions. [2025-04-13 22:15:50,392 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 359 transitions. Word has length 20 [2025-04-13 22:15:50,392 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:50,392 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 359 transitions. [2025-04-13 22:15:50,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:15:50,393 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 359 transitions. [2025-04-13 22:15:50,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:15:50,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:50,393 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:50,400 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-13 22:15:50,593 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-13 22:15:50,594 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-13 22:15:50,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 881532153, now seen corresponding path program 39 times [2025-04-13 22:15:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:50,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189264930] [2025-04-13 22:15:50,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:50,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:15:50,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:50,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:50,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:50,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189264930] [2025-04-13 22:15:50,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189264930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:50,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852179191] [2025-04-13 22:15:50,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:50,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:50,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:50,963 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-13 22:15:50,965 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-13 22:15:51,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:15:51,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:51,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:51,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:51,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:15:51,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:51,116 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-13 22:15:51,127 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 19 treesize of output 1 [2025-04-13 22:15:51,293 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 116 treesize of output 76 [2025-04-13 22:15:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:15:51,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852179191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:52,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:52,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 30 [2025-04-13 22:15:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074956990] [2025-04-13 22:15:52,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:52,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:15:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:52,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:15:52,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:15:52,332 INFO L87 Difference]: Start difference. First operand 130 states and 359 transitions. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:15:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:55,641 INFO L93 Difference]: Finished difference Result 386 states and 921 transitions. [2025-04-13 22:15:55,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:15:55,641 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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) Word has length 20 [2025-04-13 22:15:55,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:55,643 INFO L225 Difference]: With dead ends: 386 [2025-04-13 22:15:55,643 INFO L226 Difference]: Without dead ends: 373 [2025-04-13 22:15:55,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=421, Invalid=3611, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:15:55,643 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:55,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:15:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-13 22:15:55,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 142. [2025-04-13 22:15:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.858156028368794) internal successors, (403), 141 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 403 transitions. [2025-04-13 22:15:55,753 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 403 transitions. Word has length 20 [2025-04-13 22:15:55,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:55,753 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 403 transitions. [2025-04-13 22:15:55,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:15:55,753 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 403 transitions. [2025-04-13 22:15:55,754 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:15:55,754 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:55,754 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:55,760 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-13 22:15:55,954 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-13 22:15:55,954 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-13 22:15:55,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2051514281, now seen corresponding path program 40 times [2025-04-13 22:15:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:55,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665328741] [2025-04-13 22:15:55,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:55,962 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:15:55,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:55,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:55,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:15:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:56,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665328741] [2025-04-13 22:15:56,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665328741] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:56,360 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683081846] [2025-04-13 22:15:56,360 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:56,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:56,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:56,362 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-13 22:15:56,364 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-13 22:15:56,467 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:15:56,486 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:56,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:56,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:56,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:15:56,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:56,581 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 187 treesize of output 103 [2025-04-13 22:15:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:15:56,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:57,270 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:57,270 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 223 treesize of output 151 [2025-04-13 22:15:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:57,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683081846] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:57,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2025-04-13 22:15:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306622503] [2025-04-13 22:15:57,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:57,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:15:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:57,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:15:57,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:57,553 INFO L87 Difference]: Start difference. First operand 142 states and 403 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 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-13 22:15:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:59,634 INFO L93 Difference]: Finished difference Result 331 states and 818 transitions. [2025-04-13 22:15:59,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:15:59,634 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 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) Word has length 20 [2025-04-13 22:15:59,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:59,635 INFO L225 Difference]: With dead ends: 331 [2025-04-13 22:15:59,635 INFO L226 Difference]: Without dead ends: 318 [2025-04-13 22:15:59,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=244, Invalid=2012, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:15:59,636 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:59,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 1811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:15:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-13 22:15:59,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 167. [2025-04-13 22:15:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 3.0602409638554215) internal successors, (508), 166 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:15:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 508 transitions. [2025-04-13 22:15:59,767 INFO L79 Accepts]: Start accepts. Automaton has 167 states and 508 transitions. Word has length 20 [2025-04-13 22:15:59,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:59,767 INFO L485 AbstractCegarLoop]: Abstraction has 167 states and 508 transitions. [2025-04-13 22:15:59,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 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-13 22:15:59,767 INFO L278 IsEmpty]: Start isEmpty. Operand 167 states and 508 transitions. [2025-04-13 22:15:59,767 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:15:59,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:59,767 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:15:59,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:59,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:59,968 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:15:59,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash 33955897, now seen corresponding path program 41 times [2025-04-13 22:15:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:59,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913358754] [2025-04-13 22:15:59,968 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:59,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:15:59,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:15:59,982 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:15:59,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:00,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913358754] [2025-04-13 22:16:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913358754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:00,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948603194] [2025-04-13 22:16:00,449 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:00,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:00,450 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:00,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 22:16:00,550 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:00,572 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:00,572 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:16:00,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:00,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:16:00,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:00,790 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 240 treesize of output 132 [2025-04-13 22:16:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:00,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:01,606 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:01,606 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 272 treesize of output 182 [2025-04-13 22:16:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948603194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:01,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:01,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-04-13 22:16:01,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771259900] [2025-04-13 22:16:01,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:01,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:01,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:01,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:01,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:01,788 INFO L87 Difference]: Start difference. First operand 167 states and 508 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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-13 22:16:06,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:06,591 INFO L93 Difference]: Finished difference Result 350 states and 931 transitions. [2025-04-13 22:16:06,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 22:16:06,591 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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) Word has length 20 [2025-04-13 22:16:06,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:06,592 INFO L225 Difference]: With dead ends: 350 [2025-04-13 22:16:06,593 INFO L226 Difference]: Without dead ends: 309 [2025-04-13 22:16:06,593 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=663, Invalid=4307, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 22:16:06,593 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:06,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:16:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-04-13 22:16:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 189. [2025-04-13 22:16:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 3.132978723404255) internal successors, (589), 188 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:06,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 589 transitions. [2025-04-13 22:16:06,749 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 589 transitions. Word has length 20 [2025-04-13 22:16:06,749 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:06,750 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 589 transitions. [2025-04-13 22:16:06,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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-13 22:16:06,750 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 589 transitions. [2025-04-13 22:16:06,750 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:06,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:06,750 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:06,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 22:16:06,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:06,951 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:06,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash -435139723, now seen corresponding path program 42 times [2025-04-13 22:16:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:06,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523129498] [2025-04-13 22:16:06,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:06,957 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:06,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:06,969 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:06,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:07,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:07,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523129498] [2025-04-13 22:16:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523129498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:07,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580805380] [2025-04-13 22:16:07,459 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:07,461 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:07,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 22:16:07,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:07,580 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:07,580 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:07,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:07,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:16:07,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:07,591 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-13 22:16:07,600 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 19 treesize of output 1 [2025-04-13 22:16:07,814 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 116 treesize of output 76 [2025-04-13 22:16:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:07,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:09,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580805380] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:09,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:09,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 30 [2025-04-13 22:16:09,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195655912] [2025-04-13 22:16:09,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:09,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:16:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:09,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:16:09,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=813, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:16:09,098 INFO L87 Difference]: Start difference. First operand 189 states and 589 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:12,069 INFO L93 Difference]: Finished difference Result 305 states and 841 transitions. [2025-04-13 22:16:12,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:16:12,070 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:16:12,070 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:12,071 INFO L225 Difference]: With dead ends: 305 [2025-04-13 22:16:12,071 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 22:16:12,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=404, Invalid=2458, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:16:12,071 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:12,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 22:16:12,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 215. [2025-04-13 22:16:12,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 3.1121495327102804) internal successors, (666), 214 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 666 transitions. [2025-04-13 22:16:12,268 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 666 transitions. Word has length 20 [2025-04-13 22:16:12,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:12,268 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 666 transitions. [2025-04-13 22:16:12,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:12,268 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 666 transitions. [2025-04-13 22:16:12,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:12,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:12,269 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:12,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 22:16:12,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-13 22:16:12,470 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:12,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash 424329453, now seen corresponding path program 43 times [2025-04-13 22:16:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:12,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073850321] [2025-04-13 22:16:12,470 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:12,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:16:12,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:12,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:12,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:12,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:12,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073850321] [2025-04-13 22:16:12,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073850321] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:12,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852097931] [2025-04-13 22:16:12,949 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:12,951 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 22:16:13,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:16:13,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:13,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:13,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:13,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:16:13,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:13,313 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 169 treesize of output 91 [2025-04-13 22:16:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:13,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:14,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:14,109 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 379 treesize of output 221 [2025-04-13 22:16:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852097931] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:14,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:14,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-04-13 22:16:14,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904625253] [2025-04-13 22:16:14,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:14,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:16:14,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:14,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:16:14,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:16:14,305 INFO L87 Difference]: Start difference. First operand 215 states and 666 transitions. Second operand has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 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-13 22:16:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:17,611 INFO L93 Difference]: Finished difference Result 378 states and 1051 transitions. [2025-04-13 22:16:17,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:16:17,611 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 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) Word has length 20 [2025-04-13 22:16:17,611 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:17,612 INFO L225 Difference]: With dead ends: 378 [2025-04-13 22:16:17,612 INFO L226 Difference]: Without dead ends: 359 [2025-04-13 22:16:17,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=490, Invalid=3670, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:16:17,613 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:17,613 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:16:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-04-13 22:16:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 251. [2025-04-13 22:16:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.224) internal successors, (806), 250 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 806 transitions. [2025-04-13 22:16:17,848 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 806 transitions. Word has length 20 [2025-04-13 22:16:17,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:17,848 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 806 transitions. [2025-04-13 22:16:17,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 30 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-13 22:16:17,848 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 806 transitions. [2025-04-13 22:16:17,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:17,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:17,848 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:17,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 22:16:18,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-13 22:16:18,049 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:18,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:18,049 INFO L85 PathProgramCache]: Analyzing trace with hash 313506933, now seen corresponding path program 44 times [2025-04-13 22:16:18,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:18,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80406644] [2025-04-13 22:16:18,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:18,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:16:18,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:18,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:16:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:18,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80406644] [2025-04-13 22:16:18,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80406644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:18,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568684295] [2025-04-13 22:16:18,554 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:18,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:18,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:18,556 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:18,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 22:16:18,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:16:18,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:18,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:18,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:16:18,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:18,875 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 124 treesize of output 80 [2025-04-13 22:16:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:16:18,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:19,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:19,704 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 239 treesize of output 156 [2025-04-13 22:16:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:19,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568684295] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:19,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:19,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 28 [2025-04-13 22:16:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859458546] [2025-04-13 22:16:19,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:19,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:19,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:19,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:19,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:19,985 INFO L87 Difference]: Start difference. First operand 251 states and 806 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:16:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:22,790 INFO L93 Difference]: Finished difference Result 380 states and 1095 transitions. [2025-04-13 22:16:22,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:16:22,791 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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) Word has length 20 [2025-04-13 22:16:22,791 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:22,793 INFO L225 Difference]: With dead ends: 380 [2025-04-13 22:16:22,793 INFO L226 Difference]: Without dead ends: 367 [2025-04-13 22:16:22,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=382, Invalid=2374, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:16:22,793 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:22,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-13 22:16:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 245. [2025-04-13 22:16:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 3.209016393442623) internal successors, (783), 244 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 783 transitions. [2025-04-13 22:16:23,037 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 783 transitions. Word has length 20 [2025-04-13 22:16:23,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:23,037 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 783 transitions. [2025-04-13 22:16:23,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:16:23,037 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 783 transitions. [2025-04-13 22:16:23,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:23,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:23,038 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:23,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 22:16:23,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-13 22:16:23,239 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:23,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2141590509, now seen corresponding path program 45 times [2025-04-13 22:16:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:23,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722822834] [2025-04-13 22:16:23,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:23,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:23,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:23,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:23,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:23,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:23,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722822834] [2025-04-13 22:16:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722822834] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:23,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658592876] [2025-04-13 22:16:23,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:23,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:23,591 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:23,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 22:16:23,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:23,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:23,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:23,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:16:23,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:23,899 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 77 treesize of output 49 [2025-04-13 22:16:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:23,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:24,421 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:24,421 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 303 treesize of output 183 [2025-04-13 22:16:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658592876] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:24,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 27 [2025-04-13 22:16:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737538674] [2025-04-13 22:16:24,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:24,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:24,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:24,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:24,669 INFO L87 Difference]: Start difference. First operand 245 states and 783 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 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-13 22:16:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:26,431 INFO L93 Difference]: Finished difference Result 389 states and 1116 transitions. [2025-04-13 22:16:26,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:16:26,431 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 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) Word has length 20 [2025-04-13 22:16:26,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:26,433 INFO L225 Difference]: With dead ends: 389 [2025-04-13 22:16:26,433 INFO L226 Difference]: Without dead ends: 376 [2025-04-13 22:16:26,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=2065, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:16:26,433 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:26,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-04-13 22:16:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 279. [2025-04-13 22:16:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.3309352517985613) internal successors, (926), 278 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 926 transitions. [2025-04-13 22:16:26,699 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 926 transitions. Word has length 20 [2025-04-13 22:16:26,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:26,699 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 926 transitions. [2025-04-13 22:16:26,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 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-13 22:16:26,699 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 926 transitions. [2025-04-13 22:16:26,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:26,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:26,700 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:26,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 22:16:26,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 22:16:26,900 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:26,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:26,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2042554267, now seen corresponding path program 46 times [2025-04-13 22:16:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:26,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754589243] [2025-04-13 22:16:26,901 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:26,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:26,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:16:26,913 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:26,913 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:26,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:16:27,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:27,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754589243] [2025-04-13 22:16:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754589243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:27,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442781432] [2025-04-13 22:16:27,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:27,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:27,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:27,285 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:27,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 22:16:27,392 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:16:27,409 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:27,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:27,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:27,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:16:27,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:27,540 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 137 treesize of output 77 [2025-04-13 22:16:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:16:27,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:28,275 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:28,275 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 193 treesize of output 137 [2025-04-13 22:16:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:28,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442781432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:28,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2025-04-13 22:16:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739200251] [2025-04-13 22:16:28,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:28,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:28,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:28,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:28,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:28,588 INFO L87 Difference]: Start difference. First operand 279 states and 926 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 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-13 22:16:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:30,892 INFO L93 Difference]: Finished difference Result 427 states and 1234 transitions. [2025-04-13 22:16:30,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:16:30,892 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 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) Word has length 20 [2025-04-13 22:16:30,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:30,894 INFO L225 Difference]: With dead ends: 427 [2025-04-13 22:16:30,894 INFO L226 Difference]: Without dead ends: 414 [2025-04-13 22:16:30,894 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=328, Invalid=2122, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:16:30,895 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:30,895 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:16:30,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-04-13 22:16:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 285. [2025-04-13 22:16:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 3.313380281690141) internal successors, (941), 284 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 941 transitions. [2025-04-13 22:16:31,180 INFO L79 Accepts]: Start accepts. Automaton has 285 states and 941 transitions. Word has length 20 [2025-04-13 22:16:31,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:31,180 INFO L485 AbstractCegarLoop]: Abstraction has 285 states and 941 transitions. [2025-04-13 22:16:31,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 28 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-13 22:16:31,180 INFO L278 IsEmpty]: Start isEmpty. Operand 285 states and 941 transitions. [2025-04-13 22:16:31,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:31,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:31,181 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:31,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:31,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 22:16:31,382 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:31,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -534069323, now seen corresponding path program 47 times [2025-04-13 22:16:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:31,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281170000] [2025-04-13 22:16:31,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:31,389 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:31,396 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:31,396 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:16:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:31,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:31,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281170000] [2025-04-13 22:16:31,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281170000] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:31,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721535853] [2025-04-13 22:16:31,833 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:31,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:31,834 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:31,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 22:16:31,943 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:31,961 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:31,961 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:16:31,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:31,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:16:31,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:32,119 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 187 treesize of output 103 [2025-04-13 22:16:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:32,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:32,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:32,742 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 223 treesize of output 151 [2025-04-13 22:16:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721535853] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:33,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:33,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-04-13 22:16:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494878071] [2025-04-13 22:16:33,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:33,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:33,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:33,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:33,063 INFO L87 Difference]: Start difference. First operand 285 states and 941 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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-13 22:16:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:35,175 INFO L93 Difference]: Finished difference Result 409 states and 1245 transitions. [2025-04-13 22:16:35,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:16:35,175 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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) Word has length 20 [2025-04-13 22:16:35,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:35,177 INFO L225 Difference]: With dead ends: 409 [2025-04-13 22:16:35,177 INFO L226 Difference]: Without dead ends: 400 [2025-04-13 22:16:35,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=302, Invalid=1954, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:16:35,178 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:35,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:16:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-04-13 22:16:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 309. [2025-04-13 22:16:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 3.3993506493506493) internal successors, (1047), 308 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 1047 transitions. [2025-04-13 22:16:35,498 INFO L79 Accepts]: Start accepts. Automaton has 309 states and 1047 transitions. Word has length 20 [2025-04-13 22:16:35,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:35,498 INFO L485 AbstractCegarLoop]: Abstraction has 309 states and 1047 transitions. [2025-04-13 22:16:35,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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-13 22:16:35,498 INFO L278 IsEmpty]: Start isEmpty. Operand 309 states and 1047 transitions. [2025-04-13 22:16:35,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:35,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:35,499 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:35,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 22:16:35,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 22:16:35,699 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:35,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:35,699 INFO L85 PathProgramCache]: Analyzing trace with hash -80730707, now seen corresponding path program 48 times [2025-04-13 22:16:35,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:35,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757652091] [2025-04-13 22:16:35,700 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:35,706 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:35,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:35,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:35,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:16:36,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:36,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757652091] [2025-04-13 22:16:36,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757652091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:36,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407549773] [2025-04-13 22:16:36,160 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:36,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:36,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:36,161 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:36,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 22:16:36,271 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:36,291 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:36,291 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:16:36,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:36,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:16:36,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:36,299 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-13 22:16:36,310 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 19 treesize of output 1 [2025-04-13 22:16:36,463 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 158 treesize of output 102 [2025-04-13 22:16:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:36,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:37,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407549773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:37,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:37,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 28 [2025-04-13 22:16:37,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955826226] [2025-04-13 22:16:37,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:37,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:37,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:37,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:37,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:37,555 INFO L87 Difference]: Start difference. First operand 309 states and 1047 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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-13 22:16:41,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:41,600 INFO L93 Difference]: Finished difference Result 487 states and 1427 transitions. [2025-04-13 22:16:41,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:16:41,601 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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) Word has length 20 [2025-04-13 22:16:41,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:41,603 INFO L225 Difference]: With dead ends: 487 [2025-04-13 22:16:41,603 INFO L226 Difference]: Without dead ends: 478 [2025-04-13 22:16:41,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=405, Invalid=3017, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:16:41,603 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:41,604 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:16:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-04-13 22:16:41,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 335. [2025-04-13 22:16:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.4251497005988023) internal successors, (1144), 334 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1144 transitions. [2025-04-13 22:16:41,948 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 1144 transitions. Word has length 20 [2025-04-13 22:16:41,948 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:41,948 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 1144 transitions. [2025-04-13 22:16:41,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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-13 22:16:41,948 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 1144 transitions. [2025-04-13 22:16:41,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:41,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:41,949 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:41,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 22:16:42,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:42,149 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:42,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash -191553227, now seen corresponding path program 49 times [2025-04-13 22:16:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:42,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39765365] [2025-04-13 22:16:42,150 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:42,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:42,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:16:42,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:42,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:42,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:16:42,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:42,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39765365] [2025-04-13 22:16:42,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39765365] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:42,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322980044] [2025-04-13 22:16:42,572 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:42,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:42,574 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:42,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 22:16:42,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:16:42,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:42,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:42,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:42,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:16:42,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:42,899 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 189 treesize of output 105 [2025-04-13 22:16:42,977 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:42,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:43,645 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:43,645 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 289 treesize of output 185 [2025-04-13 22:16:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:43,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322980044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:43,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:43,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-04-13 22:16:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825839188] [2025-04-13 22:16:43,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:43,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:43,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:43,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:43,873 INFO L87 Difference]: Start difference. First operand 335 states and 1144 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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-13 22:16:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:48,341 INFO L93 Difference]: Finished difference Result 588 states and 1665 transitions. [2025-04-13 22:16:48,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:16:48,341 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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) Word has length 20 [2025-04-13 22:16:48,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:48,343 INFO L225 Difference]: With dead ends: 588 [2025-04-13 22:16:48,343 INFO L226 Difference]: Without dead ends: 553 [2025-04-13 22:16:48,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=773, Invalid=4339, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 22:16:48,344 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:48,344 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-04-13 22:16:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 367. [2025-04-13 22:16:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.4863387978142075) internal successors, (1276), 366 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1276 transitions. [2025-04-13 22:16:48,718 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 1276 transitions. Word has length 20 [2025-04-13 22:16:48,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:48,718 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 1276 transitions. [2025-04-13 22:16:48,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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-13 22:16:48,718 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 1276 transitions. [2025-04-13 22:16:48,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:48,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:48,718 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:48,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:48,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:48,919 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:48,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1526790479, now seen corresponding path program 50 times [2025-04-13 22:16:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:48,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324132871] [2025-04-13 22:16:48,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:48,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:16:48,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:48,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:49,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:49,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324132871] [2025-04-13 22:16:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324132871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:49,436 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927775649] [2025-04-13 22:16:49,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:49,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:49,438 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:49,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 22:16:49,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:16:49,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:49,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:49,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:49,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:16:49,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:49,696 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 158 treesize of output 102 [2025-04-13 22:16:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:16:49,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:50,318 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:50,319 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 223 treesize of output 151 [2025-04-13 22:16:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927775649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:50,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 27 [2025-04-13 22:16:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034096027] [2025-04-13 22:16:50,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:50,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:50,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:50,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:50,624 INFO L87 Difference]: Start difference. First operand 367 states and 1276 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:54,165 INFO L93 Difference]: Finished difference Result 593 states and 1859 transitions. [2025-04-13 22:16:54,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:16:54,165 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:16:54,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:54,168 INFO L225 Difference]: With dead ends: 593 [2025-04-13 22:16:54,168 INFO L226 Difference]: Without dead ends: 572 [2025-04-13 22:16:54,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=490, Invalid=3542, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:16:54,168 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1710 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:54,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1710 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:16:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-04-13 22:16:54,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 429. [2025-04-13 22:16:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.633177570093458) internal successors, (1555), 428 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1555 transitions. [2025-04-13 22:16:54,600 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1555 transitions. Word has length 20 [2025-04-13 22:16:54,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:54,600 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1555 transitions. [2025-04-13 22:16:54,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:54,601 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1555 transitions. [2025-04-13 22:16:54,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:54,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:54,601 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:54,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 22:16:54,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:54,802 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:16:54,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:54,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1039129483, now seen corresponding path program 51 times [2025-04-13 22:16:54,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:54,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372724194] [2025-04-13 22:16:54,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:54,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:54,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:54,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:54,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:54,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:55,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372724194] [2025-04-13 22:16:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372724194] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:55,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228061097] [2025-04-13 22:16:55,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:55,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:55,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:55,197 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:16:55,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 22:16:55,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:16:55,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:16:55,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:55,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:55,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:16:55,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:55,564 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 137 treesize of output 89 [2025-04-13 22:16:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:16:55,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:56,358 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:56,359 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 256 treesize of output 175 [2025-04-13 22:16:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:16:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228061097] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:56,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 27 [2025-04-13 22:16:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482775813] [2025-04-13 22:16:56,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:56,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:56,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:56,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:56,655 INFO L87 Difference]: Start difference. First operand 429 states and 1555 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:59,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:59,448 INFO L93 Difference]: Finished difference Result 588 states and 1888 transitions. [2025-04-13 22:16:59,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:16:59,448 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:16:59,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:59,451 INFO L225 Difference]: With dead ends: 588 [2025-04-13 22:16:59,451 INFO L226 Difference]: Without dead ends: 579 [2025-04-13 22:16:59,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=366, Invalid=2496, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:16:59,452 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:59,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:16:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-04-13 22:16:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 441. [2025-04-13 22:16:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 3.6522727272727273) internal successors, (1607), 440 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:59,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1607 transitions. [2025-04-13 22:16:59,897 INFO L79 Accepts]: Start accepts. Automaton has 441 states and 1607 transitions. Word has length 20 [2025-04-13 22:16:59,897 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:59,897 INFO L485 AbstractCegarLoop]: Abstraction has 441 states and 1607 transitions. [2025-04-13 22:16:59,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:16:59,897 INFO L278 IsEmpty]: Start isEmpty. Operand 441 states and 1607 transitions. [2025-04-13 22:16:59,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:16:59,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:59,898 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:16:59,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2025-04-13 22:17:00,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:00,099 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:00,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1097221933, now seen corresponding path program 52 times [2025-04-13 22:17:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:00,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473897870] [2025-04-13 22:17:00,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:00,105 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:00,111 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:00,111 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:17:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:00,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473897870] [2025-04-13 22:17:00,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473897870] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:00,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803439424] [2025-04-13 22:17:00,475 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:00,477 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:00,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 22:17:00,592 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:00,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:00,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:00,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:00,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:17:00,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:00,819 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 144 treesize of output 78 [2025-04-13 22:17:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:17:00,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:01,507 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:01,508 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 288 treesize of output 180 [2025-04-13 22:17:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803439424] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:01,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2025-04-13 22:17:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589296251] [2025-04-13 22:17:01,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:01,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:17:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:01,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:17:01,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:17:01,673 INFO L87 Difference]: Start difference. First operand 441 states and 1607 transitions. Second operand has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 27 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-13 22:17:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:04,481 INFO L93 Difference]: Finished difference Result 639 states and 2053 transitions. [2025-04-13 22:17:04,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:17:04,481 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 27 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) Word has length 20 [2025-04-13 22:17:04,481 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:04,484 INFO L225 Difference]: With dead ends: 639 [2025-04-13 22:17:04,484 INFO L226 Difference]: Without dead ends: 613 [2025-04-13 22:17:04,484 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=283, Invalid=2069, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:17:04,484 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:04,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:17:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-04-13 22:17:04,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 475. [2025-04-13 22:17:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 474 states have (on average 3.6877637130801686) internal successors, (1748), 474 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 1748 transitions. [2025-04-13 22:17:04,967 INFO L79 Accepts]: Start accepts. Automaton has 475 states and 1748 transitions. Word has length 20 [2025-04-13 22:17:04,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:04,967 INFO L485 AbstractCegarLoop]: Abstraction has 475 states and 1748 transitions. [2025-04-13 22:17:04,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 27 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-13 22:17:04,968 INFO L278 IsEmpty]: Start isEmpty. Operand 475 states and 1748 transitions. [2025-04-13 22:17:04,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:04,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:04,968 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:04,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:05,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2025-04-13 22:17:05,169 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:05,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 983451685, now seen corresponding path program 53 times [2025-04-13 22:17:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:05,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238226705] [2025-04-13 22:17:05,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:05,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:05,175 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:05,183 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:05,183 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:17:05,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:05,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238226705] [2025-04-13 22:17:05,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238226705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:05,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556417063] [2025-04-13 22:17:05,651 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:05,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:05,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:05,653 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:05,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 22:17:05,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:05,800 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:05,800 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:17:05,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:05,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:17:05,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:05,831 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-13 22:17:05,846 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 19 treesize of output 1 [2025-04-13 22:17:06,079 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 77 treesize of output 49 [2025-04-13 22:17:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:06,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556417063] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:06,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:06,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 32 [2025-04-13 22:17:06,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223967715] [2025-04-13 22:17:06,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:06,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:17:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:06,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:17:06,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:17:06,841 INFO L87 Difference]: Start difference. First operand 475 states and 1748 transitions. Second operand has 33 states, 32 states have (on average 1.5625) internal successors, (50), 33 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-13 22:17:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:09,875 INFO L93 Difference]: Finished difference Result 886 states and 3154 transitions. [2025-04-13 22:17:09,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:09,875 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 33 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) Word has length 20 [2025-04-13 22:17:09,875 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:09,879 INFO L225 Difference]: With dead ends: 886 [2025-04-13 22:17:09,879 INFO L226 Difference]: Without dead ends: 873 [2025-04-13 22:17:09,879 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=342, Invalid=2414, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:17:09,880 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:09,880 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-04-13 22:17:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 489. [2025-04-13 22:17:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.6495901639344264) internal successors, (1781), 488 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1781 transitions. [2025-04-13 22:17:10,407 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1781 transitions. Word has length 20 [2025-04-13 22:17:10,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:10,407 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1781 transitions. [2025-04-13 22:17:10,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5625) internal successors, (50), 33 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-13 22:17:10,408 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1781 transitions. [2025-04-13 22:17:10,408 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:10,408 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:10,408 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:10,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 22:17:10,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-04-13 22:17:10,609 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:10,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:10,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1001885711, now seen corresponding path program 54 times [2025-04-13 22:17:10,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:10,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188872262] [2025-04-13 22:17:10,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:10,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:10,615 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:10,624 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:10,624 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:17:10,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:11,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:11,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188872262] [2025-04-13 22:17:11,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188872262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:11,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991753740] [2025-04-13 22:17:11,170 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:11,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:11,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:11,171 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:11,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 22:17:11,291 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:11,309 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:11,309 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:17:11,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:11,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:17:11,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:11,482 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 137 treesize of output 89 [2025-04-13 22:17:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:11,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:12,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:12,189 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 148 treesize of output 94 [2025-04-13 22:17:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991753740] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:12,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 29 [2025-04-13 22:17:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784740066] [2025-04-13 22:17:12,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:12,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:12,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:12,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:12,261 INFO L87 Difference]: Start difference. First operand 489 states and 1781 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:15,053 INFO L93 Difference]: Finished difference Result 709 states and 2467 transitions. [2025-04-13 22:17:15,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:15,053 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:17:15,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:15,056 INFO L225 Difference]: With dead ends: 709 [2025-04-13 22:17:15,056 INFO L226 Difference]: Without dead ends: 696 [2025-04-13 22:17:15,056 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=2147, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:17:15,057 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:15,057 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:17:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-04-13 22:17:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 489. [2025-04-13 22:17:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 488 states have (on average 3.6741803278688523) internal successors, (1793), 488 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 1793 transitions. [2025-04-13 22:17:15,600 INFO L79 Accepts]: Start accepts. Automaton has 489 states and 1793 transitions. Word has length 20 [2025-04-13 22:17:15,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:15,600 INFO L485 AbstractCegarLoop]: Abstraction has 489 states and 1793 transitions. [2025-04-13 22:17:15,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:15,601 INFO L278 IsEmpty]: Start isEmpty. Operand 489 states and 1793 transitions. [2025-04-13 22:17:15,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:15,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:15,602 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:15,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 22:17:15,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:15,802 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:15,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:15,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1976924281, now seen corresponding path program 55 times [2025-04-13 22:17:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:15,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170568919] [2025-04-13 22:17:15,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:15,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:15,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:17:15,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:15,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:15,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:16,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:16,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170568919] [2025-04-13 22:17:16,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170568919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:16,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107270532] [2025-04-13 22:17:16,362 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:16,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:16,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:16,364 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:16,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 22:17:16,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:17:16,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:16,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:16,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:16,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:17:16,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:16,673 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 145 treesize of output 79 [2025-04-13 22:17:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:16,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:17,339 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:17,339 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 288 treesize of output 180 [2025-04-13 22:17:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:17,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107270532] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:17,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:17,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-04-13 22:17:17,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901626537] [2025-04-13 22:17:17,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:17,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:17,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:17,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:17,494 INFO L87 Difference]: Start difference. First operand 489 states and 1793 transitions. Second operand has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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-13 22:17:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:20,483 INFO L93 Difference]: Finished difference Result 701 states and 2469 transitions. [2025-04-13 22:17:20,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:17:20,484 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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) Word has length 20 [2025-04-13 22:17:20,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:20,487 INFO L225 Difference]: With dead ends: 701 [2025-04-13 22:17:20,487 INFO L226 Difference]: Without dead ends: 676 [2025-04-13 22:17:20,487 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=339, Invalid=2967, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:17:20,488 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:20,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:17:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-04-13 22:17:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 499. [2025-04-13 22:17:21,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 3.6586345381526106) internal successors, (1822), 498 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1822 transitions. [2025-04-13 22:17:21,061 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 1822 transitions. Word has length 20 [2025-04-13 22:17:21,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:21,061 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 1822 transitions. [2025-04-13 22:17:21,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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-13 22:17:21,061 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 1822 transitions. [2025-04-13 22:17:21,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:21,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:21,062 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:21,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:21,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:21,263 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:21,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1117455105, now seen corresponding path program 56 times [2025-04-13 22:17:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:21,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295024885] [2025-04-13 22:17:21,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:21,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:21,277 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:21,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:21,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:21,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:21,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295024885] [2025-04-13 22:17:21,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295024885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:21,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170541517] [2025-04-13 22:17:21,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:21,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:21,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:21,794 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:21,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 22:17:21,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:21,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:21,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:21,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:17:21,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:22,081 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 158 treesize of output 102 [2025-04-13 22:17:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:17:22,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:22,814 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:22,814 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 279 treesize of output 169 [2025-04-13 22:17:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:23,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170541517] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:23,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:23,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 28 [2025-04-13 22:17:23,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933456942] [2025-04-13 22:17:23,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:23,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:17:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:23,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:17:23,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:17:23,049 INFO L87 Difference]: Start difference. First operand 499 states and 1822 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:17:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:26,193 INFO L93 Difference]: Finished difference Result 743 states and 2562 transitions. [2025-04-13 22:17:26,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:17:26,194 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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) Word has length 20 [2025-04-13 22:17:26,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:26,197 INFO L225 Difference]: With dead ends: 743 [2025-04-13 22:17:26,197 INFO L226 Difference]: Without dead ends: 730 [2025-04-13 22:17:26,197 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=342, Invalid=2850, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:17:26,198 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:26,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:17:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-04-13 22:17:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 505. [2025-04-13 22:17:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.6646825396825395) internal successors, (1847), 504 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1847 transitions. [2025-04-13 22:17:26,775 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1847 transitions. Word has length 20 [2025-04-13 22:17:26,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:26,775 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1847 transitions. [2025-04-13 22:17:26,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 29 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-13 22:17:26,776 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1847 transitions. [2025-04-13 22:17:26,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:26,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:26,776 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:26,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 22:17:26,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 22:17:26,977 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:26,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1228277625, now seen corresponding path program 57 times [2025-04-13 22:17:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:26,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737377095] [2025-04-13 22:17:26,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:26,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:26,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:26,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:26,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:26,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:27,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737377095] [2025-04-13 22:17:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737377095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:27,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612473219] [2025-04-13 22:17:27,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:27,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:27,330 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:27,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 22:17:27,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:27,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:27,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:27,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:17:27,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:27,664 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 161 treesize of output 105 [2025-04-13 22:17:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:27,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:28,504 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:28,504 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 332 treesize of output 210 [2025-04-13 22:17:28,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:28,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612473219] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:28,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:28,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 27 [2025-04-13 22:17:28,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780486917] [2025-04-13 22:17:28,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:28,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:17:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:28,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:17:28,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:17:28,734 INFO L87 Difference]: Start difference. First operand 505 states and 1847 transitions. Second operand has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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-13 22:17:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:33,496 INFO L93 Difference]: Finished difference Result 814 states and 2670 transitions. [2025-04-13 22:17:33,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:17:33,496 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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) Word has length 20 [2025-04-13 22:17:33,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:33,499 INFO L225 Difference]: With dead ends: 814 [2025-04-13 22:17:33,499 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 22:17:33,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=485, Invalid=3421, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:17:33,500 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:33,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:17:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 22:17:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 515. [2025-04-13 22:17:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 3.6653696498054473) internal successors, (1884), 514 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1884 transitions. [2025-04-13 22:17:34,091 INFO L79 Accepts]: Start accepts. Automaton has 515 states and 1884 transitions. Word has length 20 [2025-04-13 22:17:34,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:34,091 INFO L485 AbstractCegarLoop]: Abstraction has 515 states and 1884 transitions. [2025-04-13 22:17:34,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 28 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-13 22:17:34,091 INFO L278 IsEmpty]: Start isEmpty. Operand 515 states and 1884 transitions. [2025-04-13 22:17:34,092 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:34,092 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:34,092 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:34,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2025-04-13 22:17:34,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-13 22:17:34,292 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:34,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash 611592229, now seen corresponding path program 58 times [2025-04-13 22:17:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:34,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774348301] [2025-04-13 22:17:34,293 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:34,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:34,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:34,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:34,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:17:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:34,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774348301] [2025-04-13 22:17:34,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774348301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:34,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189142058] [2025-04-13 22:17:34,678 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:34,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:34,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:34,679 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:34,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 22:17:34,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:34,821 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:34,821 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:34,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:34,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:17:34,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:34,977 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 117 treesize of output 63 [2025-04-13 22:17:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:17:35,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:35,466 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:35,466 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 328 treesize of output 192 [2025-04-13 22:17:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189142058] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:35,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 30 [2025-04-13 22:17:35,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276312] [2025-04-13 22:17:35,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:35,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:17:35,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:35,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:17:35,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:17:35,706 INFO L87 Difference]: Start difference. First operand 515 states and 1884 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:39,179 INFO L93 Difference]: Finished difference Result 816 states and 2736 transitions. [2025-04-13 22:17:39,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:17:39,180 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:17:39,180 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:39,183 INFO L225 Difference]: With dead ends: 816 [2025-04-13 22:17:39,183 INFO L226 Difference]: Without dead ends: 803 [2025-04-13 22:17:39,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=428, Invalid=3732, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:17:39,184 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2536 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:39,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 2559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:17:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-04-13 22:17:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 535. [2025-04-13 22:17:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 3.6779026217228465) internal successors, (1964), 534 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1964 transitions. [2025-04-13 22:17:39,808 INFO L79 Accepts]: Start accepts. Automaton has 535 states and 1964 transitions. Word has length 20 [2025-04-13 22:17:39,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:39,808 INFO L485 AbstractCegarLoop]: Abstraction has 535 states and 1964 transitions. [2025-04-13 22:17:39,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:39,809 INFO L278 IsEmpty]: Start isEmpty. Operand 535 states and 1964 transitions. [2025-04-13 22:17:39,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:39,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:39,809 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:39,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:40,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:40,010 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:40,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:40,010 INFO L85 PathProgramCache]: Analyzing trace with hash 500769709, now seen corresponding path program 59 times [2025-04-13 22:17:40,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:40,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069110224] [2025-04-13 22:17:40,010 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:40,017 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:40,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:40,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:17:40,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:40,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069110224] [2025-04-13 22:17:40,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069110224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:40,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426369804] [2025-04-13 22:17:40,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:40,470 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:40,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 22:17:40,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:40,617 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:40,617 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:17:40,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:40,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:17:40,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:40,721 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 137 treesize of output 77 [2025-04-13 22:17:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:40,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:41,422 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:41,422 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 237 treesize of output 157 [2025-04-13 22:17:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:41,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426369804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:41,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:41,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-04-13 22:17:41,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370161943] [2025-04-13 22:17:41,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:41,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:17:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:41,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:17:41,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:17:41,686 INFO L87 Difference]: Start difference. First operand 535 states and 1964 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:45,376 INFO L93 Difference]: Finished difference Result 871 states and 2935 transitions. [2025-04-13 22:17:45,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:17:45,377 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:17:45,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:45,380 INFO L225 Difference]: With dead ends: 871 [2025-04-13 22:17:45,380 INFO L226 Difference]: Without dead ends: 858 [2025-04-13 22:17:45,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=328, Invalid=2752, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:17:45,380 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:45,380 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:17:45,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-04-13 22:17:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 557. [2025-04-13 22:17:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 3.696043165467626) internal successors, (2055), 556 states have internal predecessors, (2055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 2055 transitions. [2025-04-13 22:17:46,028 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 2055 transitions. Word has length 20 [2025-04-13 22:17:46,028 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:46,028 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 2055 transitions. [2025-04-13 22:17:46,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:46,028 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 2055 transitions. [2025-04-13 22:17:46,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:46,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:46,029 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:46,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:46,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable71 [2025-04-13 22:17:46,229 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:46,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1384579306, now seen corresponding path program 60 times [2025-04-13 22:17:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:46,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737810584] [2025-04-13 22:17:46,230 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:46,236 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:46,245 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:46,245 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:17:46,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:17:46,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:46,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737810584] [2025-04-13 22:17:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737810584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:46,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795372980] [2025-04-13 22:17:46,446 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:46,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:46,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:46,448 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:46,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 22:17:46,575 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:46,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:46,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:17:46,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:46,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:17:46,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:46,684 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 91 treesize of output 59 [2025-04-13 22:17:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:17:46,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:46,775 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:17:46,775 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 109 treesize of output 56 [2025-04-13 22:17:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:17:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795372980] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:46,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 19 [2025-04-13 22:17:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487864391] [2025-04-13 22:17:46,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:46,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:17:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:46,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:17:46,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:17:46,790 INFO L87 Difference]: Start difference. First operand 557 states and 2055 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:48,043 INFO L93 Difference]: Finished difference Result 590 states and 2114 transitions. [2025-04-13 22:17:48,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:17:48,043 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:17:48,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:48,046 INFO L225 Difference]: With dead ends: 590 [2025-04-13 22:17:48,046 INFO L226 Difference]: Without dead ends: 579 [2025-04-13 22:17:48,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:17:48,046 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:48,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-04-13 22:17:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 557. [2025-04-13 22:17:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 3.6924460431654675) internal successors, (2053), 556 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 2053 transitions. [2025-04-13 22:17:48,695 INFO L79 Accepts]: Start accepts. Automaton has 557 states and 2053 transitions. Word has length 20 [2025-04-13 22:17:48,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:48,696 INFO L485 AbstractCegarLoop]: Abstraction has 557 states and 2053 transitions. [2025-04-13 22:17:48,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:48,696 INFO L278 IsEmpty]: Start isEmpty. Operand 557 states and 2053 transitions. [2025-04-13 22:17:48,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:48,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:48,697 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:48,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:48,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:48,897 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:48,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:48,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2075853881, now seen corresponding path program 61 times [2025-04-13 22:17:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:48,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093976141] [2025-04-13 22:17:48,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:48,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:17:48,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:48,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:48,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:17:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:49,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093976141] [2025-04-13 22:17:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093976141] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:49,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066682134] [2025-04-13 22:17:49,372 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:49,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:49,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:49,374 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:49,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 22:17:49,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:17:49,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:49,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:49,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:17:49,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:49,642 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 214 treesize of output 118 [2025-04-13 22:17:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:49,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:50,371 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:50,372 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 328 treesize of output 208 [2025-04-13 22:17:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066682134] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:50,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:50,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 29 [2025-04-13 22:17:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900688997] [2025-04-13 22:17:50,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:50,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:50,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:50,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:50,591 INFO L87 Difference]: Start difference. First operand 557 states and 2053 transitions. Second operand has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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-13 22:17:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:54,992 INFO L93 Difference]: Finished difference Result 938 states and 3117 transitions. [2025-04-13 22:17:54,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:17:54,993 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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) Word has length 20 [2025-04-13 22:17:54,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:54,995 INFO L225 Difference]: With dead ends: 938 [2025-04-13 22:17:54,995 INFO L226 Difference]: Without dead ends: 899 [2025-04-13 22:17:54,996 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=505, Invalid=4187, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:17:54,996 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:54,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1932 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:17:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-04-13 22:17:55,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 595. [2025-04-13 22:17:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 3.723905723905724) internal successors, (2212), 594 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 2212 transitions. [2025-04-13 22:17:55,696 INFO L79 Accepts]: Start accepts. Automaton has 595 states and 2212 transitions. Word has length 20 [2025-04-13 22:17:55,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:55,696 INFO L485 AbstractCegarLoop]: Abstraction has 595 states and 2212 transitions. [2025-04-13 22:17:55,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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-13 22:17:55,696 INFO L278 IsEmpty]: Start isEmpty. Operand 595 states and 2212 transitions. [2025-04-13 22:17:55,697 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:55,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:55,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:55,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 22:17:55,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:55,898 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:55,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1189184348, now seen corresponding path program 62 times [2025-04-13 22:17:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:55,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115200885] [2025-04-13 22:17:55,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:55,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:55,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:55,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:17:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:56,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115200885] [2025-04-13 22:17:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115200885] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:56,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298862467] [2025-04-13 22:17:56,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:56,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:56,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:56,119 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:56,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 22:17:56,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:17:56,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:17:56,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:56,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:56,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:17:56,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:56,363 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 112 treesize of output 72 [2025-04-13 22:17:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:17:56,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:56,467 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:56,467 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 44 treesize of output 28 [2025-04-13 22:17:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:17:56,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298862467] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:56,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:56,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:17:56,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958399560] [2025-04-13 22:17:56,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:56,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:17:56,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:56,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:17:56,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:17:56,482 INFO L87 Difference]: Start difference. First operand 595 states and 2212 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:57,895 INFO L93 Difference]: Finished difference Result 635 states and 2287 transitions. [2025-04-13 22:17:57,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:17:57,896 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:17:57,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:57,898 INFO L225 Difference]: With dead ends: 635 [2025-04-13 22:17:57,898 INFO L226 Difference]: Without dead ends: 621 [2025-04-13 22:17:57,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:17:57,898 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:57,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:17:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-04-13 22:17:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 595. [2025-04-13 22:17:58,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 3.7205387205387206) internal successors, (2210), 594 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 2210 transitions. [2025-04-13 22:17:58,598 INFO L79 Accepts]: Start accepts. Automaton has 595 states and 2210 transitions. Word has length 20 [2025-04-13 22:17:58,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:58,598 INFO L485 AbstractCegarLoop]: Abstraction has 595 states and 2210 transitions. [2025-04-13 22:17:58,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:17:58,598 INFO L278 IsEmpty]: Start isEmpty. Operand 595 states and 2210 transitions. [2025-04-13 22:17:58,599 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:17:58,599 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:58,599 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:17:58,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-13 22:17:58,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2025-04-13 22:17:58,800 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:17:58,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 169246479, now seen corresponding path program 63 times [2025-04-13 22:17:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:58,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924529052] [2025-04-13 22:17:58,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:58,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:58,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:17:58,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:17:58,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:59,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924529052] [2025-04-13 22:17:59,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924529052] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:59,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697364158] [2025-04-13 22:17:59,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:59,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:59,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:59,144 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:17:59,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 22:17:59,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:17:59,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:17:59,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:17:59,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:59,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:17:59,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:59,475 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 158 treesize of output 102 [2025-04-13 22:17:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:59,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:00,135 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:00,135 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 248 treesize of output 156 [2025-04-13 22:18:00,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:00,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697364158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:00,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 26 [2025-04-13 22:18:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009255894] [2025-04-13 22:18:00,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:00,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:00,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:00,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:00,366 INFO L87 Difference]: Start difference. First operand 595 states and 2210 transitions. Second operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 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-13 22:18:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:03,467 INFO L93 Difference]: Finished difference Result 742 states and 2540 transitions. [2025-04-13 22:18:03,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:18:03,467 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 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) Word has length 20 [2025-04-13 22:18:03,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:03,469 INFO L225 Difference]: With dead ends: 742 [2025-04-13 22:18:03,469 INFO L226 Difference]: Without dead ends: 733 [2025-04-13 22:18:03,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=316, Invalid=2234, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:18:03,470 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:03,470 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:18:03,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-04-13 22:18:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 611. [2025-04-13 22:18:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 610 states have (on average 3.7278688524590162) internal successors, (2274), 610 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 2274 transitions. [2025-04-13 22:18:04,198 INFO L79 Accepts]: Start accepts. Automaton has 611 states and 2274 transitions. Word has length 20 [2025-04-13 22:18:04,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:04,199 INFO L485 AbstractCegarLoop]: Abstraction has 611 states and 2274 transitions. [2025-04-13 22:18:04,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 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-13 22:18:04,199 INFO L278 IsEmpty]: Start isEmpty. Operand 611 states and 2274 transitions. [2025-04-13 22:18:04,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:04,200 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:04,200 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:04,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 22:18:04,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:04,400 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:04,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1028715655, now seen corresponding path program 64 times [2025-04-13 22:18:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:04,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330100446] [2025-04-13 22:18:04,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:04,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:04,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:04,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:04,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330100446] [2025-04-13 22:18:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330100446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:04,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564837619] [2025-04-13 22:18:04,850 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:04,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:04,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:04,852 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:04,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 22:18:04,986 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:05,005 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:05,005 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:05,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:05,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:18:05,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:05,229 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 144 treesize of output 78 [2025-04-13 22:18:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:18:05,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:05,949 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:05,949 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 318 treesize of output 194 [2025-04-13 22:18:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:06,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564837619] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:06,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 31 [2025-04-13 22:18:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964559480] [2025-04-13 22:18:06,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:06,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:18:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:06,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:18:06,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:18:06,135 INFO L87 Difference]: Start difference. First operand 611 states and 2274 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:10,205 INFO L93 Difference]: Finished difference Result 790 states and 2649 transitions. [2025-04-13 22:18:10,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:18:10,205 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:18:10,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:10,208 INFO L225 Difference]: With dead ends: 790 [2025-04-13 22:18:10,208 INFO L226 Difference]: Without dead ends: 771 [2025-04-13 22:18:10,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=440, Invalid=3850, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:18:10,208 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:10,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:18:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-04-13 22:18:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 617. [2025-04-13 22:18:10,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 3.7256493506493507) internal successors, (2295), 616 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 2295 transitions. [2025-04-13 22:18:10,943 INFO L79 Accepts]: Start accepts. Automaton has 617 states and 2295 transitions. Word has length 20 [2025-04-13 22:18:10,943 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:10,943 INFO L485 AbstractCegarLoop]: Abstraction has 617 states and 2295 transitions. [2025-04-13 22:18:10,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:10,944 INFO L278 IsEmpty]: Start isEmpty. Operand 617 states and 2295 transitions. [2025-04-13 22:18:10,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:10,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:10,945 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:10,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:11,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:11,145 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:11,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash 917893135, now seen corresponding path program 65 times [2025-04-13 22:18:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:11,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032866696] [2025-04-13 22:18:11,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:11,152 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:11,157 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:11,158 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:18:11,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:11,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:11,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032866696] [2025-04-13 22:18:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032866696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:11,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662844688] [2025-04-13 22:18:11,614 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:11,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:11,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:11,615 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:11,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 22:18:11,750 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:11,770 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:11,770 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:18:11,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:18:11,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:12,018 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 138 treesize of output 90 [2025-04-13 22:18:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:18:12,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:12,774 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:12,774 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 263 treesize of output 182 [2025-04-13 22:18:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662844688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:12,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 30 [2025-04-13 22:18:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631666159] [2025-04-13 22:18:12,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:12,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:18:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:18:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:18:12,993 INFO L87 Difference]: Start difference. First operand 617 states and 2295 transitions. Second operand has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 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-13 22:18:16,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:16,448 INFO L93 Difference]: Finished difference Result 747 states and 2603 transitions. [2025-04-13 22:18:16,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:18:16,449 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 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) Word has length 20 [2025-04-13 22:18:16,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:16,451 INFO L225 Difference]: With dead ends: 747 [2025-04-13 22:18:16,451 INFO L226 Difference]: Without dead ends: 738 [2025-04-13 22:18:16,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=374, Invalid=2932, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:18:16,451 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:16,451 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:18:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-04-13 22:18:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 637. [2025-04-13 22:18:17,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 3.74685534591195) internal successors, (2383), 636 states have internal predecessors, (2383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 2383 transitions. [2025-04-13 22:18:17,218 INFO L79 Accepts]: Start accepts. Automaton has 637 states and 2383 transitions. Word has length 20 [2025-04-13 22:18:17,218 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:17,218 INFO L485 AbstractCegarLoop]: Abstraction has 637 states and 2383 transitions. [2025-04-13 22:18:17,218 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 31 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-13 22:18:17,218 INFO L278 IsEmpty]: Start isEmpty. Operand 637 states and 2383 transitions. [2025-04-13 22:18:17,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:17,219 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:17,219 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:17,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-13 22:18:17,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:17,420 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:17,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash 70316879, now seen corresponding path program 66 times [2025-04-13 22:18:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:17,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735098315] [2025-04-13 22:18:17,420 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:17,427 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:17,438 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:17,438 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:18:17,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:18:17,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:17,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735098315] [2025-04-13 22:18:17,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735098315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:17,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942362169] [2025-04-13 22:18:17,839 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:17,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:17,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:17,841 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:17,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 22:18:17,978 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:17,997 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:17,997 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:18:17,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:17,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:18:17,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:18,153 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 203 treesize of output 131 [2025-04-13 22:18:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:18,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:18,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:18,875 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 268 treesize of output 180 [2025-04-13 22:18:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942362169] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:19,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:19,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 28 [2025-04-13 22:18:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155880920] [2025-04-13 22:18:19,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:19,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:19,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:19,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:19,105 INFO L87 Difference]: Start difference. First operand 637 states and 2383 transitions. Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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-13 22:18:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:23,632 INFO L93 Difference]: Finished difference Result 909 states and 3012 transitions. [2025-04-13 22:18:23,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:18:23,632 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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) Word has length 20 [2025-04-13 22:18:23,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:23,635 INFO L225 Difference]: With dead ends: 909 [2025-04-13 22:18:23,635 INFO L226 Difference]: Without dead ends: 874 [2025-04-13 22:18:23,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=519, Invalid=3387, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:18:23,635 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:23,636 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:18:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-04-13 22:18:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 683. [2025-04-13 22:18:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 3.777126099706745) internal successors, (2576), 682 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 2576 transitions. [2025-04-13 22:18:24,463 INFO L79 Accepts]: Start accepts. Automaton has 683 states and 2576 transitions. Word has length 20 [2025-04-13 22:18:24,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:24,463 INFO L485 AbstractCegarLoop]: Abstraction has 683 states and 2576 transitions. [2025-04-13 22:18:24,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 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-13 22:18:24,463 INFO L278 IsEmpty]: Start isEmpty. Operand 683 states and 2576 transitions. [2025-04-13 22:18:24,464 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:24,464 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:24,464 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:24,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:24,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2025-04-13 22:18:24,664 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:24,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 523655495, now seen corresponding path program 67 times [2025-04-13 22:18:24,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:24,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49343366] [2025-04-13 22:18:24,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:24,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:18:24,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:24,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:24,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:18:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:25,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49343366] [2025-04-13 22:18:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49343366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:25,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986243121] [2025-04-13 22:18:25,117 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:25,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:25,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:25,119 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:25,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 22:18:25,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:18:25,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:25,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:25,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:25,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:18:25,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:25,444 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 144 treesize of output 78 [2025-04-13 22:18:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:25,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:26,043 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:26,043 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 311 treesize of output 191 [2025-04-13 22:18:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986243121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:26,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:26,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-04-13 22:18:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705136220] [2025-04-13 22:18:26,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:26,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:26,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:26,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:26,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:26,242 INFO L87 Difference]: Start difference. First operand 683 states and 2576 transitions. Second operand has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 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-13 22:18:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:29,740 INFO L93 Difference]: Finished difference Result 849 states and 2947 transitions. [2025-04-13 22:18:29,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:18:29,741 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 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) Word has length 20 [2025-04-13 22:18:29,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:29,743 INFO L225 Difference]: With dead ends: 849 [2025-04-13 22:18:29,743 INFO L226 Difference]: Without dead ends: 830 [2025-04-13 22:18:29,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=425, Invalid=3115, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:18:29,744 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:29,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:18:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-04-13 22:18:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 707. [2025-04-13 22:18:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 3.7790368271954673) internal successors, (2668), 706 states have internal predecessors, (2668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 2668 transitions. [2025-04-13 22:18:30,611 INFO L79 Accepts]: Start accepts. Automaton has 707 states and 2668 transitions. Word has length 20 [2025-04-13 22:18:30,611 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:30,611 INFO L485 AbstractCegarLoop]: Abstraction has 707 states and 2668 transitions. [2025-04-13 22:18:30,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 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-13 22:18:30,611 INFO L278 IsEmpty]: Start isEmpty. Operand 707 states and 2668 transitions. [2025-04-13 22:18:30,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:30,612 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:30,612 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:30,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 22:18:30,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:30,813 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:30,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash 412832975, now seen corresponding path program 68 times [2025-04-13 22:18:30,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:30,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561799196] [2025-04-13 22:18:30,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:30,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:30,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:30,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:30,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:31,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:31,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561799196] [2025-04-13 22:18:31,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561799196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:31,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496957778] [2025-04-13 22:18:31,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:31,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:31,307 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:31,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 22:18:31,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:31,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:31,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:31,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:18:31,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:31,605 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 137 treesize of output 89 [2025-04-13 22:18:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:18:31,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:32,299 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:32,299 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 234 treesize of output 154 [2025-04-13 22:18:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496957778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:32,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:32,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 29 [2025-04-13 22:18:32,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430401531] [2025-04-13 22:18:32,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:32,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:18:32,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:32,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:18:32,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:18:32,608 INFO L87 Difference]: Start difference. First operand 707 states and 2668 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:36,402 INFO L93 Difference]: Finished difference Result 867 states and 3016 transitions. [2025-04-13 22:18:36,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:18:36,403 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:18:36,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:36,405 INFO L225 Difference]: With dead ends: 867 [2025-04-13 22:18:36,405 INFO L226 Difference]: Without dead ends: 858 [2025-04-13 22:18:36,406 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:18:36,406 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1929 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:36,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1929 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:18:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-04-13 22:18:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 729. [2025-04-13 22:18:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 728 states have (on average 3.7925824175824174) internal successors, (2761), 728 states have internal predecessors, (2761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2761 transitions. [2025-04-13 22:18:37,294 INFO L79 Accepts]: Start accepts. Automaton has 729 states and 2761 transitions. Word has length 20 [2025-04-13 22:18:37,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:37,294 INFO L485 AbstractCegarLoop]: Abstraction has 729 states and 2761 transitions. [2025-04-13 22:18:37,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:37,294 INFO L278 IsEmpty]: Start isEmpty. Operand 729 states and 2761 transitions. [2025-04-13 22:18:37,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:37,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:37,295 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:37,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:37,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:37,496 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:37,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2131176681, now seen corresponding path program 69 times [2025-04-13 22:18:37,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:37,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56491138] [2025-04-13 22:18:37,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:37,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:37,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:37,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:37,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:37,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56491138] [2025-04-13 22:18:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56491138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:37,909 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727100446] [2025-04-13 22:18:37,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:37,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:37,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:37,911 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:37,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 22:18:38,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:38,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:38,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:38,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:38,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 22:18:38,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:38,105 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-13 22:18:38,114 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-13 22:18:38,245 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 116 treesize of output 76 [2025-04-13 22:18:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:38,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:39,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727100446] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:39,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:39,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 29 [2025-04-13 22:18:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32640110] [2025-04-13 22:18:39,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:39,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:18:39,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:39,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:18:39,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:18:39,446 INFO L87 Difference]: Start difference. First operand 729 states and 2761 transitions. Second operand has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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-13 22:18:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:43,527 INFO L93 Difference]: Finished difference Result 872 states and 3067 transitions. [2025-04-13 22:18:43,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:18:43,527 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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) Word has length 20 [2025-04-13 22:18:43,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:43,530 INFO L225 Difference]: With dead ends: 872 [2025-04-13 22:18:43,530 INFO L226 Difference]: Without dead ends: 859 [2025-04-13 22:18:43,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=316, Invalid=2654, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:18:43,531 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:43,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:18:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-04-13 22:18:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 753. [2025-04-13 22:18:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 752 states have (on average 3.8125) internal successors, (2867), 752 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 2867 transitions. [2025-04-13 22:18:44,454 INFO L79 Accepts]: Start accepts. Automaton has 753 states and 2867 transitions. Word has length 20 [2025-04-13 22:18:44,454 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:44,454 INFO L485 AbstractCegarLoop]: Abstraction has 753 states and 2867 transitions. [2025-04-13 22:18:44,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 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-13 22:18:44,454 INFO L278 IsEmpty]: Start isEmpty. Operand 753 states and 2867 transitions. [2025-04-13 22:18:44,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:44,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:44,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:44,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-13 22:18:44,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2025-04-13 22:18:44,656 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:44,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1277121082, now seen corresponding path program 70 times [2025-04-13 22:18:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:44,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096384846] [2025-04-13 22:18:44,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:44,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:44,669 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:44,669 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:44,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:18:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:44,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096384846] [2025-04-13 22:18:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096384846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:44,843 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627491786] [2025-04-13 22:18:44,843 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:44,845 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:44,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 22:18:45,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:18:45,026 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:45,026 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:45,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:45,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:18:45,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:45,117 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 112 treesize of output 72 [2025-04-13 22:18:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:18:45,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:45,198 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:45,198 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 87 treesize of output 47 [2025-04-13 22:18:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 22:18:45,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627491786] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:45,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:45,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-04-13 22:18:45,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695191606] [2025-04-13 22:18:45,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:45,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:18:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:45,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:18:45,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:18:45,241 INFO L87 Difference]: Start difference. First operand 753 states and 2867 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:47,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:47,212 INFO L93 Difference]: Finished difference Result 834 states and 3008 transitions. [2025-04-13 22:18:47,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:18:47,213 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:18:47,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:47,215 INFO L225 Difference]: With dead ends: 834 [2025-04-13 22:18:47,215 INFO L226 Difference]: Without dead ends: 820 [2025-04-13 22:18:47,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:18:47,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:47,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:18:47,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-04-13 22:18:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 753. [2025-04-13 22:18:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 752 states have (on average 3.809840425531915) internal successors, (2865), 752 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 2865 transitions. [2025-04-13 22:18:48,145 INFO L79 Accepts]: Start accepts. Automaton has 753 states and 2865 transitions. Word has length 20 [2025-04-13 22:18:48,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:48,145 INFO L485 AbstractCegarLoop]: Abstraction has 753 states and 2865 transitions. [2025-04-13 22:18:48,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:48,145 INFO L278 IsEmpty]: Start isEmpty. Operand 753 states and 2865 transitions. [2025-04-13 22:18:48,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:18:48,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:48,146 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:48,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 22:18:48,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:48,350 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:48,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:48,350 INFO L85 PathProgramCache]: Analyzing trace with hash -434743281, now seen corresponding path program 71 times [2025-04-13 22:18:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:48,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652661360] [2025-04-13 22:18:48,350 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:48,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:48,358 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:48,366 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:48,366 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:18:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:48,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:48,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652661360] [2025-04-13 22:18:48,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652661360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:48,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200497238] [2025-04-13 22:18:48,824 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:48,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:48,825 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:48,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 22:18:48,969 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 22:18:48,992 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:18:48,992 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:18:48,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:48,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:18:48,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:49,194 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 189 treesize of output 105 [2025-04-13 22:18:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:49,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:50,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:50,128 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 340 treesize of output 216 [2025-04-13 22:18:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:50,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200497238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:50,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:50,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-04-13 22:18:50,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215783553] [2025-04-13 22:18:50,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:50,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:18:50,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:50,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:18:50,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:18:50,338 INFO L87 Difference]: Start difference. First operand 753 states and 2865 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:55,523 INFO L93 Difference]: Finished difference Result 941 states and 3293 transitions. [2025-04-13 22:18:55,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:18:55,524 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:18:55,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:55,527 INFO L225 Difference]: With dead ends: 941 [2025-04-13 22:18:55,527 INFO L226 Difference]: Without dead ends: 914 [2025-04-13 22:18:55,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=388, Invalid=2474, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:18:55,527 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:55,528 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:18:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-04-13 22:18:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 777. [2025-04-13 22:18:56,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 776 states have (on average 3.8157216494845363) internal successors, (2961), 776 states have internal predecessors, (2961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 2961 transitions. [2025-04-13 22:18:56,504 INFO L79 Accepts]: Start accepts. Automaton has 777 states and 2961 transitions. Word has length 20 [2025-04-13 22:18:56,504 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:56,504 INFO L485 AbstractCegarLoop]: Abstraction has 777 states and 2961 transitions. [2025-04-13 22:18:56,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:56,504 INFO L278 IsEmpty]: Start isEmpty. Operand 777 states and 2961 transitions. [2025-04-13 22:18:56,505 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:18:56,505 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:56,505 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:56,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-04-13 22:18:56,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:56,706 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:56,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:56,706 INFO L85 PathProgramCache]: Analyzing trace with hash 538260526, now seen corresponding path program 72 times [2025-04-13 22:18:56,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:56,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052813777] [2025-04-13 22:18:56,706 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:56,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:56,713 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:18:56,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:18:56,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:18:56,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:18:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:56,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052813777] [2025-04-13 22:18:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052813777] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:56,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546675769] [2025-04-13 22:18:56,983 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:56,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:56,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:56,985 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:18:56,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 22:18:57,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:18:57,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:18:57,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:18:57,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:57,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:18:57,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:57,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:57,314 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:18:57,314 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 44 treesize of output 19 [2025-04-13 22:18:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546675769] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:57,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 22 [2025-04-13 22:18:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590343758] [2025-04-13 22:18:57,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:57,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:18:57,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:57,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:18:57,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:18:57,336 INFO L87 Difference]: Start difference. First operand 777 states and 2961 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:59,287 INFO L93 Difference]: Finished difference Result 1138 states and 4289 transitions. [2025-04-13 22:18:59,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:18:59,287 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:18:59,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:59,289 INFO L225 Difference]: With dead ends: 1138 [2025-04-13 22:18:59,289 INFO L226 Difference]: Without dead ends: 755 [2025-04-13 22:18:59,290 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:18:59,290 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:59,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:18:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-04-13 22:18:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 390. [2025-04-13 22:18:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.1619537275064267) internal successors, (1230), 389 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1230 transitions. [2025-04-13 22:18:59,869 INFO L79 Accepts]: Start accepts. Automaton has 390 states and 1230 transitions. Word has length 21 [2025-04-13 22:18:59,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:59,869 INFO L485 AbstractCegarLoop]: Abstraction has 390 states and 1230 transitions. [2025-04-13 22:18:59,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:18:59,869 INFO L278 IsEmpty]: Start isEmpty. Operand 390 states and 1230 transitions. [2025-04-13 22:18:59,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:18:59,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:59,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:18:59,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-13 22:19:00,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:00,071 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:00,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2099593637, now seen corresponding path program 73 times [2025-04-13 22:19:00,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:00,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513876643] [2025-04-13 22:19:00,071 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:00,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:19:00,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:00,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:00,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:19:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:00,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513876643] [2025-04-13 22:19:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513876643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:00,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539822955] [2025-04-13 22:19:00,369 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:00,371 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:00,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-13 22:19:00,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:19:00,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:00,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:00,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:00,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:19:00,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:00,644 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 107 treesize of output 59 [2025-04-13 22:19:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:00,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:00,750 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:19:00,750 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 83 treesize of output 42 [2025-04-13 22:19:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:00,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539822955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:00,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:00,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2025-04-13 22:19:00,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210594264] [2025-04-13 22:19:00,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:00,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:00,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:00,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:00,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:00,784 INFO L87 Difference]: Start difference. First operand 390 states and 1230 transitions. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:02,247 INFO L93 Difference]: Finished difference Result 444 states and 1335 transitions. [2025-04-13 22:19:02,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:19:02,247 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:02,247 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:02,249 INFO L225 Difference]: With dead ends: 444 [2025-04-13 22:19:02,249 INFO L226 Difference]: Without dead ends: 436 [2025-04-13 22:19:02,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:19:02,249 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:02,249 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-04-13 22:19:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 396. [2025-04-13 22:19:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 3.1721518987341772) internal successors, (1253), 395 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1253 transitions. [2025-04-13 22:19:02,837 INFO L79 Accepts]: Start accepts. Automaton has 396 states and 1253 transitions. Word has length 21 [2025-04-13 22:19:02,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:02,837 INFO L485 AbstractCegarLoop]: Abstraction has 396 states and 1253 transitions. [2025-04-13 22:19:02,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:02,837 INFO L278 IsEmpty]: Start isEmpty. Operand 396 states and 1253 transitions. [2025-04-13 22:19:02,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:02,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:02,838 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:02,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-04-13 22:19:03,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable85 [2025-04-13 22:19:03,038 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:03,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:03,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1756827392, now seen corresponding path program 74 times [2025-04-13 22:19:03,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:03,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682216587] [2025-04-13 22:19:03,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:03,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:03,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:03,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:03,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:03,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682216587] [2025-04-13 22:19:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682216587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:03,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847911205] [2025-04-13 22:19:03,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:03,333 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:03,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-13 22:19:03,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:03,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:03,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:03,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:03,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:03,643 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 91 treesize of output 59 [2025-04-13 22:19:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:19:03,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:03,782 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:19:03,782 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 44 treesize of output 19 [2025-04-13 22:19:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847911205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:03,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:03,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 26 [2025-04-13 22:19:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819047083] [2025-04-13 22:19:03,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:03,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:03,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:03,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:03,806 INFO L87 Difference]: Start difference. First operand 396 states and 1253 transitions. Second operand has 26 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 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-13 22:19:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:06,080 INFO L93 Difference]: Finished difference Result 502 states and 1441 transitions. [2025-04-13 22:19:06,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:19:06,080 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 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) Word has length 21 [2025-04-13 22:19:06,080 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:06,082 INFO L225 Difference]: With dead ends: 502 [2025-04-13 22:19:06,082 INFO L226 Difference]: Without dead ends: 491 [2025-04-13 22:19:06,082 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=2099, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:19:06,082 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:06,082 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-13 22:19:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 400. [2025-04-13 22:19:06,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.1654135338345863) internal successors, (1263), 399 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1263 transitions. [2025-04-13 22:19:06,685 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1263 transitions. Word has length 21 [2025-04-13 22:19:06,685 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:06,685 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1263 transitions. [2025-04-13 22:19:06,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 26 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-13 22:19:06,685 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1263 transitions. [2025-04-13 22:19:06,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:06,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:06,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:06,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:06,886 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2025-04-13 22:19:06,886 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:06,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2013706184, now seen corresponding path program 75 times [2025-04-13 22:19:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:06,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143074657] [2025-04-13 22:19:06,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:06,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:06,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:06,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:06,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:06,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:07,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143074657] [2025-04-13 22:19:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143074657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:07,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655455346] [2025-04-13 22:19:07,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:07,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:07,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:07,074 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:07,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-13 22:19:07,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:07,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:07,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:07,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:07,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:19:07,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:07,373 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 91 treesize of output 59 [2025-04-13 22:19:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:07,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:07,463 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:19:07,463 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 44 treesize of output 19 [2025-04-13 22:19:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655455346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:07,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-04-13 22:19:07,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652286273] [2025-04-13 22:19:07,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:07,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:19:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:07,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:19:07,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:19:07,489 INFO L87 Difference]: Start difference. First operand 400 states and 1263 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:09,387 INFO L93 Difference]: Finished difference Result 495 states and 1434 transitions. [2025-04-13 22:19:09,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:19:09,387 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:09,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:09,388 INFO L225 Difference]: With dead ends: 495 [2025-04-13 22:19:09,388 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 22:19:09,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=1125, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:09,389 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:09,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 22:19:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 400. [2025-04-13 22:19:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.1654135338345863) internal successors, (1263), 399 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1263 transitions. [2025-04-13 22:19:09,985 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1263 transitions. Word has length 21 [2025-04-13 22:19:09,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:09,985 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1263 transitions. [2025-04-13 22:19:09,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:09,985 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1263 transitions. [2025-04-13 22:19:09,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:09,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:09,985 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:09,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2025-04-13 22:19:10,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2025-04-13 22:19:10,186 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:10,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:10,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1673799875, now seen corresponding path program 76 times [2025-04-13 22:19:10,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:10,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456143274] [2025-04-13 22:19:10,186 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:10,193 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:10,200 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:10,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:10,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:10,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456143274] [2025-04-13 22:19:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456143274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:10,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66661797] [2025-04-13 22:19:10,437 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:10,439 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-13 22:19:10,590 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:10,609 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:10,609 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:10,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:19:10,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:10,746 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 132 treesize of output 72 [2025-04-13 22:19:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:19:10,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:10,873 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:19:10,873 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 83 treesize of output 42 [2025-04-13 22:19:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66661797] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:10,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2025-04-13 22:19:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713471305] [2025-04-13 22:19:10,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:10,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:19:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:10,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:19:10,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:19:10,900 INFO L87 Difference]: Start difference. First operand 400 states and 1263 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-13 22:19:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:12,563 INFO L93 Difference]: Finished difference Result 438 states and 1326 transitions. [2025-04-13 22:19:12,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:19:12,563 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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) Word has length 21 [2025-04-13 22:19:12,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:12,565 INFO L225 Difference]: With dead ends: 438 [2025-04-13 22:19:12,565 INFO L226 Difference]: Without dead ends: 421 [2025-04-13 22:19:12,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:19:12,565 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:12,565 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-13 22:19:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 400. [2025-04-13 22:19:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.1503759398496243) internal successors, (1257), 399 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1257 transitions. [2025-04-13 22:19:13,169 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1257 transitions. Word has length 21 [2025-04-13 22:19:13,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:13,169 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1257 transitions. [2025-04-13 22:19:13,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-13 22:19:13,169 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1257 transitions. [2025-04-13 22:19:13,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:13,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:13,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:13,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 22:19:13,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-13 22:19:13,370 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:13,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash -562917406, now seen corresponding path program 77 times [2025-04-13 22:19:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:13,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228492724] [2025-04-13 22:19:13,371 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:13,377 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:13,384 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:13,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:19:13,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:13,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228492724] [2025-04-13 22:19:13,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228492724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:13,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063101183] [2025-04-13 22:19:13,583 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:13,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:13,585 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:13,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-04-13 22:19:13,739 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:13,770 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:13,770 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:19:13,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:13,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:19:13,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:13,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:13,966 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:19:13,966 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 44 treesize of output 19 [2025-04-13 22:19:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063101183] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:13,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:13,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-04-13 22:19:13,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440192266] [2025-04-13 22:19:13,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:13,993 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:19:13,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:13,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:19:13,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:19:13,994 INFO L87 Difference]: Start difference. First operand 400 states and 1257 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:15,745 INFO L93 Difference]: Finished difference Result 480 states and 1409 transitions. [2025-04-13 22:19:15,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:19:15,745 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:15,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:15,746 INFO L225 Difference]: With dead ends: 480 [2025-04-13 22:19:15,746 INFO L226 Difference]: Without dead ends: 473 [2025-04-13 22:19:15,747 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:19:15,747 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:15,747 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-04-13 22:19:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 400. [2025-04-13 22:19:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.1503759398496243) internal successors, (1257), 399 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:16,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1257 transitions. [2025-04-13 22:19:16,370 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1257 transitions. Word has length 21 [2025-04-13 22:19:16,370 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:16,370 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1257 transitions. [2025-04-13 22:19:16,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:16,370 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1257 transitions. [2025-04-13 22:19:16,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:16,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:16,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:16,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-04-13 22:19:16,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:16,572 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:16,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash 798428616, now seen corresponding path program 78 times [2025-04-13 22:19:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:16,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115777741] [2025-04-13 22:19:16,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:16,579 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:16,589 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:16,589 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:19:16,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:16,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115777741] [2025-04-13 22:19:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115777741] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:16,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102774049] [2025-04-13 22:19:16,874 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:16,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:16,876 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:16,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-04-13 22:19:17,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:17,050 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:17,050 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:19:17,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:17,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:19:17,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:17,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:17,291 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:19:17,291 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 44 treesize of output 19 [2025-04-13 22:19:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:17,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102774049] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:17,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:17,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 24 [2025-04-13 22:19:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148268592] [2025-04-13 22:19:17,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:17,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:19:17,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:17,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:19:17,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:19:17,314 INFO L87 Difference]: Start difference. First operand 400 states and 1257 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:18,992 INFO L93 Difference]: Finished difference Result 458 states and 1369 transitions. [2025-04-13 22:19:18,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:19:18,992 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:18,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:18,994 INFO L225 Difference]: With dead ends: 458 [2025-04-13 22:19:18,994 INFO L226 Difference]: Without dead ends: 451 [2025-04-13 22:19:18,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:19:18,994 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:18,994 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-04-13 22:19:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 400. [2025-04-13 22:19:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.1503759398496243) internal successors, (1257), 399 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1257 transitions. [2025-04-13 22:19:19,644 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1257 transitions. Word has length 21 [2025-04-13 22:19:19,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:19,644 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1257 transitions. [2025-04-13 22:19:19,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:19,644 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1257 transitions. [2025-04-13 22:19:19,644 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:19,644 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:19,644 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:19,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:19,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:19,845 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:19,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash -186775289, now seen corresponding path program 79 times [2025-04-13 22:19:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:19,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99178997] [2025-04-13 22:19:19,845 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:19,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:19,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:19:19,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:19,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:19,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:20,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99178997] [2025-04-13 22:19:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99178997] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:20,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977089393] [2025-04-13 22:19:20,113 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:20,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:20,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:20,115 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:20,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-04-13 22:19:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:19:20,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:20,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:20,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:20,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:19:20,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:20,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:20,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:20,440 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 51 treesize of output 27 [2025-04-13 22:19:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977089393] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:20,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-04-13 22:19:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680391613] [2025-04-13 22:19:20,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:20,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:19:20,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:20,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:19:20,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:19:20,500 INFO L87 Difference]: Start difference. First operand 400 states and 1257 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:22,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:22,683 INFO L93 Difference]: Finished difference Result 533 states and 1537 transitions. [2025-04-13 22:19:22,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:19:22,684 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:22,684 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:22,685 INFO L225 Difference]: With dead ends: 533 [2025-04-13 22:19:22,685 INFO L226 Difference]: Without dead ends: 517 [2025-04-13 22:19:22,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=295, Invalid=1867, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:19:22,686 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:22,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-13 22:19:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 400. [2025-04-13 22:19:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.12531328320802) internal successors, (1247), 399 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1247 transitions. [2025-04-13 22:19:23,356 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1247 transitions. Word has length 21 [2025-04-13 22:19:23,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:23,357 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1247 transitions. [2025-04-13 22:19:23,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:23,357 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1247 transitions. [2025-04-13 22:19:23,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:23,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:23,357 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:23,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2025-04-13 22:19:23,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:23,558 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:23,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1712228683, now seen corresponding path program 80 times [2025-04-13 22:19:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:23,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222714409] [2025-04-13 22:19:23,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:23,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:23,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:23,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:23,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:19:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:23,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222714409] [2025-04-13 22:19:23,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222714409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:23,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388093197] [2025-04-13 22:19:23,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:23,871 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:23,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-04-13 22:19:24,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:24,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:24,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:24,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:24,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:24,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:24,116 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 91 treesize of output 59 [2025-04-13 22:19:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:19:24,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:24,217 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:24,217 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 51 treesize of output 27 [2025-04-13 22:19:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388093197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:24,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 23 [2025-04-13 22:19:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897072992] [2025-04-13 22:19:24,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:24,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:19:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:24,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:19:24,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:19:24,273 INFO L87 Difference]: Start difference. First operand 400 states and 1247 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:26,496 INFO L93 Difference]: Finished difference Result 529 states and 1507 transitions. [2025-04-13 22:19:26,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:19:26,496 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:26,496 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:26,497 INFO L225 Difference]: With dead ends: 529 [2025-04-13 22:19:26,497 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 22:19:26,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=1644, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:19:26,498 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:26,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 22:19:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 400. [2025-04-13 22:19:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.0952380952380953) internal successors, (1235), 399 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1235 transitions. [2025-04-13 22:19:27,142 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1235 transitions. Word has length 21 [2025-04-13 22:19:27,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:27,142 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1235 transitions. [2025-04-13 22:19:27,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:27,142 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1235 transitions. [2025-04-13 22:19:27,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:27,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:27,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:27,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-04-13 22:19:27,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:27,343 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:27,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1556503484, now seen corresponding path program 81 times [2025-04-13 22:19:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:27,344 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091096543] [2025-04-13 22:19:27,344 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:27,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:27,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:27,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:27,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:27,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091096543] [2025-04-13 22:19:27,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091096543] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:27,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612531742] [2025-04-13 22:19:27,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:27,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:27,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:27,565 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:27,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-04-13 22:19:27,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:27,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:27,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:27,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:19:27,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:27,842 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 91 treesize of output 59 [2025-04-13 22:19:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:27,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:27,932 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:27,932 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 61 [2025-04-13 22:19:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612531742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:28,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:28,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2025-04-13 22:19:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547643600] [2025-04-13 22:19:28,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:28,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:19:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:28,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:19:28,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:19:28,006 INFO L87 Difference]: Start difference. First operand 400 states and 1235 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:30,226 INFO L93 Difference]: Finished difference Result 538 states and 1506 transitions. [2025-04-13 22:19:30,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:19:30,226 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:30,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:30,227 INFO L225 Difference]: With dead ends: 538 [2025-04-13 22:19:30,227 INFO L226 Difference]: Without dead ends: 513 [2025-04-13 22:19:30,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=1595, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:19:30,228 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:30,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-04-13 22:19:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 398. [2025-04-13 22:19:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.0831234256926954) internal successors, (1224), 397 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:30,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1224 transitions. [2025-04-13 22:19:30,888 INFO L79 Accepts]: Start accepts. Automaton has 398 states and 1224 transitions. Word has length 21 [2025-04-13 22:19:30,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:30,888 INFO L485 AbstractCegarLoop]: Abstraction has 398 states and 1224 transitions. [2025-04-13 22:19:30,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:30,888 INFO L278 IsEmpty]: Start isEmpty. Operand 398 states and 1224 transitions. [2025-04-13 22:19:30,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:30,889 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:30,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:30,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-04-13 22:19:31,089 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:31,089 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:31,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:31,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1626341230, now seen corresponding path program 82 times [2025-04-13 22:19:31,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:31,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302452624] [2025-04-13 22:19:31,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:31,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:31,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:31,103 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:31,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:31,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302452624] [2025-04-13 22:19:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302452624] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:31,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657942730] [2025-04-13 22:19:31,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:31,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:31,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:31,355 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:31,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-04-13 22:19:31,516 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:31,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:31,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:31,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:31,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:19:31,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:31,622 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 132 treesize of output 72 [2025-04-13 22:19:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:19:31,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:31,693 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:31,694 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 87 treesize of output 47 [2025-04-13 22:19:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657942730] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:31,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:31,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 20 [2025-04-13 22:19:31,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060130201] [2025-04-13 22:19:31,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:31,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:19:31,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:31,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:19:31,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:19:31,762 INFO L87 Difference]: Start difference. First operand 398 states and 1224 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:33,951 INFO L93 Difference]: Finished difference Result 522 states and 1461 transitions. [2025-04-13 22:19:33,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:19:33,951 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:33,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:33,952 INFO L225 Difference]: With dead ends: 522 [2025-04-13 22:19:33,952 INFO L226 Difference]: Without dead ends: 515 [2025-04-13 22:19:33,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1152, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:33,953 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:33,953 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-04-13 22:19:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 400. [2025-04-13 22:19:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 3.080200501253133) internal successors, (1229), 399 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1229 transitions. [2025-04-13 22:19:34,612 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1229 transitions. Word has length 21 [2025-04-13 22:19:34,612 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:34,612 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1229 transitions. [2025-04-13 22:19:34,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:34,613 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1229 transitions. [2025-04-13 22:19:34,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:34,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:34,613 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:34,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Ended with exit code 0 [2025-04-13 22:19:34,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable94 [2025-04-13 22:19:34,814 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:34,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:34,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1473475967, now seen corresponding path program 83 times [2025-04-13 22:19:34,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:34,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687622095] [2025-04-13 22:19:34,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:34,821 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:34,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:34,828 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:19:34,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:35,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687622095] [2025-04-13 22:19:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687622095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:35,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048660736] [2025-04-13 22:19:35,039 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:35,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:35,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:35,041 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:35,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-04-13 22:19:35,202 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:35,225 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:35,225 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:19:35,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:35,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:19:35,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:35,286 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 132 treesize of output 72 [2025-04-13 22:19:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:35,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:35,378 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:35,378 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 51 treesize of output 27 [2025-04-13 22:19:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:35,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048660736] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:35,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:35,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-04-13 22:19:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814657933] [2025-04-13 22:19:35,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:35,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:19:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:35,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:19:35,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:19:35,442 INFO L87 Difference]: Start difference. First operand 400 states and 1229 transitions. Second operand has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:39,827 INFO L93 Difference]: Finished difference Result 837 states and 2164 transitions. [2025-04-13 22:19:39,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 22:19:39,827 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:39,827 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:39,829 INFO L225 Difference]: With dead ends: 837 [2025-04-13 22:19:39,829 INFO L226 Difference]: Without dead ends: 736 [2025-04-13 22:19:39,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1090, Invalid=6050, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 22:19:39,830 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:39,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 0 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:19:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-04-13 22:19:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 411. [2025-04-13 22:19:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 2.9609756097560975) internal successors, (1214), 410 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1214 transitions. [2025-04-13 22:19:40,644 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1214 transitions. Word has length 21 [2025-04-13 22:19:40,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:40,644 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1214 transitions. [2025-04-13 22:19:40,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:40,645 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1214 transitions. [2025-04-13 22:19:40,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:40,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:40,645 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:40,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2025-04-13 22:19:40,850 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2025-04-13 22:19:40,850 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:40,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash -853691279, now seen corresponding path program 84 times [2025-04-13 22:19:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:40,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866304047] [2025-04-13 22:19:40,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:40,857 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:40,867 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:40,867 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:19:40,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:41,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:41,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866304047] [2025-04-13 22:19:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866304047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:41,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936222297] [2025-04-13 22:19:41,115 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:41,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:41,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:41,117 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:41,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-04-13 22:19:41,279 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:41,298 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:41,299 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:19:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:41,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:41,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:41,373 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 112 treesize of output 72 [2025-04-13 22:19:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:19:41,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:41,456 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:41,456 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 87 treesize of output 47 [2025-04-13 22:19:41,519 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936222297] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:41,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:41,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 22 [2025-04-13 22:19:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235340853] [2025-04-13 22:19:41,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:41,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:19:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:41,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:19:41,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:19:41,520 INFO L87 Difference]: Start difference. First operand 411 states and 1214 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:45,019 INFO L93 Difference]: Finished difference Result 676 states and 1674 transitions. [2025-04-13 22:19:45,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:19:45,019 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:45,019 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:45,021 INFO L225 Difference]: With dead ends: 676 [2025-04-13 22:19:45,021 INFO L226 Difference]: Without dead ends: 660 [2025-04-13 22:19:45,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=2649, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:19:45,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:45,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:19:45,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-04-13 22:19:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 409. [2025-04-13 22:19:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 2.9534313725490198) internal successors, (1205), 408 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1205 transitions. [2025-04-13 22:19:45,834 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 1205 transitions. Word has length 21 [2025-04-13 22:19:45,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:45,834 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 1205 transitions. [2025-04-13 22:19:45,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:45,834 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 1205 transitions. [2025-04-13 22:19:45,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:45,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:45,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:45,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2025-04-13 22:19:46,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:46,035 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:46,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1009416478, now seen corresponding path program 85 times [2025-04-13 22:19:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:46,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932405145] [2025-04-13 22:19:46,035 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:46,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:19:46,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:46,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:46,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:19:46,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:46,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932405145] [2025-04-13 22:19:46,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932405145] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:46,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551891460] [2025-04-13 22:19:46,295 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:46,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:46,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:46,296 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:46,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-04-13 22:19:46,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:19:46,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:46,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:46,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:46,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:19:46,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:46,548 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 132 treesize of output 72 [2025-04-13 22:19:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:46,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:46,638 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:46,639 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 51 treesize of output 27 [2025-04-13 22:19:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:46,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551891460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:46,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:46,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-04-13 22:19:46,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065534337] [2025-04-13 22:19:46,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:46,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:19:46,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:46,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:19:46,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:19:46,701 INFO L87 Difference]: Start difference. First operand 409 states and 1205 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-13 22:19:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:49,869 INFO L93 Difference]: Finished difference Result 615 states and 1582 transitions. [2025-04-13 22:19:49,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:19:49,869 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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) Word has length 21 [2025-04-13 22:19:49,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:49,870 INFO L225 Difference]: With dead ends: 615 [2025-04-13 22:19:49,870 INFO L226 Difference]: Without dead ends: 606 [2025-04-13 22:19:49,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=384, Invalid=2808, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:19:49,871 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:49,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 0 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:19:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-04-13 22:19:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 409. [2025-04-13 22:19:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 408 states have (on average 2.9436274509803924) internal successors, (1201), 408 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:50,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 1201 transitions. [2025-04-13 22:19:50,684 INFO L79 Accepts]: Start accepts. Automaton has 409 states and 1201 transitions. Word has length 21 [2025-04-13 22:19:50,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:50,685 INFO L485 AbstractCegarLoop]: Abstraction has 409 states and 1201 transitions. [2025-04-13 22:19:50,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 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-13 22:19:50,685 INFO L278 IsEmpty]: Start isEmpty. Operand 409 states and 1201 transitions. [2025-04-13 22:19:50,685 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:50,685 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:50,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:50,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:50,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:50,886 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:50,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -939578732, now seen corresponding path program 86 times [2025-04-13 22:19:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:50,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318829738] [2025-04-13 22:19:50,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:50,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:50,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:50,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:50,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:19:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:51,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318829738] [2025-04-13 22:19:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318829738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:51,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514261425] [2025-04-13 22:19:51,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:51,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:51,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:51,206 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:51,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-04-13 22:19:51,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:19:51,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:51,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:51,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:51,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:51,462 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 112 treesize of output 72 [2025-04-13 22:19:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:19:51,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:51,535 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:51,535 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 51 treesize of output 27 [2025-04-13 22:19:51,591 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:51,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514261425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:51,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:51,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 23 [2025-04-13 22:19:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162431201] [2025-04-13 22:19:51,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:51,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:19:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:51,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:19:51,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:19:51,592 INFO L87 Difference]: Start difference. First operand 409 states and 1201 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:54,692 INFO L93 Difference]: Finished difference Result 611 states and 1578 transitions. [2025-04-13 22:19:54,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:19:54,692 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:54,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:54,694 INFO L225 Difference]: With dead ends: 611 [2025-04-13 22:19:54,694 INFO L226 Difference]: Without dead ends: 604 [2025-04-13 22:19:54,694 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=2320, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:19:54,694 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:54,694 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:54,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-04-13 22:19:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 411. [2025-04-13 22:19:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 2.9414634146341463) internal successors, (1206), 410 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1206 transitions. [2025-04-13 22:19:55,515 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1206 transitions. Word has length 21 [2025-04-13 22:19:55,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:55,515 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1206 transitions. [2025-04-13 22:19:55,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:55,515 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1206 transitions. [2025-04-13 22:19:55,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:19:55,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:55,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:19:55,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Ended with exit code 0 [2025-04-13 22:19:55,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:55,717 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:55,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:55,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1092443995, now seen corresponding path program 87 times [2025-04-13 22:19:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:55,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343127910] [2025-04-13 22:19:55,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:55,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:55,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:55,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:55,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:55,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:55,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343127910] [2025-04-13 22:19:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343127910] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:55,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471125399] [2025-04-13 22:19:55,930 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:55,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:55,932 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:19:55,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-04-13 22:19:56,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:19:56,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:19:56,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:56,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:56,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:19:56,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:56,226 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 91 treesize of output 59 [2025-04-13 22:19:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:56,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:56,308 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:56,308 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 87 treesize of output 47 [2025-04-13 22:19:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:19:56,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471125399] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:56,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:56,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2025-04-13 22:19:56,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284216468] [2025-04-13 22:19:56,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:56,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:19:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:56,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:19:56,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:19:56,371 INFO L87 Difference]: Start difference. First operand 411 states and 1206 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:59,668 INFO L93 Difference]: Finished difference Result 618 states and 1586 transitions. [2025-04-13 22:19:59,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:19:59,668 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:19:59,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:59,670 INFO L225 Difference]: With dead ends: 618 [2025-04-13 22:19:59,670 INFO L226 Difference]: Without dead ends: 607 [2025-04-13 22:19:59,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=557, Invalid=3349, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:19:59,670 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:59,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:19:59,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-04-13 22:20:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 411. [2025-04-13 22:20:00,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 2.9317073170731707) internal successors, (1202), 410 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1202 transitions. [2025-04-13 22:20:00,491 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1202 transitions. Word has length 21 [2025-04-13 22:20:00,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:00,491 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1202 transitions. [2025-04-13 22:20:00,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:00,491 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1202 transitions. [2025-04-13 22:20:00,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:00,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:00,492 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:00,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2025-04-13 22:20:00,692 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:00,693 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:00,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:00,693 INFO L85 PathProgramCache]: Analyzing trace with hash 778764974, now seen corresponding path program 88 times [2025-04-13 22:20:00,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:00,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409248594] [2025-04-13 22:20:00,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:00,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:00,706 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:00,707 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:00,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:00,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409248594] [2025-04-13 22:20:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409248594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:00,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454193598] [2025-04-13 22:20:00,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:00,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:00,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:00,959 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:00,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-04-13 22:20:01,129 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:01,147 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:01,147 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:01,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:01,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:20:01,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:01,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:01,286 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:01,287 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 51 treesize of output 27 [2025-04-13 22:20:01,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454193598] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:01,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:01,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 21 [2025-04-13 22:20:01,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598782775] [2025-04-13 22:20:01,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:01,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:20:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:01,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:20:01,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:20:01,351 INFO L87 Difference]: Start difference. First operand 411 states and 1202 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:04,381 INFO L93 Difference]: Finished difference Result 598 states and 1554 transitions. [2025-04-13 22:20:04,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:20:04,381 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:04,381 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:04,383 INFO L225 Difference]: With dead ends: 598 [2025-04-13 22:20:04,383 INFO L226 Difference]: Without dead ends: 591 [2025-04-13 22:20:04,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=258, Invalid=1904, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:20:04,383 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:04,383 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-04-13 22:20:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 418. [2025-04-13 22:20:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.906474820143885) internal successors, (1212), 417 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1212 transitions. [2025-04-13 22:20:05,243 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1212 transitions. Word has length 21 [2025-04-13 22:20:05,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:05,243 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1212 transitions. [2025-04-13 22:20:05,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:05,243 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1212 transitions. [2025-04-13 22:20:05,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:05,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:05,244 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:05,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:05,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2025-04-13 22:20:05,445 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:05,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1484774241, now seen corresponding path program 89 times [2025-04-13 22:20:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:05,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535023525] [2025-04-13 22:20:05,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:05,452 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:05,459 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:05,459 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:20:05,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:05,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:05,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535023525] [2025-04-13 22:20:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535023525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:05,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648908431] [2025-04-13 22:20:05,657 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:05,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:05,658 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:05,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-04-13 22:20:05,827 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:05,851 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:05,851 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:20:05,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:05,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:20:05,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:05,922 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 73 treesize of output 37 [2025-04-13 22:20:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:05,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:05,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:05,990 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 61 [2025-04-13 22:20:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:06,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648908431] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:06,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:06,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 23 [2025-04-13 22:20:06,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220701804] [2025-04-13 22:20:06,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:06,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:20:06,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:06,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:20:06,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:20:06,059 INFO L87 Difference]: Start difference. First operand 418 states and 1212 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:08,610 INFO L93 Difference]: Finished difference Result 559 states and 1483 transitions. [2025-04-13 22:20:08,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:20:08,610 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:08,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:08,611 INFO L225 Difference]: With dead ends: 559 [2025-04-13 22:20:08,611 INFO L226 Difference]: Without dead ends: 545 [2025-04-13 22:20:08,611 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=1168, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:08,612 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:08,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-04-13 22:20:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 418. [2025-04-13 22:20:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8968824940047964) internal successors, (1208), 417 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1208 transitions. [2025-04-13 22:20:09,472 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1208 transitions. Word has length 21 [2025-04-13 22:20:09,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:09,473 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1208 transitions. [2025-04-13 22:20:09,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:09,473 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1208 transitions. [2025-04-13 22:20:09,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:09,473 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:09,473 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:09,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2025-04-13 22:20:09,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2025-04-13 22:20:09,674 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:09,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:09,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1118599880, now seen corresponding path program 90 times [2025-04-13 22:20:09,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:09,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234637029] [2025-04-13 22:20:09,674 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:09,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:09,681 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:09,691 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:09,691 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:20:09,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:09,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234637029] [2025-04-13 22:20:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234637029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:09,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884854594] [2025-04-13 22:20:09,936 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:09,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:09,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:09,938 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:09,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-04-13 22:20:10,109 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:10,130 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:10,130 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:20:10,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:10,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:20:10,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:10,218 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 112 treesize of output 72 [2025-04-13 22:20:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:10,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:10,318 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:10,318 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 53 treesize of output 29 [2025-04-13 22:20:10,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:10,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884854594] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:10,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:10,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 22 [2025-04-13 22:20:10,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301791809] [2025-04-13 22:20:10,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:10,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:20:10,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:10,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:20:10,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:20:10,365 INFO L87 Difference]: Start difference. First operand 418 states and 1208 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:12,659 INFO L93 Difference]: Finished difference Result 518 states and 1405 transitions. [2025-04-13 22:20:12,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:20:12,659 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:12,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:12,660 INFO L225 Difference]: With dead ends: 518 [2025-04-13 22:20:12,660 INFO L226 Difference]: Without dead ends: 513 [2025-04-13 22:20:12,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:20:12,661 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:12,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-04-13 22:20:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 418. [2025-04-13 22:20:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8968824940047964) internal successors, (1208), 417 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1208 transitions. [2025-04-13 22:20:13,520 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1208 transitions. Word has length 21 [2025-04-13 22:20:13,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:13,521 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1208 transitions. [2025-04-13 22:20:13,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:13,521 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1208 transitions. [2025-04-13 22:20:13,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:13,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:13,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:13,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2025-04-13 22:20:13,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2025-04-13 22:20:13,722 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:13,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1638683976, now seen corresponding path program 91 times [2025-04-13 22:20:13,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:13,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159857171] [2025-04-13 22:20:13,722 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:13,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:13,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:20:13,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:13,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:20:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:14,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159857171] [2025-04-13 22:20:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159857171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:14,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980149134] [2025-04-13 22:20:14,019 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:14,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:14,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:14,021 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:14,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-04-13 22:20:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:20:14,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:14,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:14,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:14,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:20:14,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:14,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:14,396 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:14,396 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 53 treesize of output 29 [2025-04-13 22:20:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980149134] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:14,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2025-04-13 22:20:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155031215] [2025-04-13 22:20:14,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:14,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:20:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:14,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:20:14,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:20:14,447 INFO L87 Difference]: Start difference. First operand 418 states and 1208 transitions. Second operand has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:16,874 INFO L93 Difference]: Finished difference Result 530 states and 1433 transitions. [2025-04-13 22:20:16,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:20:16,874 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:16,874 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:16,876 INFO L225 Difference]: With dead ends: 530 [2025-04-13 22:20:16,876 INFO L226 Difference]: Without dead ends: 523 [2025-04-13 22:20:16,876 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=1753, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:20:16,876 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:16,876 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-04-13 22:20:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 418. [2025-04-13 22:20:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8968824940047964) internal successors, (1208), 417 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1208 transitions. [2025-04-13 22:20:17,739 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1208 transitions. Word has length 21 [2025-04-13 22:20:17,739 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:17,740 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1208 transitions. [2025-04-13 22:20:17,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:17,740 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1208 transitions. [2025-04-13 22:20:17,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:17,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:17,740 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:17,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:17,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 22:20:17,941 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:17,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 271023624, now seen corresponding path program 92 times [2025-04-13 22:20:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:17,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695731652] [2025-04-13 22:20:17,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:17,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:17,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:17,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:17,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:18,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:18,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:18,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695731652] [2025-04-13 22:20:18,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695731652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:18,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282491353] [2025-04-13 22:20:18,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:18,215 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-04-13 22:20:18,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:18,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:18,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:18,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:18,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:20:18,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:18,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:18,551 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:18,551 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 53 treesize of output 29 [2025-04-13 22:20:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282491353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:18,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 21 [2025-04-13 22:20:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126030087] [2025-04-13 22:20:18,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:18,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:20:18,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:18,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:20:18,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:20:18,593 INFO L87 Difference]: Start difference. First operand 418 states and 1208 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:20,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:20,596 INFO L93 Difference]: Finished difference Result 501 states and 1376 transitions. [2025-04-13 22:20:20,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:20:20,596 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:20,596 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:20,597 INFO L225 Difference]: With dead ends: 501 [2025-04-13 22:20:20,597 INFO L226 Difference]: Without dead ends: 494 [2025-04-13 22:20:20,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:20:20,597 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:20,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:20:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-04-13 22:20:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 418. [2025-04-13 22:20:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8968824940047964) internal successors, (1208), 417 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1208 transitions. [2025-04-13 22:20:21,467 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1208 transitions. Word has length 21 [2025-04-13 22:20:21,467 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:21,467 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1208 transitions. [2025-04-13 22:20:21,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:21,467 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1208 transitions. [2025-04-13 22:20:21,468 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:21,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:21,468 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:21,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2025-04-13 22:20:21,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2025-04-13 22:20:21,668 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:21,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1201585381, now seen corresponding path program 93 times [2025-04-13 22:20:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:21,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288147358] [2025-04-13 22:20:21,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:21,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:21,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:21,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:21,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:21,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288147358] [2025-04-13 22:20:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288147358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:21,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201354923] [2025-04-13 22:20:21,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:21,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:21,861 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:21,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-04-13 22:20:22,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:22,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:22,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:22,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:22,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:20:22,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:22,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:22,303 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:22,304 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 53 treesize of output 29 [2025-04-13 22:20:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201354923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:22,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:22,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2025-04-13 22:20:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213176182] [2025-04-13 22:20:22,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:22,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:20:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:22,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:20:22,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:20:22,365 INFO L87 Difference]: Start difference. First operand 418 states and 1208 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:24,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:24,023 INFO L93 Difference]: Finished difference Result 454 states and 1266 transitions. [2025-04-13 22:20:24,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:20:24,023 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:24,023 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:24,024 INFO L225 Difference]: With dead ends: 454 [2025-04-13 22:20:24,024 INFO L226 Difference]: Without dead ends: 446 [2025-04-13 22:20:24,025 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=675, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:20:24,025 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:24,025 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:20:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-13 22:20:24,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 418. [2025-04-13 22:20:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8968824940047964) internal successors, (1208), 417 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1208 transitions. [2025-04-13 22:20:24,892 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1208 transitions. Word has length 21 [2025-04-13 22:20:24,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:24,892 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1208 transitions. [2025-04-13 22:20:24,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 23 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:24,892 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1208 transitions. [2025-04-13 22:20:24,893 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:24,893 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:24,893 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:24,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2025-04-13 22:20:25,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:25,093 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:25,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:25,093 INFO L85 PathProgramCache]: Analyzing trace with hash -605619008, now seen corresponding path program 94 times [2025-04-13 22:20:25,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:25,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877367568] [2025-04-13 22:20:25,094 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:25,101 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:25,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:25,107 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:25,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:20:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:25,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877367568] [2025-04-13 22:20:25,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877367568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:25,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129486046] [2025-04-13 22:20:25,394 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:25,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:25,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:25,395 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:25,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-04-13 22:20:25,571 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:25,589 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:25,589 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:25,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:25,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:20:25,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:25,697 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 98 treesize of output 50 [2025-04-13 22:20:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:25,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:25,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:25,788 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 119 treesize of output 63 [2025-04-13 22:20:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:25,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129486046] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:25,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:25,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 28 [2025-04-13 22:20:25,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156089556] [2025-04-13 22:20:25,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:25,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:20:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:25,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:20:25,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:20:25,852 INFO L87 Difference]: Start difference. First operand 418 states and 1208 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:28,653 INFO L93 Difference]: Finished difference Result 590 states and 1533 transitions. [2025-04-13 22:20:28,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:20:28,654 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:28,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:28,655 INFO L225 Difference]: With dead ends: 590 [2025-04-13 22:20:28,655 INFO L226 Difference]: Without dead ends: 577 [2025-04-13 22:20:28,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:20:28,656 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:28,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-04-13 22:20:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 418. [2025-04-13 22:20:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8920863309352516) internal successors, (1206), 417 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1206 transitions. [2025-04-13 22:20:29,532 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1206 transitions. Word has length 21 [2025-04-13 22:20:29,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:29,532 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1206 transitions. [2025-04-13 22:20:29,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:29,532 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1206 transitions. [2025-04-13 22:20:29,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:29,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:29,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:29,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2025-04-13 22:20:29,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:29,733 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:29,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -615687925, now seen corresponding path program 95 times [2025-04-13 22:20:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:29,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494708370] [2025-04-13 22:20:29,734 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:29,741 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:20:29,748 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:29,749 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:29,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:29,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:29,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494708370] [2025-04-13 22:20:29,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494708370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:29,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927660005] [2025-04-13 22:20:29,949 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:29,951 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:29,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-04-13 22:20:30,127 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:20:30,155 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:30,156 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:30,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:30,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:20:30,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:30,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:30,349 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:30,350 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 53 treesize of output 29 [2025-04-13 22:20:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:30,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927660005] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:30,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:30,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-04-13 22:20:30,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538380058] [2025-04-13 22:20:30,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:30,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:20:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:30,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:20:30,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:20:30,407 INFO L87 Difference]: Start difference. First operand 418 states and 1206 transitions. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:33,597 INFO L93 Difference]: Finished difference Result 632 states and 1576 transitions. [2025-04-13 22:20:33,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:20:33,598 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:33,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:33,599 INFO L225 Difference]: With dead ends: 632 [2025-04-13 22:20:33,599 INFO L226 Difference]: Without dead ends: 604 [2025-04-13 22:20:33,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=415, Invalid=1655, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:20:33,600 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:33,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-04-13 22:20:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 412. [2025-04-13 22:20:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.878345498783455) internal successors, (1183), 411 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1183 transitions. [2025-04-13 22:20:34,474 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1183 transitions. Word has length 21 [2025-04-13 22:20:34,474 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:34,474 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1183 transitions. [2025-04-13 22:20:34,474 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:34,474 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1183 transitions. [2025-04-13 22:20:34,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:34,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:34,475 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:34,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:34,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2025-04-13 22:20:34,676 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:34,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1102655781, now seen corresponding path program 96 times [2025-04-13 22:20:34,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:34,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111357001] [2025-04-13 22:20:34,676 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:34,683 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:20:34,696 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:34,696 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:34,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:34,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111357001] [2025-04-13 22:20:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111357001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:34,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934951832] [2025-04-13 22:20:34,959 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:34,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:34,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:34,961 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:34,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-04-13 22:20:35,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:20:35,162 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:35,162 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:35,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:20:35,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:35,253 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 112 treesize of output 72 [2025-04-13 22:20:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:35,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:35,353 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:35,353 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 53 treesize of output 29 [2025-04-13 22:20:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934951832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:35,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:35,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 22 [2025-04-13 22:20:35,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144100409] [2025-04-13 22:20:35,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:35,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:20:35,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:35,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:20:35,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:20:35,402 INFO L87 Difference]: Start difference. First operand 412 states and 1183 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:37,497 INFO L93 Difference]: Finished difference Result 476 states and 1294 transitions. [2025-04-13 22:20:37,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:20:37,497 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:37,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:37,498 INFO L225 Difference]: With dead ends: 476 [2025-04-13 22:20:37,498 INFO L226 Difference]: Without dead ends: 465 [2025-04-13 22:20:37,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:37,499 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:37,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:37,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-04-13 22:20:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 412. [2025-04-13 22:20:38,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.8734793187347933) internal successors, (1181), 411 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:38,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1181 transitions. [2025-04-13 22:20:38,366 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1181 transitions. Word has length 21 [2025-04-13 22:20:38,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:38,366 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1181 transitions. [2025-04-13 22:20:38,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:38,366 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1181 transitions. [2025-04-13 22:20:38,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:38,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:38,367 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:38,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2025-04-13 22:20:38,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable108 [2025-04-13 22:20:38,567 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:38,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1127590848, now seen corresponding path program 97 times [2025-04-13 22:20:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:38,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13716153] [2025-04-13 22:20:38,568 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:38,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:20:38,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:38,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:38,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:20:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:38,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13716153] [2025-04-13 22:20:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13716153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:38,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482519291] [2025-04-13 22:20:38,908 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:38,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:38,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:38,910 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:38,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2025-04-13 22:20:39,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:20:39,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:39,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:39,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:39,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:20:39,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:39,205 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 132 treesize of output 72 [2025-04-13 22:20:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:39,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:39,303 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:39,303 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 119 treesize of output 63 [2025-04-13 22:20:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482519291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:39,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 27 [2025-04-13 22:20:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225299597] [2025-04-13 22:20:39,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:39,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:20:39,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:39,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:20:39,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:20:39,363 INFO L87 Difference]: Start difference. First operand 412 states and 1181 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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-13 22:20:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:41,423 INFO L93 Difference]: Finished difference Result 471 states and 1273 transitions. [2025-04-13 22:20:41,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:20:41,423 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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) Word has length 21 [2025-04-13 22:20:41,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:41,425 INFO L225 Difference]: With dead ends: 471 [2025-04-13 22:20:41,425 INFO L226 Difference]: Without dead ends: 462 [2025-04-13 22:20:41,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:20:41,425 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:41,425 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-04-13 22:20:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2025-04-13 22:20:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.8686131386861313) internal successors, (1179), 411 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1179 transitions. [2025-04-13 22:20:42,304 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1179 transitions. Word has length 21 [2025-04-13 22:20:42,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:42,304 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1179 transitions. [2025-04-13 22:20:42,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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-13 22:20:42,304 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1179 transitions. [2025-04-13 22:20:42,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:42,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:42,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:42,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:42,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:42,505 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:42,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1016768328, now seen corresponding path program 98 times [2025-04-13 22:20:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:42,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295681909] [2025-04-13 22:20:42,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:42,512 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:42,521 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:42,521 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:42,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:42,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:42,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295681909] [2025-04-13 22:20:42,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295681909] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:42,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235687512] [2025-04-13 22:20:42,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:42,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:42,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:42,810 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:42,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-04-13 22:20:42,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:43,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:43,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:43,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:43,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:20:43,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:43,124 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 112 treesize of output 72 [2025-04-13 22:20:43,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:43,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:43,224 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:43,225 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 119 treesize of output 63 [2025-04-13 22:20:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:43,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235687512] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:43,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:43,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 25 [2025-04-13 22:20:43,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351113476] [2025-04-13 22:20:43,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:43,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:20:43,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:43,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:20:43,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:20:43,280 INFO L87 Difference]: Start difference. First operand 412 states and 1179 transitions. Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:45,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:45,205 INFO L93 Difference]: Finished difference Result 462 states and 1261 transitions. [2025-04-13 22:20:45,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:20:45,205 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:45,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:45,207 INFO L225 Difference]: With dead ends: 462 [2025-04-13 22:20:45,207 INFO L226 Difference]: Without dead ends: 455 [2025-04-13 22:20:45,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=1138, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:45,207 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:45,207 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:20:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-04-13 22:20:46,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 412. [2025-04-13 22:20:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.8686131386861313) internal successors, (1179), 411 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1179 transitions. [2025-04-13 22:20:46,079 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1179 transitions. Word has length 21 [2025-04-13 22:20:46,079 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:46,079 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1179 transitions. [2025-04-13 22:20:46,079 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:46,079 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1179 transitions. [2025-04-13 22:20:46,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:46,079 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:46,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:46,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Ended with exit code 0 [2025-04-13 22:20:46,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:46,280 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:46,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1555994397, now seen corresponding path program 99 times [2025-04-13 22:20:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:46,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625932348] [2025-04-13 22:20:46,280 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:46,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:46,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:46,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:46,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:46,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625932348] [2025-04-13 22:20:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625932348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:46,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323390018] [2025-04-13 22:20:46,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:46,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:46,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:46,500 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:46,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-04-13 22:20:46,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:46,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:46,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:46,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:46,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:20:46,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:46,732 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-13 22:20:46,742 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 19 treesize of output 1 [2025-04-13 22:20:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:46,867 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323390018] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:47,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 26 [2025-04-13 22:20:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908074860] [2025-04-13 22:20:47,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:47,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:20:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:47,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:20:47,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:20:47,017 INFO L87 Difference]: Start difference. First operand 412 states and 1179 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:49,398 INFO L93 Difference]: Finished difference Result 531 states and 1399 transitions. [2025-04-13 22:20:49,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:20:49,398 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:49,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:49,400 INFO L225 Difference]: With dead ends: 531 [2025-04-13 22:20:49,400 INFO L226 Difference]: Without dead ends: 521 [2025-04-13 22:20:49,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1724, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:20:49,400 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:49,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-04-13 22:20:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 410. [2025-04-13 22:20:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.8655256723716382) internal successors, (1172), 409 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1172 transitions. [2025-04-13 22:20:50,273 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1172 transitions. Word has length 21 [2025-04-13 22:20:50,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:50,273 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1172 transitions. [2025-04-13 22:20:50,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:50,273 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1172 transitions. [2025-04-13 22:20:50,273 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:50,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:50,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:50,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2025-04-13 22:20:50,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2025-04-13 22:20:50,474 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:50,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:50,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1965985822, now seen corresponding path program 100 times [2025-04-13 22:20:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:50,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686880670] [2025-04-13 22:20:50,474 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:50,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:50,490 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:50,490 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:50,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:20:50,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:50,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686880670] [2025-04-13 22:20:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686880670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:50,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461716454] [2025-04-13 22:20:50,761 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:50,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:50,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:50,763 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:50,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-04-13 22:20:50,946 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:20:50,965 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:50,965 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:50,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:50,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:20:50,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:51,069 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 73 treesize of output 37 [2025-04-13 22:20:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:51,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:51,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:51,138 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 87 treesize of output 47 [2025-04-13 22:20:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461716454] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:51,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:51,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 28 [2025-04-13 22:20:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330384903] [2025-04-13 22:20:51,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:51,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:20:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:51,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:20:51,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:20:51,218 INFO L87 Difference]: Start difference. First operand 410 states and 1172 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:54,013 INFO L93 Difference]: Finished difference Result 564 states and 1464 transitions. [2025-04-13 22:20:54,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:20:54,014 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:54,014 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:54,015 INFO L225 Difference]: With dead ends: 564 [2025-04-13 22:20:54,015 INFO L226 Difference]: Without dead ends: 553 [2025-04-13 22:20:54,015 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1716, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:20:54,015 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:54,015 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-04-13 22:20:54,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 410. [2025-04-13 22:20:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.860635696821516) internal successors, (1170), 409 states have internal predecessors, (1170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1170 transitions. [2025-04-13 22:20:54,893 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1170 transitions. Word has length 21 [2025-04-13 22:20:54,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:54,893 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1170 transitions. [2025-04-13 22:20:54,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:54,893 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1170 transitions. [2025-04-13 22:20:54,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:54,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:54,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:54,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:55,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2025-04-13 22:20:55,094 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:55,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1131451713, now seen corresponding path program 101 times [2025-04-13 22:20:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:55,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435848512] [2025-04-13 22:20:55,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:55,102 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:20:55,109 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:55,109 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:55,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:55,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435848512] [2025-04-13 22:20:55,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435848512] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:55,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853496861] [2025-04-13 22:20:55,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:55,277 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:55,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-04-13 22:20:55,465 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:20:55,488 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:55,489 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:55,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:55,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:20:55,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:55,561 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 107 treesize of output 59 [2025-04-13 22:20:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:55,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:55,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:55,635 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 51 treesize of output 27 [2025-04-13 22:20:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:20:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853496861] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:55,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:55,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-04-13 22:20:55,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286359447] [2025-04-13 22:20:55,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:55,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:20:55,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:55,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:20:55,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:20:55,696 INFO L87 Difference]: Start difference. First operand 410 states and 1170 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:58,399 INFO L93 Difference]: Finished difference Result 543 states and 1418 transitions. [2025-04-13 22:20:58,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:20:58,399 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:20:58,399 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:58,401 INFO L225 Difference]: With dead ends: 543 [2025-04-13 22:20:58,401 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 22:20:58,401 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=1523, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:20:58,401 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:58,401 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:20:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 22:20:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 408. [2025-04-13 22:20:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.847665847665848) internal successors, (1159), 407 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:59,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1159 transitions. [2025-04-13 22:20:59,276 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1159 transitions. Word has length 21 [2025-04-13 22:20:59,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:59,276 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1159 transitions. [2025-04-13 22:20:59,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:20:59,276 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1159 transitions. [2025-04-13 22:20:59,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:20:59,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:59,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:59,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Ended with exit code 0 [2025-04-13 22:20:59,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2025-04-13 22:20:59,477 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:59,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:59,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1106516646, now seen corresponding path program 102 times [2025-04-13 22:20:59,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:59,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536300445] [2025-04-13 22:20:59,477 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:59,485 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:20:59,495 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:20:59,495 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:20:59,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:20:59,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:59,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536300445] [2025-04-13 22:20:59,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536300445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:59,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31753707] [2025-04-13 22:20:59,798 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:59,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:59,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:59,800 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:20:59,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-04-13 22:20:59,987 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:00,007 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:00,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:21:00,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:00,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:21:00,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:00,102 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 91 treesize of output 59 [2025-04-13 22:21:00,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:00,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:00,180 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:00,180 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 87 treesize of output 47 [2025-04-13 22:21:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:00,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31753707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:00,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2025-04-13 22:21:00,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967313981] [2025-04-13 22:21:00,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:00,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:21:00,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:00,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:21:00,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:21:00,267 INFO L87 Difference]: Start difference. First operand 408 states and 1159 transitions. Second operand has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:02,699 INFO L93 Difference]: Finished difference Result 514 states and 1362 transitions. [2025-04-13 22:21:02,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:21:02,700 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:02,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:02,701 INFO L225 Difference]: With dead ends: 514 [2025-04-13 22:21:02,701 INFO L226 Difference]: Without dead ends: 505 [2025-04-13 22:21:02,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=284, Invalid=1786, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:21:02,701 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:02,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-04-13 22:21:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 408. [2025-04-13 22:21:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.842751842751843) internal successors, (1157), 407 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:03,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1157 transitions. [2025-04-13 22:21:03,574 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1157 transitions. Word has length 21 [2025-04-13 22:21:03,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:03,574 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1157 transitions. [2025-04-13 22:21:03,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:03,574 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1157 transitions. [2025-04-13 22:21:03,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:03,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:03,575 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:03,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2025-04-13 22:21:03,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:03,775 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:03,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1217339166, now seen corresponding path program 103 times [2025-04-13 22:21:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:03,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287370083] [2025-04-13 22:21:03,776 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:03,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:21:03,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:03,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:03,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:04,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:04,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287370083] [2025-04-13 22:21:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287370083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:04,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606510845] [2025-04-13 22:21:04,067 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:04,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:04,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:04,068 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:04,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-04-13 22:21:04,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:21:04,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:04,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:04,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:04,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:21:04,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:04,343 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 107 treesize of output 59 [2025-04-13 22:21:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:04,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:04,414 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:04,414 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 61 [2025-04-13 22:21:04,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:04,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606510845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:04,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:04,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-04-13 22:21:04,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297852978] [2025-04-13 22:21:04,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:04,487 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:21:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:04,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:21:04,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:21:04,487 INFO L87 Difference]: Start difference. First operand 408 states and 1157 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:06,717 INFO L93 Difference]: Finished difference Result 499 states and 1340 transitions. [2025-04-13 22:21:06,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:21:06,718 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:06,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:06,719 INFO L225 Difference]: With dead ends: 499 [2025-04-13 22:21:06,719 INFO L226 Difference]: Without dead ends: 492 [2025-04-13 22:21:06,719 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:21:06,719 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:06,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:06,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-13 22:21:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 408. [2025-04-13 22:21:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.842751842751843) internal successors, (1157), 407 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1157 transitions. [2025-04-13 22:21:07,589 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1157 transitions. Word has length 21 [2025-04-13 22:21:07,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:07,589 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1157 transitions. [2025-04-13 22:21:07,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:07,589 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1157 transitions. [2025-04-13 22:21:07,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:07,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:07,590 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:07,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2025-04-13 22:21:07,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 22:21:07,790 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:07,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash 597595621, now seen corresponding path program 104 times [2025-04-13 22:21:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:07,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193875977] [2025-04-13 22:21:07,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:07,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:07,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:07,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:07,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:07,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:08,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193875977] [2025-04-13 22:21:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193875977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:08,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460338645] [2025-04-13 22:21:08,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:08,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:08,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:08,089 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:08,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-04-13 22:21:08,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:08,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:08,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:08,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:08,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:21:08,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:08,390 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 91 treesize of output 59 [2025-04-13 22:21:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:08,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:08,472 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:08,472 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 61 [2025-04-13 22:21:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460338645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:08,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 25 [2025-04-13 22:21:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553124775] [2025-04-13 22:21:08,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:08,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:21:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:08,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:21:08,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:21:08,541 INFO L87 Difference]: Start difference. First operand 408 states and 1157 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 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-13 22:21:10,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:10,792 INFO L93 Difference]: Finished difference Result 499 states and 1324 transitions. [2025-04-13 22:21:10,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:21:10,792 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 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) Word has length 21 [2025-04-13 22:21:10,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:10,794 INFO L225 Difference]: With dead ends: 499 [2025-04-13 22:21:10,794 INFO L226 Difference]: Without dead ends: 491 [2025-04-13 22:21:10,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:21:10,794 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:10,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-13 22:21:11,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 412. [2025-04-13 22:21:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.854014598540146) internal successors, (1173), 411 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1173 transitions. [2025-04-13 22:21:11,672 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1173 transitions. Word has length 21 [2025-04-13 22:21:11,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:11,672 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1173 transitions. [2025-04-13 22:21:11,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 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-13 22:21:11,672 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1173 transitions. [2025-04-13 22:21:11,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:11,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:11,673 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:11,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2025-04-13 22:21:11,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2025-04-13 22:21:11,873 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:11,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 622530688, now seen corresponding path program 105 times [2025-04-13 22:21:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:11,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302293313] [2025-04-13 22:21:11,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:11,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:11,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:11,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:11,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:12,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302293313] [2025-04-13 22:21:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302293313] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:12,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820309857] [2025-04-13 22:21:12,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:12,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:12,090 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:12,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-04-13 22:21:12,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:12,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:12,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:12,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:12,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:21:12,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:12,393 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 91 treesize of output 59 [2025-04-13 22:21:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:12,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:12,479 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:12,480 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 51 treesize of output 27 [2025-04-13 22:21:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:12,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820309857] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:12,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:12,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2025-04-13 22:21:12,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084095017] [2025-04-13 22:21:12,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:12,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:21:12,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:12,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:21:12,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:21:12,547 INFO L87 Difference]: Start difference. First operand 412 states and 1173 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:15,004 INFO L93 Difference]: Finished difference Result 521 states and 1354 transitions. [2025-04-13 22:21:15,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:21:15,005 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:15,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:15,006 INFO L225 Difference]: With dead ends: 521 [2025-04-13 22:21:15,006 INFO L226 Difference]: Without dead ends: 512 [2025-04-13 22:21:15,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1689, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:21:15,007 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:15,007 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-13 22:21:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 412. [2025-04-13 22:21:15,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.849148418491484) internal successors, (1171), 411 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:15,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1171 transitions. [2025-04-13 22:21:15,890 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1171 transitions. Word has length 21 [2025-04-13 22:21:15,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:15,890 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1171 transitions. [2025-04-13 22:21:15,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:15,890 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1171 transitions. [2025-04-13 22:21:15,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:15,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:15,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:15,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2025-04-13 22:21:16,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2025-04-13 22:21:16,091 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:16,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:16,092 INFO L85 PathProgramCache]: Analyzing trace with hash 511708168, now seen corresponding path program 106 times [2025-04-13 22:21:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:16,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677029946] [2025-04-13 22:21:16,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:16,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:16,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:16,106 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:16,106 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:16,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:16,352 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:16,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677029946] [2025-04-13 22:21:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677029946] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:16,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836864274] [2025-04-13 22:21:16,352 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:16,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:16,354 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:16,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-04-13 22:21:16,549 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:16,570 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:16,570 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:16,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:16,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:21:16,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:16,734 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 132 treesize of output 72 [2025-04-13 22:21:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:16,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:16,799 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:16,799 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 51 treesize of output 27 [2025-04-13 22:21:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836864274] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:16,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:16,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 22 [2025-04-13 22:21:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731368700] [2025-04-13 22:21:16,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:16,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:21:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:16,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:21:16,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:21:16,882 INFO L87 Difference]: Start difference. First operand 412 states and 1171 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:19,651 INFO L93 Difference]: Finished difference Result 544 states and 1402 transitions. [2025-04-13 22:21:19,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:21:19,651 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:19,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:19,653 INFO L225 Difference]: With dead ends: 544 [2025-04-13 22:21:19,653 INFO L226 Difference]: Without dead ends: 537 [2025-04-13 22:21:19,653 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:21:19,653 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:19,653 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-04-13 22:21:20,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 412. [2025-04-13 22:21:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.849148418491484) internal successors, (1171), 411 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1171 transitions. [2025-04-13 22:21:20,534 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1171 transitions. Word has length 21 [2025-04-13 22:21:20,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:20,534 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1171 transitions. [2025-04-13 22:21:20,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:20,535 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1171 transitions. [2025-04-13 22:21:20,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:20,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:20,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:20,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-04-13 22:21:20,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2025-04-13 22:21:20,736 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:20,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 539503171, now seen corresponding path program 107 times [2025-04-13 22:21:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:20,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130097107] [2025-04-13 22:21:20,736 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:20,743 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:20,751 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:20,751 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:21:20,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:20,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130097107] [2025-04-13 22:21:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130097107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:20,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711223613] [2025-04-13 22:21:20,965 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:20,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:20,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:20,967 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:20,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-04-13 22:21:21,172 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:21,197 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:21,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:21:21,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:21,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:21:21,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:21,317 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 112 treesize of output 72 [2025-04-13 22:21:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:21,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:21,407 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:21,407 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 87 treesize of output 47 [2025-04-13 22:21:21,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711223613] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:21,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:21,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 28 [2025-04-13 22:21:21,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884480191] [2025-04-13 22:21:21,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:21,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:21:21,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:21,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:21:21,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:21:21,486 INFO L87 Difference]: Start difference. First operand 412 states and 1171 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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-13 22:21:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:24,510 INFO L93 Difference]: Finished difference Result 558 states and 1450 transitions. [2025-04-13 22:21:24,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:21:24,510 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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) Word has length 21 [2025-04-13 22:21:24,510 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:24,512 INFO L225 Difference]: With dead ends: 558 [2025-04-13 22:21:24,512 INFO L226 Difference]: Without dead ends: 529 [2025-04-13 22:21:24,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=486, Invalid=3054, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:21:24,512 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:24,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:24,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-04-13 22:21:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 408. [2025-04-13 22:21:25,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.832923832923833) internal successors, (1153), 407 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1153 transitions. [2025-04-13 22:21:25,387 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1153 transitions. Word has length 21 [2025-04-13 22:21:25,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:25,387 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1153 transitions. [2025-04-13 22:21:25,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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-13 22:21:25,387 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1153 transitions. [2025-04-13 22:21:25,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:25,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:25,388 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:25,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:25,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:25,588 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:25,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2064915422, now seen corresponding path program 108 times [2025-04-13 22:21:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:25,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748055369] [2025-04-13 22:21:25,589 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:25,597 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:21:25,607 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:25,607 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:25,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:25,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:25,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748055369] [2025-04-13 22:21:25,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748055369] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:25,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919332191] [2025-04-13 22:21:25,807 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:25,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:25,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:25,809 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:25,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-04-13 22:21:26,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:21:26,022 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:26,023 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:26,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:26,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:21:26,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:26,045 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-13 22:21:26,056 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 19 treesize of output 1 [2025-04-13 22:21:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:26,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:26,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919332191] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:26,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:26,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 26 [2025-04-13 22:21:26,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970554291] [2025-04-13 22:21:26,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:26,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:21:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:26,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:21:26,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:21:26,342 INFO L87 Difference]: Start difference. First operand 408 states and 1153 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 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-13 22:21:29,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:29,391 INFO L93 Difference]: Finished difference Result 585 states and 1459 transitions. [2025-04-13 22:21:29,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:21:29,392 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 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) Word has length 21 [2025-04-13 22:21:29,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:29,393 INFO L225 Difference]: With dead ends: 585 [2025-04-13 22:21:29,393 INFO L226 Difference]: Without dead ends: 578 [2025-04-13 22:21:29,393 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=2314, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:21:29,394 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:29,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:29,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-04-13 22:21:30,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 408. [2025-04-13 22:21:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.832923832923833) internal successors, (1153), 407 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1153 transitions. [2025-04-13 22:21:30,276 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1153 transitions. Word has length 21 [2025-04-13 22:21:30,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:30,276 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1153 transitions. [2025-04-13 22:21:30,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 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-13 22:21:30,276 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1153 transitions. [2025-04-13 22:21:30,277 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:30,277 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:30,277 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:30,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:30,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:30,477 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:30,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1791125896, now seen corresponding path program 109 times [2025-04-13 22:21:30,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:30,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971951306] [2025-04-13 22:21:30,478 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:30,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:21:30,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:30,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:30,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:21:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:30,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971951306] [2025-04-13 22:21:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971951306] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:30,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553319198] [2025-04-13 22:21:30,762 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:30,763 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:30,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-04-13 22:21:30,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:21:30,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:30,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:30,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:30,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:21:30,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:31,057 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 98 treesize of output 50 [2025-04-13 22:21:31,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:31,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:31,127 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:31,128 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 61 [2025-04-13 22:21:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:31,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553319198] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:31,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:31,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2025-04-13 22:21:31,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980325205] [2025-04-13 22:21:31,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:31,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:21:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:31,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:21:31,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:21:31,204 INFO L87 Difference]: Start difference. First operand 408 states and 1153 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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-13 22:21:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:34,093 INFO L93 Difference]: Finished difference Result 568 states and 1437 transitions. [2025-04-13 22:21:34,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:21:34,094 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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) Word has length 21 [2025-04-13 22:21:34,094 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:34,095 INFO L225 Difference]: With dead ends: 568 [2025-04-13 22:21:34,095 INFO L226 Difference]: Without dead ends: 557 [2025-04-13 22:21:34,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=2136, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:21:34,095 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:34,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-04-13 22:21:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 408. [2025-04-13 22:21:34,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.828009828009828) internal successors, (1151), 407 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1151 transitions. [2025-04-13 22:21:34,977 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1151 transitions. Word has length 21 [2025-04-13 22:21:34,977 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:34,977 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1151 transitions. [2025-04-13 22:21:34,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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-13 22:21:34,978 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1151 transitions. [2025-04-13 22:21:34,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:34,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:34,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:34,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2025-04-13 22:21:35,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:35,178 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:35,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2120599845, now seen corresponding path program 110 times [2025-04-13 22:21:35,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:35,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230449072] [2025-04-13 22:21:35,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:35,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:35,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:35,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:35,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:35,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:35,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:35,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230449072] [2025-04-13 22:21:35,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230449072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:35,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454567504] [2025-04-13 22:21:35,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:35,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:35,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:35,482 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:35,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-04-13 22:21:35,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:35,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:35,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:35,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:35,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:21:35,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:35,838 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 112 treesize of output 72 [2025-04-13 22:21:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:35,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:35,943 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:35,943 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 119 treesize of output 63 [2025-04-13 22:21:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:35,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454567504] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:35,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:35,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 26 [2025-04-13 22:21:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72888685] [2025-04-13 22:21:35,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:35,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:21:35,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:35,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:21:35,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:21:35,998 INFO L87 Difference]: Start difference. First operand 408 states and 1151 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:38,330 INFO L93 Difference]: Finished difference Result 514 states and 1348 transitions. [2025-04-13 22:21:38,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:21:38,330 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:38,330 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:38,332 INFO L225 Difference]: With dead ends: 514 [2025-04-13 22:21:38,332 INFO L226 Difference]: Without dead ends: 490 [2025-04-13 22:21:38,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=1486, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:21:38,332 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:38,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-04-13 22:21:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 416. [2025-04-13 22:21:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.816867469879518) internal successors, (1169), 415 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1169 transitions. [2025-04-13 22:21:39,251 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1169 transitions. Word has length 21 [2025-04-13 22:21:39,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:39,251 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1169 transitions. [2025-04-13 22:21:39,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:39,251 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1169 transitions. [2025-04-13 22:21:39,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:39,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:39,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:39,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:39,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2025-04-13 22:21:39,452 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:39,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2145534912, now seen corresponding path program 111 times [2025-04-13 22:21:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:39,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966951867] [2025-04-13 22:21:39,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:39,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:39,472 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:39,472 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:39,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:39,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966951867] [2025-04-13 22:21:39,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966951867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:39,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321391955] [2025-04-13 22:21:39,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:39,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:39,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:39,692 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:39,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-04-13 22:21:39,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:39,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:39,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:39,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:39,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:21:39,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:40,044 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 112 treesize of output 72 [2025-04-13 22:21:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:40,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:40,159 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:40,160 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 53 treesize of output 29 [2025-04-13 22:21:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321391955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:40,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:40,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 26 [2025-04-13 22:21:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181204122] [2025-04-13 22:21:40,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:40,214 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:21:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:40,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:21:40,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:21:40,214 INFO L87 Difference]: Start difference. First operand 416 states and 1169 transitions. Second operand has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 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-13 22:21:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:42,930 INFO L93 Difference]: Finished difference Result 544 states and 1373 transitions. [2025-04-13 22:21:42,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:21:42,930 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 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) Word has length 21 [2025-04-13 22:21:42,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:42,931 INFO L225 Difference]: With dead ends: 544 [2025-04-13 22:21:42,932 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 22:21:42,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=2186, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:21:42,932 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:42,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 0 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 22:21:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 416. [2025-04-13 22:21:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.8120481927710843) internal successors, (1167), 415 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1167 transitions. [2025-04-13 22:21:43,851 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1167 transitions. Word has length 21 [2025-04-13 22:21:43,851 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:43,851 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1167 transitions. [2025-04-13 22:21:43,851 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 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-13 22:21:43,851 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1167 transitions. [2025-04-13 22:21:43,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:43,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:43,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2025-04-13 22:21:44,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2025-04-13 22:21:44,052 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:44,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:44,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2034712392, now seen corresponding path program 112 times [2025-04-13 22:21:44,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:44,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912364526] [2025-04-13 22:21:44,052 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:44,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:44,060 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:44,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:44,068 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:44,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:21:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:44,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912364526] [2025-04-13 22:21:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912364526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:44,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283714021] [2025-04-13 22:21:44,353 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:44,355 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:44,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-04-13 22:21:44,555 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:21:44,573 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:44,573 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:44,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:44,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:21:44,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:44,708 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 132 treesize of output 72 [2025-04-13 22:21:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:44,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:44,802 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:44,802 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 53 treesize of output 29 [2025-04-13 22:21:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:44,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283714021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:44,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 24 [2025-04-13 22:21:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157643770] [2025-04-13 22:21:44,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:44,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:21:44,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:44,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:21:44,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:21:44,865 INFO L87 Difference]: Start difference. First operand 416 states and 1167 transitions. Second operand has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:47,820 INFO L93 Difference]: Finished difference Result 544 states and 1394 transitions. [2025-04-13 22:21:47,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:21:47,820 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:47,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:47,821 INFO L225 Difference]: With dead ends: 544 [2025-04-13 22:21:47,821 INFO L226 Difference]: Without dead ends: 537 [2025-04-13 22:21:47,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=318, Invalid=1844, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:21:47,822 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:47,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-04-13 22:21:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 416. [2025-04-13 22:21:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.8072289156626504) internal successors, (1165), 415 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:48,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1165 transitions. [2025-04-13 22:21:48,743 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1165 transitions. Word has length 21 [2025-04-13 22:21:48,744 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:48,744 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1165 transitions. [2025-04-13 22:21:48,744 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.875) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:48,744 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1165 transitions. [2025-04-13 22:21:48,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:48,744 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:48,744 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:48,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2025-04-13 22:21:48,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2025-04-13 22:21:48,945 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:48,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2062507395, now seen corresponding path program 113 times [2025-04-13 22:21:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:48,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605409492] [2025-04-13 22:21:48,945 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:48,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:48,960 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:48,960 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:21:48,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:49,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:49,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605409492] [2025-04-13 22:21:49,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605409492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:49,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753740415] [2025-04-13 22:21:49,180 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:49,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:49,182 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:49,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2025-04-13 22:21:49,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:21:49,408 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:49,408 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:21:49,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:49,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:21:49,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:49,496 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 107 treesize of output 59 [2025-04-13 22:21:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:49,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:49,584 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:49,584 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 119 treesize of output 63 [2025-04-13 22:21:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:49,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753740415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:49,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:49,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 22 [2025-04-13 22:21:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120573862] [2025-04-13 22:21:49,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:49,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:21:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:49,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:21:49,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:21:49,648 INFO L87 Difference]: Start difference. First operand 416 states and 1165 transitions. Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:51,928 INFO L93 Difference]: Finished difference Result 508 states and 1312 transitions. [2025-04-13 22:21:51,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:21:51,928 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:21:51,928 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:51,930 INFO L225 Difference]: With dead ends: 508 [2025-04-13 22:21:51,930 INFO L226 Difference]: Without dead ends: 497 [2025-04-13 22:21:51,930 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:21:51,930 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:51,930 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-04-13 22:21:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 412. [2025-04-13 22:21:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.81021897810219) internal successors, (1155), 411 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1155 transitions. [2025-04-13 22:21:52,832 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1155 transitions. Word has length 21 [2025-04-13 22:21:52,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:52,833 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1155 transitions. [2025-04-13 22:21:52,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:52,833 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1155 transitions. [2025-04-13 22:21:52,833 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:52,833 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:52,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:52,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:53,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2025-04-13 22:21:53,034 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:53,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash -541911198, now seen corresponding path program 114 times [2025-04-13 22:21:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:53,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020121728] [2025-04-13 22:21:53,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:53,041 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:21:53,053 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:53,053 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:53,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:53,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020121728] [2025-04-13 22:21:53,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020121728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:53,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684161885] [2025-04-13 22:21:53,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:53,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:53,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:53,263 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:53,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-04-13 22:21:53,470 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:21:53,492 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:53,492 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:53,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:53,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:21:53,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:53,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:53,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:53,703 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:53,704 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 53 treesize of output 29 [2025-04-13 22:21:53,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:53,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684161885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:53,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-04-13 22:21:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305115191] [2025-04-13 22:21:53,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:53,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:21:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:53,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:21:53,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:21:53,755 INFO L87 Difference]: Start difference. First operand 412 states and 1155 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-13 22:21:56,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:56,458 INFO L93 Difference]: Finished difference Result 526 states and 1355 transitions. [2025-04-13 22:21:56,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:21:56,458 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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) Word has length 21 [2025-04-13 22:21:56,458 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:56,459 INFO L225 Difference]: With dead ends: 526 [2025-04-13 22:21:56,459 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 22:21:56,459 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:21:56,460 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:56,460 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:56,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 22:21:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 412. [2025-04-13 22:21:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.8053527980535278) internal successors, (1153), 411 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:21:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1153 transitions. [2025-04-13 22:21:57,364 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1153 transitions. Word has length 21 [2025-04-13 22:21:57,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:57,364 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1153 transitions. [2025-04-13 22:21:57,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-13 22:21:57,364 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1153 transitions. [2025-04-13 22:21:57,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:21:57,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:57,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:21:57,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2025-04-13 22:21:57,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126 [2025-04-13 22:21:57,565 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:57,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1187136136, now seen corresponding path program 115 times [2025-04-13 22:21:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:57,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956933648] [2025-04-13 22:21:57,565 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:57,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:21:57,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:57,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:57,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:21:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:57,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956933648] [2025-04-13 22:21:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956933648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:57,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979488442] [2025-04-13 22:21:57,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:57,837 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:21:57,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-04-13 22:21:58,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:21:58,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:21:58,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:58,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:58,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:21:58,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:58,146 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:58,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:58,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:58,223 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 53 treesize of output 29 [2025-04-13 22:21:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:21:58,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979488442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:58,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:58,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-04-13 22:21:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227621579] [2025-04-13 22:21:58,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:58,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:21:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:58,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:21:58,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:21:58,271 INFO L87 Difference]: Start difference. First operand 412 states and 1153 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:00,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:00,404 INFO L93 Difference]: Finished difference Result 484 states and 1284 transitions. [2025-04-13 22:22:00,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:22:00,405 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:00,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:00,406 INFO L225 Difference]: With dead ends: 484 [2025-04-13 22:22:00,406 INFO L226 Difference]: Without dead ends: 477 [2025-04-13 22:22:00,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:22:00,407 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:00,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:22:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-04-13 22:22:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 408. [2025-04-13 22:22:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.808353808353808) internal successors, (1143), 407 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1143 transitions. [2025-04-13 22:22:01,317 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1143 transitions. Word has length 21 [2025-04-13 22:22:01,317 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:01,317 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1143 transitions. [2025-04-13 22:22:01,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:01,317 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1143 transitions. [2025-04-13 22:22:01,317 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:01,317 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:01,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:01,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2025-04-13 22:22:01,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:01,518 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:01,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:01,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1365854973, now seen corresponding path program 116 times [2025-04-13 22:22:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:01,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619529671] [2025-04-13 22:22:01,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:01,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:01,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:01,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:01,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:22:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:01,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619529671] [2025-04-13 22:22:01,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619529671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:01,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004566062] [2025-04-13 22:22:01,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:01,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:01,834 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:01,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-04-13 22:22:02,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:02,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:02,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:02,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:02,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:22:02,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:02,168 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 61 treesize of output 37 [2025-04-13 22:22:02,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:22:02,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:02,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:02,245 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 119 treesize of output 63 [2025-04-13 22:22:02,301 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:02,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004566062] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:02,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 27 [2025-04-13 22:22:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153748434] [2025-04-13 22:22:02,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:02,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:22:02,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:02,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:22:02,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:22:02,302 INFO L87 Difference]: Start difference. First operand 408 states and 1143 transitions. Second operand has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:04,041 INFO L93 Difference]: Finished difference Result 432 states and 1183 transitions. [2025-04-13 22:22:04,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:22:04,041 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:04,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:04,042 INFO L225 Difference]: With dead ends: 432 [2025-04-13 22:22:04,042 INFO L226 Difference]: Without dead ends: 415 [2025-04-13 22:22:04,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:22:04,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:04,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:22:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-04-13 22:22:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 408. [2025-04-13 22:22:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.8034398034398036) internal successors, (1141), 407 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1141 transitions. [2025-04-13 22:22:04,949 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1141 transitions. Word has length 21 [2025-04-13 22:22:04,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:04,949 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1141 transitions. [2025-04-13 22:22:04,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:04,949 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1141 transitions. [2025-04-13 22:22:04,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:04,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:04,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:04,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:05,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:05,150 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:05,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1465109545, now seen corresponding path program 117 times [2025-04-13 22:22:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:05,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851585917] [2025-04-13 22:22:05,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:05,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:05,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:05,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:05,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:05,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851585917] [2025-04-13 22:22:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851585917] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:05,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511132722] [2025-04-13 22:22:05,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:05,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:05,333 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:05,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-04-13 22:22:05,538 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:05,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:05,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:05,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:05,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:22:05,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:05,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:05,746 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:05,746 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 44 treesize of output 19 [2025-04-13 22:22:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511132722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:05,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:05,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-04-13 22:22:05,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238288670] [2025-04-13 22:22:05,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:05,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:22:05,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:05,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:22:05,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:22:05,767 INFO L87 Difference]: Start difference. First operand 408 states and 1141 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:08,687 INFO L93 Difference]: Finished difference Result 606 states and 1654 transitions. [2025-04-13 22:22:08,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:22:08,688 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:08,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:08,689 INFO L225 Difference]: With dead ends: 606 [2025-04-13 22:22:08,689 INFO L226 Difference]: Without dead ends: 595 [2025-04-13 22:22:08,689 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1411, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:22:08,690 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:08,690 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:22:08,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2025-04-13 22:22:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 416. [2025-04-13 22:22:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.8265060240963855) internal successors, (1173), 415 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:09,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1173 transitions. [2025-04-13 22:22:09,618 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1173 transitions. Word has length 21 [2025-04-13 22:22:09,618 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:09,618 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1173 transitions. [2025-04-13 22:22:09,618 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:09,618 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1173 transitions. [2025-04-13 22:22:09,619 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:09,619 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:09,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:09,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2025-04-13 22:22:09,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2025-04-13 22:22:09,819 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:09,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:09,820 INFO L85 PathProgramCache]: Analyzing trace with hash 421041680, now seen corresponding path program 118 times [2025-04-13 22:22:09,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:09,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648869584] [2025-04-13 22:22:09,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:09,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:09,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:09,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:10,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648869584] [2025-04-13 22:22:10,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648869584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:10,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486006959] [2025-04-13 22:22:10,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:10,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:10,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:10,151 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:10,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-04-13 22:22:10,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:10,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:10,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:10,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:22:10,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:10,466 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 73 treesize of output 37 [2025-04-13 22:22:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:22:10,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:10,549 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:10,549 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 113 treesize of output 56 [2025-04-13 22:22:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486006959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:10,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:10,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 28 [2025-04-13 22:22:10,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944873951] [2025-04-13 22:22:10,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:10,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:22:10,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:10,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:22:10,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:22:10,577 INFO L87 Difference]: Start difference. First operand 416 states and 1173 transitions. Second operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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-13 22:22:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:13,431 INFO L93 Difference]: Finished difference Result 570 states and 1538 transitions. [2025-04-13 22:22:13,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:22:13,431 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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) Word has length 21 [2025-04-13 22:22:13,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:13,433 INFO L225 Difference]: With dead ends: 570 [2025-04-13 22:22:13,433 INFO L226 Difference]: Without dead ends: 547 [2025-04-13 22:22:13,433 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=321, Invalid=2129, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:22:13,433 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:13,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:22:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-04-13 22:22:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 416. [2025-04-13 22:22:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.816867469879518) internal successors, (1169), 415 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1169 transitions. [2025-04-13 22:22:14,367 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1169 transitions. Word has length 21 [2025-04-13 22:22:14,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:14,367 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1169 transitions. [2025-04-13 22:22:14,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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-13 22:22:14,367 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1169 transitions. [2025-04-13 22:22:14,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:14,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:14,367 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:14,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2025-04-13 22:22:14,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:14,568 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:14,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1495266421, now seen corresponding path program 119 times [2025-04-13 22:22:14,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:14,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179835355] [2025-04-13 22:22:14,568 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:14,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:14,583 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:14,583 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:22:14,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:22:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:14,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179835355] [2025-04-13 22:22:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179835355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:14,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571231328] [2025-04-13 22:22:14,779 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:14,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:14,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:14,781 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:14,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-04-13 22:22:14,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:15,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:15,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:22:15,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:15,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:22:15,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:22:15,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:15,214 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:15,214 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 44 treesize of output 19 [2025-04-13 22:22:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:15,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571231328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:15,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:15,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 20 [2025-04-13 22:22:15,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029202702] [2025-04-13 22:22:15,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:15,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:22:15,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:15,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:22:15,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:22:15,236 INFO L87 Difference]: Start difference. First operand 416 states and 1169 transitions. Second operand has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:18,549 INFO L93 Difference]: Finished difference Result 617 states and 1668 transitions. [2025-04-13 22:22:18,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:22:18,549 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:18,549 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:18,551 INFO L225 Difference]: With dead ends: 617 [2025-04-13 22:22:18,551 INFO L226 Difference]: Without dead ends: 609 [2025-04-13 22:22:18,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:22:18,551 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:18,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-04-13 22:22:19,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 418. [2025-04-13 22:22:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.820143884892086) internal successors, (1176), 417 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:19,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1176 transitions. [2025-04-13 22:22:19,493 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1176 transitions. Word has length 21 [2025-04-13 22:22:19,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:19,493 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1176 transitions. [2025-04-13 22:22:19,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.85) internal successors, (37), 20 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:19,493 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1176 transitions. [2025-04-13 22:22:19,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:19,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:19,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:19,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Ended with exit code 0 [2025-04-13 22:22:19,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:19,694 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:19,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash 992496486, now seen corresponding path program 120 times [2025-04-13 22:22:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:19,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986562674] [2025-04-13 22:22:19,694 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:19,702 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:19,711 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:19,711 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:22:19,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:22:19,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:19,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986562674] [2025-04-13 22:22:19,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986562674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:19,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675289926] [2025-04-13 22:22:19,987 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:19,989 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:19,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-04-13 22:22:20,199 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:20,218 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:20,218 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:22:20,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:20,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:22:20,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:20,323 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 82 treesize of output 50 [2025-04-13 22:22:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:20,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:20,421 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:20,421 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 113 treesize of output 56 [2025-04-13 22:22:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:20,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675289926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:20,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:20,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 24 [2025-04-13 22:22:20,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611068578] [2025-04-13 22:22:20,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:20,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:22:20,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:20,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:22:20,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:22:20,449 INFO L87 Difference]: Start difference. First operand 418 states and 1176 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:22,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:22,769 INFO L93 Difference]: Finished difference Result 531 states and 1457 transitions. [2025-04-13 22:22:22,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:22:22,769 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:22,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:22,770 INFO L225 Difference]: With dead ends: 531 [2025-04-13 22:22:22,770 INFO L226 Difference]: Without dead ends: 518 [2025-04-13 22:22:22,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:22:22,771 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:22,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:22:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-04-13 22:22:23,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 420. [2025-04-13 22:22:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.8138424821002386) internal successors, (1179), 419 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1179 transitions. [2025-04-13 22:22:23,730 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1179 transitions. Word has length 21 [2025-04-13 22:22:23,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:23,730 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1179 transitions. [2025-04-13 22:22:23,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:23,730 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1179 transitions. [2025-04-13 22:22:23,730 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:23,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:23,730 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:23,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:23,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:23,931 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:23,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:23,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1093250089, now seen corresponding path program 121 times [2025-04-13 22:22:23,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:23,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593105349] [2025-04-13 22:22:23,931 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:23,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:22:23,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:23,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:23,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:24,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593105349] [2025-04-13 22:22:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593105349] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:24,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707214236] [2025-04-13 22:22:24,215 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:24,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:24,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:24,217 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:24,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-04-13 22:22:24,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:22:24,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:24,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:24,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:24,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:22:24,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:24,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:24,663 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:24,663 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 44 treesize of output 19 [2025-04-13 22:22:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:24,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707214236] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:24,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:24,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2025-04-13 22:22:24,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580585940] [2025-04-13 22:22:24,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:24,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:22:24,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:24,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:22:24,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:22:24,689 INFO L87 Difference]: Start difference. First operand 420 states and 1179 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:22:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:28,419 INFO L93 Difference]: Finished difference Result 680 states and 1785 transitions. [2025-04-13 22:22:28,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:22:28,420 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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) Word has length 21 [2025-04-13 22:22:28,420 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:28,421 INFO L225 Difference]: With dead ends: 680 [2025-04-13 22:22:28,421 INFO L226 Difference]: Without dead ends: 672 [2025-04-13 22:22:28,421 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=2373, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:22:28,422 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:28,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-04-13 22:22:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 422. [2025-04-13 22:22:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.817102137767221) internal successors, (1186), 421 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1186 transitions. [2025-04-13 22:22:29,370 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1186 transitions. Word has length 21 [2025-04-13 22:22:29,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:29,371 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1186 transitions. [2025-04-13 22:22:29,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:22:29,371 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1186 transitions. [2025-04-13 22:22:29,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:29,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:29,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:29,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2025-04-13 22:22:29,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:29,572 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:29,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1866237166, now seen corresponding path program 122 times [2025-04-13 22:22:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:29,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107768362] [2025-04-13 22:22:29,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:29,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:29,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:29,590 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:29,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:29,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:29,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107768362] [2025-04-13 22:22:29,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107768362] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:29,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491565741] [2025-04-13 22:22:29,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:29,928 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:29,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-04-13 22:22:30,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:30,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:30,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:30,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:30,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:22:30,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:30,293 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 61 treesize of output 37 [2025-04-13 22:22:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:22:30,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:30,393 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:30,394 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 113 treesize of output 56 [2025-04-13 22:22:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491565741] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:30,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 26 [2025-04-13 22:22:30,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884382966] [2025-04-13 22:22:30,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:30,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:22:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:30,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:22:30,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:22:30,421 INFO L87 Difference]: Start difference. First operand 422 states and 1186 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:22:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:33,464 INFO L93 Difference]: Finished difference Result 617 states and 1633 transitions. [2025-04-13 22:22:33,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:22:33,465 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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) Word has length 21 [2025-04-13 22:22:33,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:33,466 INFO L225 Difference]: With dead ends: 617 [2025-04-13 22:22:33,466 INFO L226 Difference]: Without dead ends: 606 [2025-04-13 22:22:33,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:22:33,467 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:33,467 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:22:33,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-04-13 22:22:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 424. [2025-04-13 22:22:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.810874704491726) internal successors, (1189), 423 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:34,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1189 transitions. [2025-04-13 22:22:34,423 INFO L79 Accepts]: Start accepts. Automaton has 424 states and 1189 transitions. Word has length 21 [2025-04-13 22:22:34,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:34,423 INFO L485 AbstractCegarLoop]: Abstraction has 424 states and 1189 transitions. [2025-04-13 22:22:34,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:22:34,423 INFO L278 IsEmpty]: Start isEmpty. Operand 424 states and 1189 transitions. [2025-04-13 22:22:34,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:34,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:34,423 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:34,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2025-04-13 22:22:34,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2025-04-13 22:22:34,624 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:34,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:34,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1594196021, now seen corresponding path program 123 times [2025-04-13 22:22:34,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:34,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082986225] [2025-04-13 22:22:34,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:34,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:34,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:34,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:34,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:34,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:34,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082986225] [2025-04-13 22:22:34,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082986225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:34,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187068892] [2025-04-13 22:22:34,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:34,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:34,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:34,941 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:34,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-04-13 22:22:35,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:35,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:35,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:35,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:22:35,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:35,311 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 112 treesize of output 72 [2025-04-13 22:22:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:35,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:35,425 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:35,425 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 44 treesize of output 19 [2025-04-13 22:22:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187068892] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:35,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2025-04-13 22:22:35,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246678331] [2025-04-13 22:22:35,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:35,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:22:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:35,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:22:35,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:22:35,449 INFO L87 Difference]: Start difference. First operand 424 states and 1189 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:38,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:38,844 INFO L93 Difference]: Finished difference Result 633 states and 1661 transitions. [2025-04-13 22:22:38,844 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:22:38,844 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:38,844 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:38,846 INFO L225 Difference]: With dead ends: 633 [2025-04-13 22:22:38,846 INFO L226 Difference]: Without dead ends: 625 [2025-04-13 22:22:38,846 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=409, Invalid=1847, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:22:38,846 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:38,846 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:22:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-04-13 22:22:39,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 426. [2025-04-13 22:22:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.8188235294117647) internal successors, (1198), 425 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1198 transitions. [2025-04-13 22:22:39,801 INFO L79 Accepts]: Start accepts. Automaton has 426 states and 1198 transitions. Word has length 21 [2025-04-13 22:22:39,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:39,801 INFO L485 AbstractCegarLoop]: Abstraction has 426 states and 1198 transitions. [2025-04-13 22:22:39,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:39,801 INFO L278 IsEmpty]: Start isEmpty. Operand 426 states and 1198 transitions. [2025-04-13 22:22:39,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:39,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:39,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:39,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2025-04-13 22:22:40,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2025-04-13 22:22:40,003 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:40,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1569260954, now seen corresponding path program 124 times [2025-04-13 22:22:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:40,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787429006] [2025-04-13 22:22:40,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:40,011 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:40,018 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:40,018 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:40,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:40,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:40,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787429006] [2025-04-13 22:22:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787429006] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:40,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081634000] [2025-04-13 22:22:40,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:40,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:40,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:40,316 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:40,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2025-04-13 22:22:40,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:22:40,549 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:40,549 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:40,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:40,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:22:40,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:40,665 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 132 treesize of output 72 [2025-04-13 22:22:40,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:22:40,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:40,791 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:40,792 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 113 treesize of output 56 [2025-04-13 22:22:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:40,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081634000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:40,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 29 [2025-04-13 22:22:40,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461000590] [2025-04-13 22:22:40,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:40,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:22:40,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:40,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:22:40,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:22:40,822 INFO L87 Difference]: Start difference. First operand 426 states and 1198 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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-13 22:22:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:43,703 INFO L93 Difference]: Finished difference Result 558 states and 1512 transitions. [2025-04-13 22:22:43,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:22:43,703 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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) Word has length 21 [2025-04-13 22:22:43,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:43,705 INFO L225 Difference]: With dead ends: 558 [2025-04-13 22:22:43,705 INFO L226 Difference]: Without dead ends: 549 [2025-04-13 22:22:43,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:22:43,705 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:43,706 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:22:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-04-13 22:22:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 428. [2025-04-13 22:22:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.812646370023419) internal successors, (1201), 427 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1201 transitions. [2025-04-13 22:22:44,677 INFO L79 Accepts]: Start accepts. Automaton has 428 states and 1201 transitions. Word has length 21 [2025-04-13 22:22:44,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:44,677 INFO L485 AbstractCegarLoop]: Abstraction has 428 states and 1201 transitions. [2025-04-13 22:22:44,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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-13 22:22:44,677 INFO L278 IsEmpty]: Start isEmpty. Operand 428 states and 1201 transitions. [2025-04-13 22:22:44,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:44,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:44,677 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:44,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2025-04-13 22:22:44,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 22:22:44,878 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:44,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1680083474, now seen corresponding path program 125 times [2025-04-13 22:22:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:44,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930558730] [2025-04-13 22:22:44,878 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:44,886 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:44,893 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:44,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:22:44,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:22:45,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:45,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930558730] [2025-04-13 22:22:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930558730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:45,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849159429] [2025-04-13 22:22:45,138 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:45,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:45,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:45,140 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:45,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-04-13 22:22:45,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:45,394 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:45,394 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:22:45,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:45,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:22:45,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:45,501 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 132 treesize of output 72 [2025-04-13 22:22:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:45,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:45,599 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:22:45,599 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 113 treesize of output 56 [2025-04-13 22:22:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849159429] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:45,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:45,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2025-04-13 22:22:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597126977] [2025-04-13 22:22:45,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:45,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:22:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:45,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:22:45,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:22:45,625 INFO L87 Difference]: Start difference. First operand 428 states and 1201 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:48,981 INFO L93 Difference]: Finished difference Result 662 states and 1723 transitions. [2025-04-13 22:22:48,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:22:48,982 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:22:48,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:48,983 INFO L225 Difference]: With dead ends: 662 [2025-04-13 22:22:48,983 INFO L226 Difference]: Without dead ends: 655 [2025-04-13 22:22:48,983 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:22:48,983 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:48,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:22:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-04-13 22:22:49,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 428. [2025-04-13 22:22:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.812646370023419) internal successors, (1201), 427 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1201 transitions. [2025-04-13 22:22:49,951 INFO L79 Accepts]: Start accepts. Automaton has 428 states and 1201 transitions. Word has length 21 [2025-04-13 22:22:49,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:49,951 INFO L485 AbstractCegarLoop]: Abstraction has 428 states and 1201 transitions. [2025-04-13 22:22:49,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:49,951 INFO L278 IsEmpty]: Start isEmpty. Operand 428 states and 1201 transitions. [2025-04-13 22:22:49,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:49,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:49,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:49,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:50,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:50,152 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:50,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:50,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1652288471, now seen corresponding path program 126 times [2025-04-13 22:22:50,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:50,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458904891] [2025-04-13 22:22:50,153 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:50,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:50,160 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:50,169 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:50,169 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:22:50,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:50,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458904891] [2025-04-13 22:22:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458904891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:50,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504573349] [2025-04-13 22:22:50,528 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:50,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:50,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:50,529 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:50,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-04-13 22:22:50,748 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:22:50,767 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:50,767 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:22:50,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:50,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:22:50,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:50,775 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-13 22:22:50,786 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 19 treesize of output 1 [2025-04-13 22:22:50,913 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 112 treesize of output 72 [2025-04-13 22:22:50,943 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:50,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:51,078 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:51,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504573349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:51,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:51,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 9] total 29 [2025-04-13 22:22:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585224207] [2025-04-13 22:22:51,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:51,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:22:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:51,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:22:51,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:22:51,079 INFO L87 Difference]: Start difference. First operand 428 states and 1201 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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-13 22:22:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:55,171 INFO L93 Difference]: Finished difference Result 623 states and 1632 transitions. [2025-04-13 22:22:55,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 22:22:55,171 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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) Word has length 21 [2025-04-13 22:22:55,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:55,173 INFO L225 Difference]: With dead ends: 623 [2025-04-13 22:22:55,173 INFO L226 Difference]: Without dead ends: 612 [2025-04-13 22:22:55,173 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=664, Invalid=3496, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:22:55,173 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:55,173 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:22:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-04-13 22:22:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 420. [2025-04-13 22:22:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.8138424821002386) internal successors, (1179), 419 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1179 transitions. [2025-04-13 22:22:56,144 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1179 transitions. Word has length 21 [2025-04-13 22:22:56,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:56,145 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1179 transitions. [2025-04-13 22:22:56,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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-13 22:22:56,145 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1179 transitions. [2025-04-13 22:22:56,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:22:56,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:56,145 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:22:56,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2025-04-13 22:22:56,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2025-04-13 22:22:56,346 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:56,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1510373515, now seen corresponding path program 127 times [2025-04-13 22:22:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:56,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394090070] [2025-04-13 22:22:56,346 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:56,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:22:56,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:56,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:56,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:22:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:56,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394090070] [2025-04-13 22:22:56,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394090070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:56,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384278747] [2025-04-13 22:22:56,606 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:56,608 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:22:56,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2025-04-13 22:22:56,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:22:56,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:22:56,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:56,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:56,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:22:56,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:56,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:57,024 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:57,024 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 53 treesize of output 29 [2025-04-13 22:22:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:22:57,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384278747] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:57,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-04-13 22:22:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001465309] [2025-04-13 22:22:57,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:57,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:22:57,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:57,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:22:57,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:22:57,065 INFO L87 Difference]: Start difference. First operand 420 states and 1179 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 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-13 22:23:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:00,470 INFO L93 Difference]: Finished difference Result 645 states and 1726 transitions. [2025-04-13 22:23:00,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:23:00,470 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 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) Word has length 21 [2025-04-13 22:23:00,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:00,472 INFO L225 Difference]: With dead ends: 645 [2025-04-13 22:23:00,472 INFO L226 Difference]: Without dead ends: 637 [2025-04-13 22:23:00,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=2220, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:23:00,472 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:00,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:23:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-04-13 22:23:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 414. [2025-04-13 22:23:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.803874092009685) internal successors, (1158), 413 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1158 transitions. [2025-04-13 22:23:01,429 INFO L79 Accepts]: Start accepts. Automaton has 414 states and 1158 transitions. Word has length 21 [2025-04-13 22:23:01,429 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:01,429 INFO L485 AbstractCegarLoop]: Abstraction has 414 states and 1158 transitions. [2025-04-13 22:23:01,429 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 25 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-13 22:23:01,429 INFO L278 IsEmpty]: Start isEmpty. Operand 414 states and 1158 transitions. [2025-04-13 22:23:01,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:01,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:01,430 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:01,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2025-04-13 22:23:01,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2025-04-13 22:23:01,630 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:01,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1055546447, now seen corresponding path program 128 times [2025-04-13 22:23:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:01,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570121714] [2025-04-13 22:23:01,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:01,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:01,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:01,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:01,860 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:01,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570121714] [2025-04-13 22:23:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570121714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:01,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844673946] [2025-04-13 22:23:01,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:01,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:01,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:01,863 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:01,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2025-04-13 22:23:02,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:02,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:02,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:02,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:02,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:23:02,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:02,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:02,323 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:02,323 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 53 treesize of output 29 [2025-04-13 22:23:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844673946] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:02,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-04-13 22:23:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698702703] [2025-04-13 22:23:02,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:02,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:23:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:02,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:23:02,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:23:02,364 INFO L87 Difference]: Start difference. First operand 414 states and 1158 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:06,554 INFO L93 Difference]: Finished difference Result 735 states and 1935 transitions. [2025-04-13 22:23:06,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 22:23:06,555 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:06,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:06,556 INFO L225 Difference]: With dead ends: 735 [2025-04-13 22:23:06,557 INFO L226 Difference]: Without dead ends: 727 [2025-04-13 22:23:06,557 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=2782, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:23:06,557 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:06,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-04-13 22:23:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 412. [2025-04-13 22:23:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.800486618004866) internal successors, (1151), 411 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1151 transitions. [2025-04-13 22:23:07,513 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1151 transitions. Word has length 21 [2025-04-13 22:23:07,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:07,513 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1151 transitions. [2025-04-13 22:23:07,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:07,513 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1151 transitions. [2025-04-13 22:23:07,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:07,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:07,514 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:07,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2025-04-13 22:23:07,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:07,714 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:07,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:07,715 INFO L85 PathProgramCache]: Analyzing trace with hash -282559370, now seen corresponding path program 129 times [2025-04-13 22:23:07,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:07,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292772395] [2025-04-13 22:23:07,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:07,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:07,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 21 statements. [2025-04-13 22:23:07,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:23:07,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:07,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292772395] [2025-04-13 22:23:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292772395] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:07,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839122352] [2025-04-13 22:23:07,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:07,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:07,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:07,927 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:07,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2025-04-13 22:23:08,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:08,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 21 statements. [2025-04-13 22:23:08,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:23:08,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:08,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:23:08,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:08,294 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 61 treesize of output 37 [2025-04-13 22:23:08,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:08,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:08,385 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:08,385 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 119 treesize of output 63 [2025-04-13 22:23:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839122352] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:08,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2025-04-13 22:23:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805172783] [2025-04-13 22:23:08,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:08,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:23:08,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:08,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:23:08,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:23:08,434 INFO L87 Difference]: Start difference. First operand 412 states and 1151 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:11,534 INFO L93 Difference]: Finished difference Result 626 states and 1624 transitions. [2025-04-13 22:23:11,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:23:11,534 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:11,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:11,536 INFO L225 Difference]: With dead ends: 626 [2025-04-13 22:23:11,536 INFO L226 Difference]: Without dead ends: 611 [2025-04-13 22:23:11,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:23:11,536 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:11,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:23:11,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-04-13 22:23:12,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 418. [2025-04-13 22:23:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.800959232613909) internal successors, (1168), 417 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1168 transitions. [2025-04-13 22:23:12,506 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1168 transitions. Word has length 21 [2025-04-13 22:23:12,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:12,506 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1168 transitions. [2025-04-13 22:23:12,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:12,506 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1168 transitions. [2025-04-13 22:23:12,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:12,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:12,507 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:12,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2025-04-13 22:23:12,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:12,707 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:12,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash 549293549, now seen corresponding path program 130 times [2025-04-13 22:23:12,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:12,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561095295] [2025-04-13 22:23:12,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:12,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:12,715 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:12,722 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:12,722 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:12,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:23:13,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:13,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561095295] [2025-04-13 22:23:13,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561095295] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:13,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097865772] [2025-04-13 22:23:13,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:13,028 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:13,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-04-13 22:23:13,253 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:13,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:13,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:13,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:23:13,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:13,385 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 107 treesize of output 59 [2025-04-13 22:23:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:23:13,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:13,489 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:13,490 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 53 treesize of output 29 [2025-04-13 22:23:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:13,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097865772] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:13,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2025-04-13 22:23:13,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901661403] [2025-04-13 22:23:13,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:13,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:23:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:13,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:23:13,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:23:13,538 INFO L87 Difference]: Start difference. First operand 418 states and 1168 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:23:17,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:17,382 INFO L93 Difference]: Finished difference Result 628 states and 1688 transitions. [2025-04-13 22:23:17,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:23:17,383 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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) Word has length 21 [2025-04-13 22:23:17,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:17,384 INFO L225 Difference]: With dead ends: 628 [2025-04-13 22:23:17,384 INFO L226 Difference]: Without dead ends: 620 [2025-04-13 22:23:17,385 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=562, Invalid=3860, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:23:17,385 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:17,385 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2025-04-13 22:23:18,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 418. [2025-04-13 22:23:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.800959232613909) internal successors, (1168), 417 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1168 transitions. [2025-04-13 22:23:18,358 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1168 transitions. Word has length 21 [2025-04-13 22:23:18,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:18,358 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1168 transitions. [2025-04-13 22:23:18,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:23:18,358 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1168 transitions. [2025-04-13 22:23:18,359 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:18,359 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:18,359 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:18,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2025-04-13 22:23:18,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:18,559 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:18,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 463406096, now seen corresponding path program 131 times [2025-04-13 22:23:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:18,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389263977] [2025-04-13 22:23:18,560 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:18,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:18,567 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:18,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:18,575 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:23:18,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:23:18,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:18,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389263977] [2025-04-13 22:23:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389263977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:18,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933350601] [2025-04-13 22:23:18,798 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:18,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:18,800 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:18,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2025-04-13 22:23:19,024 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:19,045 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:19,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:23:19,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:19,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:23:19,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:19,137 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 132 treesize of output 72 [2025-04-13 22:23:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:23:19,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:19,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:19,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 49 [2025-04-13 22:23:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933350601] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:19,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 21 [2025-04-13 22:23:19,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93658086] [2025-04-13 22:23:19,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:19,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:23:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:19,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:23:19,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:23:19,279 INFO L87 Difference]: Start difference. First operand 418 states and 1168 transitions. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:23,839 INFO L93 Difference]: Finished difference Result 796 states and 1976 transitions. [2025-04-13 22:23:23,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:23:23,840 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:23,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:23,842 INFO L225 Difference]: With dead ends: 796 [2025-04-13 22:23:23,842 INFO L226 Difference]: Without dead ends: 789 [2025-04-13 22:23:23,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=345, Invalid=1911, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:23:23,842 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:23,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:23:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-04-13 22:23:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 416. [2025-04-13 22:23:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.8072289156626504) internal successors, (1165), 415 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1165 transitions. [2025-04-13 22:23:24,829 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1165 transitions. Word has length 21 [2025-04-13 22:23:24,829 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:24,829 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1165 transitions. [2025-04-13 22:23:24,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:24,829 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1165 transitions. [2025-04-13 22:23:24,830 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:24,830 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:24,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:24,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2025-04-13 22:23:25,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable143 [2025-04-13 22:23:25,030 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:25,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1005313355, now seen corresponding path program 132 times [2025-04-13 22:23:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:25,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164532227] [2025-04-13 22:23:25,031 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:25,038 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:25,046 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:25,046 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:23:25,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:23:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:25,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164532227] [2025-04-13 22:23:25,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164532227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:25,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927537376] [2025-04-13 22:23:25,299 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:25,301 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:25,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-04-13 22:23:25,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:25,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:25,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:23:25,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:25,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:23:25,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:25,553 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-13 22:23:25,562 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 19 treesize of output 1 [2025-04-13 22:23:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:23:25,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927537376] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:25,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:25,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 25 [2025-04-13 22:23:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104512801] [2025-04-13 22:23:25,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:25,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:23:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:25,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:23:25,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:23:25,786 INFO L87 Difference]: Start difference. First operand 416 states and 1165 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:30,696 INFO L93 Difference]: Finished difference Result 701 states and 1729 transitions. [2025-04-13 22:23:30,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 22:23:30,696 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:30,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:30,698 INFO L225 Difference]: With dead ends: 701 [2025-04-13 22:23:30,698 INFO L226 Difference]: Without dead ends: 689 [2025-04-13 22:23:30,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=929, Invalid=5077, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 22:23:30,699 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:30,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:23:30,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-04-13 22:23:31,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 402. [2025-04-13 22:23:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.7531172069825436) internal successors, (1104), 401 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1104 transitions. [2025-04-13 22:23:31,666 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 1104 transitions. Word has length 21 [2025-04-13 22:23:31,666 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:31,666 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 1104 transitions. [2025-04-13 22:23:31,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:31,666 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 1104 transitions. [2025-04-13 22:23:31,667 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:31,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:31,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:31,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2025-04-13 22:23:31,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable144 [2025-04-13 22:23:31,867 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:31,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:31,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1778300432, now seen corresponding path program 133 times [2025-04-13 22:23:31,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:31,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425276030] [2025-04-13 22:23:31,868 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:31,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:31,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:23:31,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:31,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:31,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:23:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:32,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425276030] [2025-04-13 22:23:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425276030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:32,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812411197] [2025-04-13 22:23:32,119 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:32,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:32,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:32,121 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:32,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-04-13 22:23:32,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:23:32,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:32,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:32,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:32,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:23:32,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:32,447 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 73 treesize of output 37 [2025-04-13 22:23:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:32,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:32,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:32,518 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 61 [2025-04-13 22:23:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:32,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812411197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:32,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:32,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2025-04-13 22:23:32,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229920508] [2025-04-13 22:23:32,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:32,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:23:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:32,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:23:32,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:23:32,581 INFO L87 Difference]: Start difference. First operand 402 states and 1104 transitions. Second operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:35,639 INFO L93 Difference]: Finished difference Result 592 states and 1534 transitions. [2025-04-13 22:23:35,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:23:35,640 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:35,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:35,641 INFO L225 Difference]: With dead ends: 592 [2025-04-13 22:23:35,641 INFO L226 Difference]: Without dead ends: 577 [2025-04-13 22:23:35,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=264, Invalid=1992, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:23:35,642 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:35,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:23:35,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-04-13 22:23:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 408. [2025-04-13 22:23:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.7395577395577395) internal successors, (1115), 407 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:36,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1115 transitions. [2025-04-13 22:23:36,622 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1115 transitions. Word has length 21 [2025-04-13 22:23:36,622 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:36,622 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1115 transitions. [2025-04-13 22:23:36,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:36,622 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1115 transitions. [2025-04-13 22:23:36,622 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:36,622 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:36,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:36,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2025-04-13 22:23:36,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2025-04-13 22:23:36,823 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:36,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1682132755, now seen corresponding path program 134 times [2025-04-13 22:23:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:36,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317903148] [2025-04-13 22:23:36,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:36,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:36,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:36,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:36,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:23:37,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:37,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317903148] [2025-04-13 22:23:37,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317903148] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:37,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200276394] [2025-04-13 22:23:37,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:37,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:37,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:37,136 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:37,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-04-13 22:23:37,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:37,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:37,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:37,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:37,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:23:37,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:37,449 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 112 treesize of output 72 [2025-04-13 22:23:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:23:37,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:37,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:37,529 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 51 treesize of output 27 [2025-04-13 22:23:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200276394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:37,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 23 [2025-04-13 22:23:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998954865] [2025-04-13 22:23:37,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:37,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:23:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:37,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:23:37,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:23:37,581 INFO L87 Difference]: Start difference. First operand 408 states and 1115 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:41,837 INFO L93 Difference]: Finished difference Result 704 states and 1776 transitions. [2025-04-13 22:23:41,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:23:41,837 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:41,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:41,839 INFO L225 Difference]: With dead ends: 704 [2025-04-13 22:23:41,839 INFO L226 Difference]: Without dead ends: 696 [2025-04-13 22:23:41,840 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 827 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=3164, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:23:41,840 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:41,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:41,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-04-13 22:23:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 408. [2025-04-13 22:23:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.7395577395577395) internal successors, (1115), 407 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1115 transitions. [2025-04-13 22:23:42,822 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1115 transitions. Word has length 21 [2025-04-13 22:23:42,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:42,822 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1115 transitions. [2025-04-13 22:23:42,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:42,823 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1115 transitions. [2025-04-13 22:23:42,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:42,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:42,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:42,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:43,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2025-04-13 22:23:43,024 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:43,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:43,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1657197688, now seen corresponding path program 135 times [2025-04-13 22:23:43,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:43,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032821220] [2025-04-13 22:23:43,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:43,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:43,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:43,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:23:43,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:43,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:43,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032821220] [2025-04-13 22:23:43,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032821220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:43,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782651972] [2025-04-13 22:23:43,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:43,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:43,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:43,249 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:43,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2025-04-13 22:23:43,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:43,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:43,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:23:43,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:43,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:23:43,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:43,526 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-13 22:23:43,537 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 19 treesize of output 1 [2025-04-13 22:23:43,636 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 91 treesize of output 59 [2025-04-13 22:23:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:23:43,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:43,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782651972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:43,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:43,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 27 [2025-04-13 22:23:43,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259348185] [2025-04-13 22:23:43,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:43,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:23:43,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:43,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:23:43,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:23:43,818 INFO L87 Difference]: Start difference. First operand 408 states and 1115 transitions. Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 22:23:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:48,302 INFO L93 Difference]: Finished difference Result 685 states and 1675 transitions. [2025-04-13 22:23:48,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:23:48,302 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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) Word has length 21 [2025-04-13 22:23:48,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:48,304 INFO L225 Difference]: With dead ends: 685 [2025-04-13 22:23:48,304 INFO L226 Difference]: Without dead ends: 674 [2025-04-13 22:23:48,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=628, Invalid=4484, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 22:23:48,304 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:48,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-04-13 22:23:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 420. [2025-04-13 22:23:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.7517899761336517) internal successors, (1153), 419 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1153 transitions. [2025-04-13 22:23:49,303 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1153 transitions. Word has length 21 [2025-04-13 22:23:49,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:49,303 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1153 transitions. [2025-04-13 22:23:49,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 22:23:49,303 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1153 transitions. [2025-04-13 22:23:49,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:49,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:49,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:49,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Ended with exit code 0 [2025-04-13 22:23:49,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 22:23:49,504 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:49,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1768020208, now seen corresponding path program 136 times [2025-04-13 22:23:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:49,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537050783] [2025-04-13 22:23:49,504 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:49,511 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:49,518 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:49,518 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:23:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:49,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537050783] [2025-04-13 22:23:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537050783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:49,785 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613192842] [2025-04-13 22:23:49,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:49,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:49,787 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:49,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-04-13 22:23:50,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:23:50,036 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:50,037 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:50,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:50,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:23:50,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:50,134 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 107 treesize of output 59 [2025-04-13 22:23:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:23:50,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:50,220 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:50,221 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 61 [2025-04-13 22:23:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:50,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613192842] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:50,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:50,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 27 [2025-04-13 22:23:50,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217550641] [2025-04-13 22:23:50,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:50,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:23:50,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:50,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:23:50,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:23:50,299 INFO L87 Difference]: Start difference. First operand 420 states and 1153 transitions. Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 22:23:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:53,949 INFO L93 Difference]: Finished difference Result 619 states and 1607 transitions. [2025-04-13 22:23:53,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:23:53,950 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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) Word has length 21 [2025-04-13 22:23:53,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:53,951 INFO L225 Difference]: With dead ends: 619 [2025-04-13 22:23:53,951 INFO L226 Difference]: Without dead ends: 610 [2025-04-13 22:23:53,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=404, Invalid=3018, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:23:53,952 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:53,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-04-13 22:23:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 420. [2025-04-13 22:23:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.747016706443914) internal successors, (1151), 419 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1151 transitions. [2025-04-13 22:23:54,956 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1151 transitions. Word has length 21 [2025-04-13 22:23:54,956 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:54,956 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1151 transitions. [2025-04-13 22:23:54,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 22:23:54,956 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1151 transitions. [2025-04-13 22:23:54,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:54,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:54,957 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:54,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2025-04-13 22:23:55,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2025-04-13 22:23:55,157 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:55,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1740225205, now seen corresponding path program 137 times [2025-04-13 22:23:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:55,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173716916] [2025-04-13 22:23:55,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:55,165 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:55,173 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:55,173 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:23:55,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:23:55,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:55,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173716916] [2025-04-13 22:23:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173716916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:55,409 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712945172] [2025-04-13 22:23:55,409 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:55,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:55,411 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:23:55,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2025-04-13 22:23:55,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:55,676 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:55,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:23:55,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:55,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:23:55,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:55,762 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 107 treesize of output 59 [2025-04-13 22:23:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:55,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:55,864 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:55,865 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 51 treesize of output 27 [2025-04-13 22:23:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:23:55,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712945172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:55,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2025-04-13 22:23:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136006973] [2025-04-13 22:23:55,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:55,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:23:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:55,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:23:55,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:23:55,929 INFO L87 Difference]: Start difference. First operand 420 states and 1151 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:59,052 INFO L93 Difference]: Finished difference Result 608 states and 1540 transitions. [2025-04-13 22:23:59,052 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:23:59,052 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:23:59,052 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:59,053 INFO L225 Difference]: With dead ends: 608 [2025-04-13 22:23:59,053 INFO L226 Difference]: Without dead ends: 448 [2025-04-13 22:23:59,054 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=483, Invalid=2379, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:23:59,054 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:59,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:23:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-04-13 22:23:59,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 203. [2025-04-13 22:23:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.3366336633663365) internal successors, (472), 202 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 472 transitions. [2025-04-13 22:23:59,550 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 472 transitions. Word has length 21 [2025-04-13 22:23:59,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:59,550 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 472 transitions. [2025-04-13 22:23:59,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:23:59,550 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 472 transitions. [2025-04-13 22:23:59,550 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:23:59,550 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:59,550 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:23:59,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Ended with exit code 0 [2025-04-13 22:23:59,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2025-04-13 22:23:59,751 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:59,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:59,751 INFO L85 PathProgramCache]: Analyzing trace with hash 44233389, now seen corresponding path program 138 times [2025-04-13 22:23:59,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:59,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135592174] [2025-04-13 22:23:59,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:59,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:59,760 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:23:59,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:23:59,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:23:59,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:00,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:00,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135592174] [2025-04-13 22:24:00,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135592174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:00,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541726045] [2025-04-13 22:24:00,025 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:00,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:00,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:00,027 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:00,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2025-04-13 22:24:00,264 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:00,283 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:00,284 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:24:00,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:00,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:24:00,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:00,372 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 91 treesize of output 59 [2025-04-13 22:24:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:00,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:00,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:00,440 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 87 treesize of output 47 [2025-04-13 22:24:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541726045] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:00,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:00,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 24 [2025-04-13 22:24:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24748504] [2025-04-13 22:24:00,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:00,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:24:00,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:00,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:24:00,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:24:00,502 INFO L87 Difference]: Start difference. First operand 203 states and 472 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:02,206 INFO L93 Difference]: Finished difference Result 280 states and 602 transitions. [2025-04-13 22:24:02,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:24:02,207 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:02,207 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:02,208 INFO L225 Difference]: With dead ends: 280 [2025-04-13 22:24:02,208 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 22:24:02,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:24:02,208 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:02,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:02,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 22:24:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 207. [2025-04-13 22:24:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.349514563106796) internal successors, (484), 206 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 484 transitions. [2025-04-13 22:24:02,716 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 484 transitions. Word has length 21 [2025-04-13 22:24:02,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:02,717 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 484 transitions. [2025-04-13 22:24:02,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:02,717 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 484 transitions. [2025-04-13 22:24:02,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:02,717 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:02,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:02,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2025-04-13 22:24:02,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable150 [2025-04-13 22:24:02,918 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:02,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -41654064, now seen corresponding path program 139 times [2025-04-13 22:24:02,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:02,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523644426] [2025-04-13 22:24:02,918 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:02,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:24:02,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:02,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:02,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:03,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523644426] [2025-04-13 22:24:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523644426] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:03,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70564516] [2025-04-13 22:24:03,166 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:03,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:03,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:03,168 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:03,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-04-13 22:24:03,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:24:03,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:03,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:03,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:24:03,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:03,489 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 107 treesize of output 59 [2025-04-13 22:24:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:03,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:03,565 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:03,566 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 51 treesize of output 27 [2025-04-13 22:24:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70564516] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:03,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-04-13 22:24:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048027830] [2025-04-13 22:24:03,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:03,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:24:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:03,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:24:03,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:24:03,621 INFO L87 Difference]: Start difference. First operand 207 states and 484 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:05,497 INFO L93 Difference]: Finished difference Result 289 states and 620 transitions. [2025-04-13 22:24:05,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:24:05,497 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:05,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:05,498 INFO L225 Difference]: With dead ends: 289 [2025-04-13 22:24:05,499 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 22:24:05,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=1737, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:24:05,499 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:05,499 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 22:24:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 205. [2025-04-13 22:24:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.3480392156862746) internal successors, (479), 204 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 479 transitions. [2025-04-13 22:24:06,007 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 479 transitions. Word has length 21 [2025-04-13 22:24:06,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:06,007 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 479 transitions. [2025-04-13 22:24:06,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:06,007 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 479 transitions. [2025-04-13 22:24:06,007 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:06,007 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:06,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:06,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2025-04-13 22:24:06,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:06,208 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:06,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:06,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1676689642, now seen corresponding path program 140 times [2025-04-13 22:24:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:06,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606212743] [2025-04-13 22:24:06,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:06,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:06,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:06,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:06,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:06,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:06,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606212743] [2025-04-13 22:24:06,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606212743] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:06,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876813012] [2025-04-13 22:24:06,557 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:06,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:06,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:06,559 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:06,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-04-13 22:24:06,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:06,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:06,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:06,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:06,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:24:06,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:06,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:06,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:06,980 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:06,981 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 51 treesize of output 27 [2025-04-13 22:24:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:07,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876813012] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:07,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:07,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 27 [2025-04-13 22:24:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963713363] [2025-04-13 22:24:07,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:07,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:24:07,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:07,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:24:07,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:07,033 INFO L87 Difference]: Start difference. First operand 205 states and 479 transitions. Second operand has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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-13 22:24:08,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:08,799 INFO L93 Difference]: Finished difference Result 269 states and 583 transitions. [2025-04-13 22:24:08,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:24:08,800 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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) Word has length 21 [2025-04-13 22:24:08,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:08,801 INFO L225 Difference]: With dead ends: 269 [2025-04-13 22:24:08,801 INFO L226 Difference]: Without dead ends: 264 [2025-04-13 22:24:08,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:24:08,801 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:08,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-04-13 22:24:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 205. [2025-04-13 22:24:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.3480392156862746) internal successors, (479), 204 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 479 transitions. [2025-04-13 22:24:09,307 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 479 transitions. Word has length 21 [2025-04-13 22:24:09,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:09,307 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 479 transitions. [2025-04-13 22:24:09,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7037037037037037) internal successors, (46), 27 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-13 22:24:09,307 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 479 transitions. [2025-04-13 22:24:09,307 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:09,307 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:09,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:09,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2025-04-13 22:24:09,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:09,508 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:09,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1728926931, now seen corresponding path program 141 times [2025-04-13 22:24:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:09,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083847017] [2025-04-13 22:24:09,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:09,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:09,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 21 statements. [2025-04-13 22:24:09,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:24:09,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:09,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:09,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083847017] [2025-04-13 22:24:09,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083847017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:09,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583606003] [2025-04-13 22:24:09,705 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:09,707 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:09,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-04-13 22:24:09,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:09,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 21 statements. [2025-04-13 22:24:09,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:24:09,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:09,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:24:09,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:10,105 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 82 treesize of output 50 [2025-04-13 22:24:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:10,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:10,170 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:10,170 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 87 treesize of output 47 [2025-04-13 22:24:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583606003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:10,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:10,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 25 [2025-04-13 22:24:10,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566445368] [2025-04-13 22:24:10,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:10,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:24:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:10,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:24:10,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:24:10,231 INFO L87 Difference]: Start difference. First operand 205 states and 479 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:11,899 INFO L93 Difference]: Finished difference Result 266 states and 588 transitions. [2025-04-13 22:24:11,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:24:11,899 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:11,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:11,900 INFO L225 Difference]: With dead ends: 266 [2025-04-13 22:24:11,900 INFO L226 Difference]: Without dead ends: 252 [2025-04-13 22:24:11,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=1593, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:24:11,901 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:11,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-04-13 22:24:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 203. [2025-04-13 22:24:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.3366336633663365) internal successors, (472), 202 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 472 transitions. [2025-04-13 22:24:12,404 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 472 transitions. Word has length 21 [2025-04-13 22:24:12,404 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:12,404 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 472 transitions. [2025-04-13 22:24:12,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:12,404 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 472 transitions. [2025-04-13 22:24:12,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:12,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:12,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:12,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2025-04-13 22:24:12,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:12,605 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:12,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1537278837, now seen corresponding path program 142 times [2025-04-13 22:24:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:12,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401341840] [2025-04-13 22:24:12,606 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:12,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:12,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:12,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:12,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:12,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:12,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:12,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401341840] [2025-04-13 22:24:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401341840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:12,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719017721] [2025-04-13 22:24:12,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:12,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:12,847 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:12,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2025-04-13 22:24:13,095 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:13,113 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:13,113 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:13,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:13,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:13,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:13,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:13,283 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:13,283 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 53 treesize of output 29 [2025-04-13 22:24:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719017721] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:13,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-04-13 22:24:13,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935870223] [2025-04-13 22:24:13,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:13,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:24:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:13,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:24:13,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:24:13,325 INFO L87 Difference]: Start difference. First operand 203 states and 472 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:14,698 INFO L93 Difference]: Finished difference Result 258 states and 571 transitions. [2025-04-13 22:24:14,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:24:14,698 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:14,699 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:14,700 INFO L225 Difference]: With dead ends: 258 [2025-04-13 22:24:14,700 INFO L226 Difference]: Without dead ends: 250 [2025-04-13 22:24:14,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=602, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:14,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:14,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-04-13 22:24:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 197. [2025-04-13 22:24:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.3520408163265305) internal successors, (461), 196 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:15,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 461 transitions. [2025-04-13 22:24:15,184 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 461 transitions. Word has length 21 [2025-04-13 22:24:15,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:15,184 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 461 transitions. [2025-04-13 22:24:15,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:15,185 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 461 transitions. [2025-04-13 22:24:15,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:15,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:15,185 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:15,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Ended with exit code 0 [2025-04-13 22:24:15,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,149 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:15,385 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:15,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 950484070, now seen corresponding path program 143 times [2025-04-13 22:24:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:15,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851056114] [2025-04-13 22:24:15,386 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:15,393 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:15,400 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:15,400 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:24:15,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:15,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851056114] [2025-04-13 22:24:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851056114] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:15,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093807149] [2025-04-13 22:24:15,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:15,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:15,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:15,622 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:15,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2025-04-13 22:24:15,863 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:15,909 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:15,909 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:24:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:15,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:24:15,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:15,994 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 73 treesize of output 37 [2025-04-13 22:24:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:16,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:16,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:16,068 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 89 treesize of output 49 [2025-04-13 22:24:16,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:16,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093807149] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:16,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:16,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-04-13 22:24:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427899283] [2025-04-13 22:24:16,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:16,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:24:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:16,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:24:16,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:24:16,119 INFO L87 Difference]: Start difference. First operand 197 states and 461 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:17,246 INFO L93 Difference]: Finished difference Result 235 states and 529 transitions. [2025-04-13 22:24:17,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:24:17,246 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:17,246 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:17,247 INFO L225 Difference]: With dead ends: 235 [2025-04-13 22:24:17,247 INFO L226 Difference]: Without dead ends: 222 [2025-04-13 22:24:17,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:17,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:17,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:24:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-04-13 22:24:17,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 197. [2025-04-13 22:24:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 2.3418367346938775) internal successors, (459), 196 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 459 transitions. [2025-04-13 22:24:17,735 INFO L79 Accepts]: Start accepts. Automaton has 197 states and 459 transitions. Word has length 21 [2025-04-13 22:24:17,735 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:17,735 INFO L485 AbstractCegarLoop]: Abstraction has 197 states and 459 transitions. [2025-04-13 22:24:17,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:17,735 INFO L278 IsEmpty]: Start isEmpty. Operand 197 states and 459 transitions. [2025-04-13 22:24:17,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:17,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:17,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:17,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Ended with exit code 0 [2025-04-13 22:24:17,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 150 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2025-04-13 22:24:17,936 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:17,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 940415153, now seen corresponding path program 144 times [2025-04-13 22:24:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:17,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604594656] [2025-04-13 22:24:17,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:17,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:17,944 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:24:17,956 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:17,956 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:17,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:18,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604594656] [2025-04-13 22:24:18,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604594656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:18,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668660516] [2025-04-13 22:24:18,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:18,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:18,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:18,132 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:18,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2025-04-13 22:24:18,372 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:24:18,392 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:18,392 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:18,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:24:18,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:18,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:18,589 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:18,589 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 53 treesize of output 29 [2025-04-13 22:24:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668660516] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:18,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2025-04-13 22:24:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863060826] [2025-04-13 22:24:18,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:18,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:24:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:18,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:24:18,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:24:18,631 INFO L87 Difference]: Start difference. First operand 197 states and 459 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:20,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:20,267 INFO L93 Difference]: Finished difference Result 280 states and 606 transitions. [2025-04-13 22:24:20,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:24:20,267 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:20,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:20,268 INFO L225 Difference]: With dead ends: 280 [2025-04-13 22:24:20,268 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 22:24:20,268 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:24:20,269 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:20,269 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 22:24:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 199. [2025-04-13 22:24:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.3434343434343434) internal successors, (464), 198 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 464 transitions. [2025-04-13 22:24:20,757 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 464 transitions. Word has length 21 [2025-04-13 22:24:20,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:20,757 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 464 transitions. [2025-04-13 22:24:20,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:20,757 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 464 transitions. [2025-04-13 22:24:20,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:20,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:20,757 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:20,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Ended with exit code 0 [2025-04-13 22:24:20,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 151 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2025-04-13 22:24:20,958 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:20,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1636208437, now seen corresponding path program 145 times [2025-04-13 22:24:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:20,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674090501] [2025-04-13 22:24:20,958 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:20,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:24:20,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:20,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:20,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:21,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:21,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674090501] [2025-04-13 22:24:21,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674090501] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:21,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810329291] [2025-04-13 22:24:21,242 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:21,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:21,244 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:21,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2025-04-13 22:24:21,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:24:21,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:21,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:21,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:21,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 22:24:21,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:21,625 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 107 treesize of output 59 [2025-04-13 22:24:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:21,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:21,735 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:21,735 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 53 treesize of output 29 [2025-04-13 22:24:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810329291] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:21,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:21,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2025-04-13 22:24:21,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561464123] [2025-04-13 22:24:21,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:21,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:24:21,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:21,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:24:21,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:24:21,794 INFO L87 Difference]: Start difference. First operand 199 states and 464 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:24,061 INFO L93 Difference]: Finished difference Result 287 states and 614 transitions. [2025-04-13 22:24:24,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:24:24,061 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:24,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:24,062 INFO L225 Difference]: With dead ends: 287 [2025-04-13 22:24:24,062 INFO L226 Difference]: Without dead ends: 276 [2025-04-13 22:24:24,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=2639, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:24:24,063 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:24,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-13 22:24:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 201. [2025-04-13 22:24:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.355) internal successors, (471), 200 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 471 transitions. [2025-04-13 22:24:24,553 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 471 transitions. Word has length 21 [2025-04-13 22:24:24,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:24,553 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 471 transitions. [2025-04-13 22:24:24,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:24,553 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 471 transitions. [2025-04-13 22:24:24,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:24,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:24,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:24,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Ended with exit code 0 [2025-04-13 22:24:24,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 22:24:24,754 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:24,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1611273370, now seen corresponding path program 146 times [2025-04-13 22:24:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:24,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825844227] [2025-04-13 22:24:24,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:24,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:24,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:24,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:24,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:25,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:25,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825844227] [2025-04-13 22:24:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825844227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:25,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611990488] [2025-04-13 22:24:25,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:25,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:25,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:25,045 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:25,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-04-13 22:24:25,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:25,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:25,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:25,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:24:25,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:25,448 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 91 treesize of output 59 [2025-04-13 22:24:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:25,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:25,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:25,552 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 89 treesize of output 49 [2025-04-13 22:24:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611990488] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:25,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 27 [2025-04-13 22:24:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891548478] [2025-04-13 22:24:25,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:25,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:24:25,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:25,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:24:25,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:25,614 INFO L87 Difference]: Start difference. First operand 201 states and 471 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:27,890 INFO L93 Difference]: Finished difference Result 297 states and 632 transitions. [2025-04-13 22:24:27,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:24:27,890 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:27,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:27,891 INFO L225 Difference]: With dead ends: 297 [2025-04-13 22:24:27,891 INFO L226 Difference]: Without dead ends: 288 [2025-04-13 22:24:27,891 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=478, Invalid=2714, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:24:27,891 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:27,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-04-13 22:24:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 201. [2025-04-13 22:24:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 2.345) internal successors, (469), 200 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 469 transitions. [2025-04-13 22:24:28,387 INFO L79 Accepts]: Start accepts. Automaton has 201 states and 469 transitions. Word has length 21 [2025-04-13 22:24:28,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:28,387 INFO L485 AbstractCegarLoop]: Abstraction has 201 states and 469 transitions. [2025-04-13 22:24:28,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:28,387 INFO L278 IsEmpty]: Start isEmpty. Operand 201 states and 469 transitions. [2025-04-13 22:24:28,387 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:28,387 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:28,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:28,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Ended with exit code 0 [2025-04-13 22:24:28,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 153 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2025-04-13 22:24:28,588 INFO L403 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:28,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1722095890, now seen corresponding path program 147 times [2025-04-13 22:24:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:28,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131009190] [2025-04-13 22:24:28,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:28,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:24:28,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:28,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:28,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:28,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131009190] [2025-04-13 22:24:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131009190] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:28,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201572352] [2025-04-13 22:24:28,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:28,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:28,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:28,983 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:28,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2025-04-13 22:24:29,228 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:24:29,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:29,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:29,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:29,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:29,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:29,359 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 91 treesize of output 59 [2025-04-13 22:24:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:29,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:29,444 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:29,445 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 89 treesize of output 49 [2025-04-13 22:24:29,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201572352] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:29,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:29,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 25 [2025-04-13 22:24:29,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416037472] [2025-04-13 22:24:29,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:29,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:24:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:29,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:24:29,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:24:29,498 INFO L87 Difference]: Start difference. First operand 201 states and 469 transitions. Second operand has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:31,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:31,294 INFO L93 Difference]: Finished difference Result 283 states and 602 transitions. [2025-04-13 22:24:31,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:24:31,295 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:31,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:31,296 INFO L225 Difference]: With dead ends: 283 [2025-04-13 22:24:31,296 INFO L226 Difference]: Without dead ends: 276 [2025-04-13 22:24:31,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=1424, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:24:31,296 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:31,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-13 22:24:31,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 195. [2025-04-13 22:24:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 2.3402061855670104) internal successors, (454), 194 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 454 transitions. [2025-04-13 22:24:31,776 INFO L79 Accepts]: Start accepts. Automaton has 195 states and 454 transitions. Word has length 21 [2025-04-13 22:24:31,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:31,776 INFO L485 AbstractCegarLoop]: Abstraction has 195 states and 454 transitions. [2025-04-13 22:24:31,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.72) internal successors, (43), 25 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:31,776 INFO L278 IsEmpty]: Start isEmpty. Operand 195 states and 454 transitions. [2025-04-13 22:24:31,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:31,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:31,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:31,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Ended with exit code 0 [2025-04-13 22:24:31,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,154 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:31,977 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:31,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:31,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1831547919, now seen corresponding path program 148 times [2025-04-13 22:24:31,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:31,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391053064] [2025-04-13 22:24:31,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:31,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:31,985 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:31,991 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:31,991 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:31,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:32,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391053064] [2025-04-13 22:24:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391053064] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:32,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677484739] [2025-04-13 22:24:32,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:32,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:32,272 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:32,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2025-04-13 22:24:32,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:32,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:32,543 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:32,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:32,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:24:32,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:32,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:32,725 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:32,725 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 51 treesize of output 27 [2025-04-13 22:24:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677484739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:32,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:32,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2025-04-13 22:24:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004998494] [2025-04-13 22:24:32,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:32,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:24:32,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:32,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:24:32,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:24:32,806 INFO L87 Difference]: Start difference. First operand 195 states and 454 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:24:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:35,040 INFO L93 Difference]: Finished difference Result 305 states and 645 transitions. [2025-04-13 22:24:35,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:24:35,040 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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) Word has length 21 [2025-04-13 22:24:35,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:35,041 INFO L225 Difference]: With dead ends: 305 [2025-04-13 22:24:35,041 INFO L226 Difference]: Without dead ends: 297 [2025-04-13 22:24:35,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=2308, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:24:35,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:35,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-13 22:24:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 193. [2025-04-13 22:24:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.3385416666666665) internal successors, (449), 192 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 449 transitions. [2025-04-13 22:24:35,540 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 449 transitions. Word has length 21 [2025-04-13 22:24:35,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:35,540 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 449 transitions. [2025-04-13 22:24:35,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:24:35,540 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 449 transitions. [2025-04-13 22:24:35,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:35,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:35,540 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:35,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Ended with exit code 0 [2025-04-13 22:24:35,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,155 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:35,741 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:35,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash -113204213, now seen corresponding path program 149 times [2025-04-13 22:24:35,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:35,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039583749] [2025-04-13 22:24:35,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:35,749 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:24:35,756 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:35,757 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:35,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:35,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:35,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039583749] [2025-04-13 22:24:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039583749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:35,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717743080] [2025-04-13 22:24:35,918 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:35,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:35,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:35,919 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:35,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2025-04-13 22:24:36,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:24:36,188 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:36,188 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:36,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:36,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:36,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:36,279 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 132 treesize of output 72 [2025-04-13 22:24:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:36,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:36,360 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:36,361 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 51 treesize of output 27 [2025-04-13 22:24:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:36,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717743080] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:36,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 22 [2025-04-13 22:24:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231709048] [2025-04-13 22:24:36,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:36,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:24:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:36,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:24:36,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:24:36,425 INFO L87 Difference]: Start difference. First operand 193 states and 449 transitions. Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:40,114 INFO L93 Difference]: Finished difference Result 387 states and 793 transitions. [2025-04-13 22:24:40,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 22:24:40,114 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:40,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:40,115 INFO L225 Difference]: With dead ends: 387 [2025-04-13 22:24:40,115 INFO L226 Difference]: Without dead ends: 376 [2025-04-13 22:24:40,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=768, Invalid=4202, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 22:24:40,115 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:40,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-04-13 22:24:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 189. [2025-04-13 22:24:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.3138297872340425) internal successors, (435), 188 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 435 transitions. [2025-04-13 22:24:40,585 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 435 transitions. Word has length 21 [2025-04-13 22:24:40,585 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:40,585 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 435 transitions. [2025-04-13 22:24:40,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:40,585 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 435 transitions. [2025-04-13 22:24:40,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:40,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:40,586 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:40,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Forceful destruction successful, exit code 0 [2025-04-13 22:24:40,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,156 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:40,786 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:40,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash -88269146, now seen corresponding path program 150 times [2025-04-13 22:24:40,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:40,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311364162] [2025-04-13 22:24:40,786 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:40,794 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:40,804 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:40,804 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:24:40,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:41,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311364162] [2025-04-13 22:24:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311364162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:41,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49251753] [2025-04-13 22:24:41,124 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:41,126 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:41,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2025-04-13 22:24:41,378 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:41,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:41,398 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:24:41,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:41,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:24:41,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:41,488 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 91 treesize of output 59 [2025-04-13 22:24:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:41,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:41,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:41,580 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 61 [2025-04-13 22:24:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49251753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:41,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 27 [2025-04-13 22:24:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316408136] [2025-04-13 22:24:41,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:41,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:24:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:41,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:24:41,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:41,649 INFO L87 Difference]: Start difference. First operand 189 states and 435 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:44,412 INFO L93 Difference]: Finished difference Result 354 states and 693 transitions. [2025-04-13 22:24:44,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:24:44,412 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:44,412 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:44,413 INFO L225 Difference]: With dead ends: 354 [2025-04-13 22:24:44,413 INFO L226 Difference]: Without dead ends: 345 [2025-04-13 22:24:44,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 817 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=3044, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:24:44,414 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:44,414 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-04-13 22:24:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 189. [2025-04-13 22:24:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.3031914893617023) internal successors, (433), 188 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 433 transitions. [2025-04-13 22:24:44,886 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 433 transitions. Word has length 21 [2025-04-13 22:24:44,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:44,886 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 433 transitions. [2025-04-13 22:24:44,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:44,886 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 433 transitions. [2025-04-13 22:24:44,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:44,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:44,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:44,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Forceful destruction successful, exit code 0 [2025-04-13 22:24:45,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,157 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:45,087 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:45,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash -199091666, now seen corresponding path program 151 times [2025-04-13 22:24:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:45,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207705629] [2025-04-13 22:24:45,087 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:45,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:45,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:24:45,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:45,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:45,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:45,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207705629] [2025-04-13 22:24:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207705629] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:45,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532971341] [2025-04-13 22:24:45,416 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:45,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:45,418 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:45,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2025-04-13 22:24:45,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:24:45,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:45,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:45,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:45,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:24:45,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:45,760 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 107 treesize of output 59 [2025-04-13 22:24:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:45,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:45,826 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:45,826 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 87 treesize of output 47 [2025-04-13 22:24:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:45,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532971341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:45,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:45,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2025-04-13 22:24:45,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554793189] [2025-04-13 22:24:45,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:45,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:24:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:45,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:24:45,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:24:45,895 INFO L87 Difference]: Start difference. First operand 189 states and 433 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:47,739 INFO L93 Difference]: Finished difference Result 283 states and 593 transitions. [2025-04-13 22:24:47,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:24:47,739 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:47,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:47,740 INFO L225 Difference]: With dead ends: 283 [2025-04-13 22:24:47,740 INFO L226 Difference]: Without dead ends: 276 [2025-04-13 22:24:47,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:24:47,740 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:47,740 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-13 22:24:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 185. [2025-04-13 22:24:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.2989130434782608) internal successors, (423), 184 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 423 transitions. [2025-04-13 22:24:48,217 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 423 transitions. Word has length 21 [2025-04-13 22:24:48,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:48,217 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 423 transitions. [2025-04-13 22:24:48,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:48,217 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 423 transitions. [2025-04-13 22:24:48,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:48,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:48,218 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:48,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Ended with exit code 0 [2025-04-13 22:24:48,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable163 [2025-04-13 22:24:48,418 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:48,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1615843121, now seen corresponding path program 152 times [2025-04-13 22:24:48,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:48,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816741580] [2025-04-13 22:24:48,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:48,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:48,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:48,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:48,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:48,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816741580] [2025-04-13 22:24:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816741580] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:48,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081432558] [2025-04-13 22:24:48,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:48,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:48,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:48,696 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:48,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2025-04-13 22:24:48,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:48,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:48,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:48,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:48,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:24:48,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:49,037 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 91 treesize of output 59 [2025-04-13 22:24:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:49,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:49,108 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:49,108 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 87 treesize of output 47 [2025-04-13 22:24:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:49,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081432558] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:49,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:49,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 22 [2025-04-13 22:24:49,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900739755] [2025-04-13 22:24:49,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:49,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:24:49,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:49,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:24:49,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:24:49,173 INFO L87 Difference]: Start difference. First operand 185 states and 423 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:50,961 INFO L93 Difference]: Finished difference Result 282 states and 581 transitions. [2025-04-13 22:24:50,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:24:50,961 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:50,961 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:50,962 INFO L225 Difference]: With dead ends: 282 [2025-04-13 22:24:50,962 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 22:24:50,962 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:24:50,963 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:50,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 22:24:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 183. [2025-04-13 22:24:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.2857142857142856) internal successors, (416), 182 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 416 transitions. [2025-04-13 22:24:51,427 INFO L79 Accepts]: Start accepts. Automaton has 183 states and 416 transitions. Word has length 21 [2025-04-13 22:24:51,427 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:51,427 INFO L485 AbstractCegarLoop]: Abstraction has 183 states and 416 transitions. [2025-04-13 22:24:51,427 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:51,427 INFO L278 IsEmpty]: Start isEmpty. Operand 183 states and 416 transitions. [2025-04-13 22:24:51,428 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:51,428 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:51,428 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:51,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Ended with exit code 0 [2025-04-13 22:24:51,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,159 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:51,628 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:51,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1640778188, now seen corresponding path program 153 times [2025-04-13 22:24:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:51,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136797822] [2025-04-13 22:24:51,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:51,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:51,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:51,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:24:51,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:51,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136797822] [2025-04-13 22:24:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136797822] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:51,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516318453] [2025-04-13 22:24:51,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:51,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:51,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:51,821 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:51,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2025-04-13 22:24:52,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:52,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:52,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:24:52,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:52,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:24:52,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:52,197 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 91 treesize of output 59 [2025-04-13 22:24:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:52,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:52,273 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:52,274 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 51 treesize of output 27 [2025-04-13 22:24:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:52,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516318453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:52,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:52,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 25 [2025-04-13 22:24:52,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296934990] [2025-04-13 22:24:52,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:52,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:24:52,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:52,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:24:52,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:24:52,336 INFO L87 Difference]: Start difference. First operand 183 states and 416 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:54,233 INFO L93 Difference]: Finished difference Result 281 states and 575 transitions. [2025-04-13 22:24:54,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:24:54,234 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:24:54,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:54,235 INFO L225 Difference]: With dead ends: 281 [2025-04-13 22:24:54,235 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 22:24:54,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:24:54,235 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:54,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:54,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 22:24:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 183. [2025-04-13 22:24:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 2.2747252747252746) internal successors, (414), 182 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 414 transitions. [2025-04-13 22:24:54,703 INFO L79 Accepts]: Start accepts. Automaton has 183 states and 414 transitions. Word has length 21 [2025-04-13 22:24:54,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:54,703 INFO L485 AbstractCegarLoop]: Abstraction has 183 states and 414 transitions. [2025-04-13 22:24:54,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:54,703 INFO L278 IsEmpty]: Start isEmpty. Operand 183 states and 414 transitions. [2025-04-13 22:24:54,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:54,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:54,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:54,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2025-04-13 22:24:54,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,160 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:54,904 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:54,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1529955668, now seen corresponding path program 154 times [2025-04-13 22:24:54,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:54,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72151186] [2025-04-13 22:24:54,904 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:54,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:54,912 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:54,919 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:54,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:54,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:55,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72151186] [2025-04-13 22:24:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72151186] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:55,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798025094] [2025-04-13 22:24:55,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:55,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:55,180 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:55,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2025-04-13 22:24:55,436 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:24:55,454 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:55,455 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:55,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:55,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:24:55,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:55,564 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 132 treesize of output 72 [2025-04-13 22:24:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:24:55,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:55,648 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:55,649 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 51 treesize of output 27 [2025-04-13 22:24:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798025094] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:55,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:55,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 27 [2025-04-13 22:24:55,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663007611] [2025-04-13 22:24:55,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:55,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:24:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:55,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:24:55,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:24:55,726 INFO L87 Difference]: Start difference. First operand 183 states and 414 transitions. Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 22:24:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:57,943 INFO L93 Difference]: Finished difference Result 285 states and 579 transitions. [2025-04-13 22:24:57,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:24:57,944 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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) Word has length 21 [2025-04-13 22:24:57,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:57,945 INFO L225 Difference]: With dead ends: 285 [2025-04-13 22:24:57,945 INFO L226 Difference]: Without dead ends: 278 [2025-04-13 22:24:57,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=2214, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:24:57,945 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:57,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-13 22:24:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 181. [2025-04-13 22:24:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.261111111111111) internal successors, (407), 180 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:24:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 407 transitions. [2025-04-13 22:24:58,398 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 407 transitions. Word has length 21 [2025-04-13 22:24:58,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:58,398 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 407 transitions. [2025-04-13 22:24:58,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 27 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-13 22:24:58,398 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 407 transitions. [2025-04-13 22:24:58,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:24:58,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:58,399 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:24:58,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Ended with exit code 0 [2025-04-13 22:24:58,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2025-04-13 22:24:58,599 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:58,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1557750671, now seen corresponding path program 155 times [2025-04-13 22:24:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:58,600 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376229472] [2025-04-13 22:24:58,600 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:58,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:58,615 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:58,615 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:24:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:24:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:58,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376229472] [2025-04-13 22:24:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376229472] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:58,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054990461] [2025-04-13 22:24:58,803 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:58,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:58,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:58,805 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:24:58,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2025-04-13 22:24:59,062 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:24:59,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:24:59,097 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:24:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:59,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 22:24:59,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:59,172 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 107 treesize of output 59 [2025-04-13 22:24:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:59,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:59,242 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:59,242 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 61 [2025-04-13 22:24:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:24:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054990461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:59,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2025-04-13 22:24:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353106999] [2025-04-13 22:24:59,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:59,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:24:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:59,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:24:59,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:24:59,321 INFO L87 Difference]: Start difference. First operand 181 states and 407 transitions. Second operand has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:01,533 INFO L93 Difference]: Finished difference Result 284 states and 570 transitions. [2025-04-13 22:25:01,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:25:01,533 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:25:01,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:01,534 INFO L225 Difference]: With dead ends: 284 [2025-04-13 22:25:01,534 INFO L226 Difference]: Without dead ends: 270 [2025-04-13 22:25:01,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=2016, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:25:01,534 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:01,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:01,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-13 22:25:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 179. [2025-04-13 22:25:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.235955056179775) internal successors, (398), 178 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 398 transitions. [2025-04-13 22:25:01,997 INFO L79 Accepts]: Start accepts. Automaton has 179 states and 398 transitions. Word has length 21 [2025-04-13 22:25:01,997 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:01,997 INFO L485 AbstractCegarLoop]: Abstraction has 179 states and 398 transitions. [2025-04-13 22:25:01,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:01,997 INFO L278 IsEmpty]: Start isEmpty. Operand 179 states and 398 transitions. [2025-04-13 22:25:01,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:01,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:01,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:02,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Ended with exit code 0 [2025-04-13 22:25:02,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 162 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable167 [2025-04-13 22:25:02,198 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:02,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1046667922, now seen corresponding path program 156 times [2025-04-13 22:25:02,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:02,198 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86342649] [2025-04-13 22:25:02,198 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:02,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:02,206 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:25:02,217 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:02,217 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:25:02,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:02,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:02,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86342649] [2025-04-13 22:25:02,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86342649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:02,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121308832] [2025-04-13 22:25:02,384 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:02,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:02,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:02,386 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:02,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2025-04-13 22:25:02,647 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:25:02,669 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:02,669 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:25:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:02,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:25:02,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:02,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:02,837 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:02,838 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 51 treesize of output 27 [2025-04-13 22:25:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121308832] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:02,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2025-04-13 22:25:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542436293] [2025-04-13 22:25:02,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:02,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:25:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:02,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:25:02,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:25:02,893 INFO L87 Difference]: Start difference. First operand 179 states and 398 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:04,485 INFO L93 Difference]: Finished difference Result 254 states and 527 transitions. [2025-04-13 22:25:04,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:25:04,485 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:25:04,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:04,486 INFO L225 Difference]: With dead ends: 254 [2025-04-13 22:25:04,486 INFO L226 Difference]: Without dead ends: 247 [2025-04-13 22:25:04,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:25:04,487 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:04,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-04-13 22:25:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 177. [2025-04-13 22:25:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 2.221590909090909) internal successors, (391), 176 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 391 transitions. [2025-04-13 22:25:04,935 INFO L79 Accepts]: Start accepts. Automaton has 177 states and 391 transitions. Word has length 21 [2025-04-13 22:25:04,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:04,935 INFO L485 AbstractCegarLoop]: Abstraction has 177 states and 391 transitions. [2025-04-13 22:25:04,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:04,935 INFO L278 IsEmpty]: Start isEmpty. Operand 177 states and 391 transitions. [2025-04-13 22:25:04,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:04,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:04,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:04,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Ended with exit code 0 [2025-04-13 22:25:05,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 163 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2025-04-13 22:25:05,136 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:05,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash -620945563, now seen corresponding path program 157 times [2025-04-13 22:25:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:05,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143019627] [2025-04-13 22:25:05,136 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:05,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:25:05,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:05,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:05,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:25:05,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:05,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143019627] [2025-04-13 22:25:05,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143019627] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:05,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765199536] [2025-04-13 22:25:05,417 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:05,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:05,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:05,419 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:05,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2025-04-13 22:25:05,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:25:05,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:05,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:05,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:05,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:25:05,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:05,800 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 132 treesize of output 72 [2025-04-13 22:25:05,820 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:05,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:05,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:05,890 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 89 treesize of output 49 [2025-04-13 22:25:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:05,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765199536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:05,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:05,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-04-13 22:25:05,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018424094] [2025-04-13 22:25:05,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:05,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:25:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:05,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:25:05,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:25:05,946 INFO L87 Difference]: Start difference. First operand 177 states and 391 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:07,487 INFO L93 Difference]: Finished difference Result 239 states and 487 transitions. [2025-04-13 22:25:07,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:25:07,487 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:25:07,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:07,488 INFO L225 Difference]: With dead ends: 239 [2025-04-13 22:25:07,488 INFO L226 Difference]: Without dead ends: 231 [2025-04-13 22:25:07,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:25:07,488 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:07,488 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-04-13 22:25:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 175. [2025-04-13 22:25:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 174 states have (on average 2.206896551724138) internal successors, (384), 174 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 384 transitions. [2025-04-13 22:25:07,942 INFO L79 Accepts]: Start accepts. Automaton has 175 states and 384 transitions. Word has length 21 [2025-04-13 22:25:07,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:07,942 INFO L485 AbstractCegarLoop]: Abstraction has 175 states and 384 transitions. [2025-04-13 22:25:07,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:07,942 INFO L278 IsEmpty]: Start isEmpty. Operand 175 states and 384 transitions. [2025-04-13 22:25:07,942 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:07,942 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:07,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:07,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Ended with exit code 0 [2025-04-13 22:25:08,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2025-04-13 22:25:08,143 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:08,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash -706833016, now seen corresponding path program 158 times [2025-04-13 22:25:08,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:08,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444684244] [2025-04-13 22:25:08,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:08,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:08,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:25:08,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:08,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:08,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:08,425 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:25:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:08,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444684244] [2025-04-13 22:25:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444684244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:08,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471044083] [2025-04-13 22:25:08,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:08,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:08,427 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:08,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-04-13 22:25:08,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:25:08,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:08,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:08,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:08,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:25:08,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:08,880 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 91 treesize of output 59 [2025-04-13 22:25:08,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:25:08,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:08,994 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:08,994 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 53 treesize of output 29 [2025-04-13 22:25:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471044083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:09,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 26 [2025-04-13 22:25:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891096141] [2025-04-13 22:25:09,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:09,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:25:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:09,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:25:09,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:25:09,052 INFO L87 Difference]: Start difference. First operand 175 states and 384 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:25:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:11,091 INFO L93 Difference]: Finished difference Result 246 states and 496 transitions. [2025-04-13 22:25:11,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:25:11,091 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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) Word has length 21 [2025-04-13 22:25:11,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:11,092 INFO L225 Difference]: With dead ends: 246 [2025-04-13 22:25:11,092 INFO L226 Difference]: Without dead ends: 241 [2025-04-13 22:25:11,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:25:11,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:11,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-13 22:25:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 173. [2025-04-13 22:25:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.203488372093023) internal successors, (379), 172 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:11,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 379 transitions. [2025-04-13 22:25:11,538 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 379 transitions. Word has length 21 [2025-04-13 22:25:11,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:11,538 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 379 transitions. [2025-04-13 22:25:11,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 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-13 22:25:11,539 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 379 transitions. [2025-04-13 22:25:11,539 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:11,539 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:11,539 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:11,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Ended with exit code 0 [2025-04-13 22:25:11,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable170 [2025-04-13 22:25:11,740 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:11,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:11,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1011510690, now seen corresponding path program 159 times [2025-04-13 22:25:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:11,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172034561] [2025-04-13 22:25:11,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:11,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:25:11,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:11,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:25:11,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:12,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172034561] [2025-04-13 22:25:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172034561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:12,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673059181] [2025-04-13 22:25:12,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:12,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:12,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:12,100 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:12,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2025-04-13 22:25:12,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:25:12,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:12,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:25:12,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:12,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:25:12,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:12,441 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-13 22:25:12,449 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 19 treesize of output 1 [2025-04-13 22:25:12,568 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:12,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673059181] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:12,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 27 [2025-04-13 22:25:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794831780] [2025-04-13 22:25:12,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:12,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:25:12,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:12,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:25:12,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:25:12,702 INFO L87 Difference]: Start difference. First operand 173 states and 379 transitions. Second operand has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:14,270 INFO L93 Difference]: Finished difference Result 232 states and 478 transitions. [2025-04-13 22:25:14,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:25:14,270 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:25:14,270 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:14,271 INFO L225 Difference]: With dead ends: 232 [2025-04-13 22:25:14,271 INFO L226 Difference]: Without dead ends: 227 [2025-04-13 22:25:14,271 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:25:14,272 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:14,272 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:25:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-13 22:25:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 173. [2025-04-13 22:25:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.203488372093023) internal successors, (379), 172 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 379 transitions. [2025-04-13 22:25:14,714 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 379 transitions. Word has length 21 [2025-04-13 22:25:14,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:14,714 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 379 transitions. [2025-04-13 22:25:14,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:14,714 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 379 transitions. [2025-04-13 22:25:14,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:14,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:14,715 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:14,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Ended with exit code 0 [2025-04-13 22:25:14,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable171 [2025-04-13 22:25:14,915 INFO L403 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:14,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1900861413, now seen corresponding path program 160 times [2025-04-13 22:25:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:14,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155969227] [2025-04-13 22:25:14,916 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:14,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:25:14,939 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:14,940 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:14,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:15,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155969227] [2025-04-13 22:25:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155969227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:15,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373521665] [2025-04-13 22:25:15,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:15,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:15,279 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:15,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2025-04-13 22:25:15,548 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 22:25:15,565 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:15,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:15,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:25:15,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:15,673 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 98 treesize of output 50 [2025-04-13 22:25:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:25:15,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:15,764 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:15,764 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 119 treesize of output 63 [2025-04-13 22:25:15,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:15,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373521665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:15,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:15,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 29 [2025-04-13 22:25:15,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228488887] [2025-04-13 22:25:15,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:15,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:25:15,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:15,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:25:15,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:25:15,822 INFO L87 Difference]: Start difference. First operand 173 states and 379 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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-13 22:25:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:17,288 INFO L93 Difference]: Finished difference Result 216 states and 448 transitions. [2025-04-13 22:25:17,288 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:25:17,288 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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) Word has length 21 [2025-04-13 22:25:17,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:17,289 INFO L225 Difference]: With dead ends: 216 [2025-04-13 22:25:17,289 INFO L226 Difference]: Without dead ends: 202 [2025-04-13 22:25:17,289 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1430, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:25:17,290 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:17,290 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-13 22:25:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 171. [2025-04-13 22:25:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.1882352941176473) internal successors, (372), 170 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 372 transitions. [2025-04-13 22:25:17,732 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 372 transitions. Word has length 21 [2025-04-13 22:25:17,732 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:17,732 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 372 transitions. [2025-04-13 22:25:17,732 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 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-13 22:25:17,732 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 372 transitions. [2025-04-13 22:25:17,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:17,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:17,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:17,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Ended with exit code 0 [2025-04-13 22:25:17,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable172 [2025-04-13 22:25:17,933 INFO L403 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:17,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:17,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1554409272, now seen corresponding path program 161 times [2025-04-13 22:25:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:17,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284097401] [2025-04-13 22:25:17,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:17,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:17,941 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:25:17,948 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:17,948 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:17,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:25:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:18,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284097401] [2025-04-13 22:25:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284097401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:18,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471873134] [2025-04-13 22:25:18,132 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:18,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:18,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:18,134 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:18,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2025-04-13 22:25:18,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-04-13 22:25:18,429 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:18,429 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:18,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:18,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:25:18,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:25:18,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:18,603 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:18,603 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 53 treesize of output 29 [2025-04-13 22:25:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471873134] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:18,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 22 [2025-04-13 22:25:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927663422] [2025-04-13 22:25:18,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:18,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:25:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:18,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:25:18,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:25:18,650 INFO L87 Difference]: Start difference. First operand 171 states and 372 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:19,955 INFO L93 Difference]: Finished difference Result 211 states and 427 transitions. [2025-04-13 22:25:19,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:25:19,955 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 22:25:19,955 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:19,956 INFO L225 Difference]: With dead ends: 211 [2025-04-13 22:25:19,956 INFO L226 Difference]: Without dead ends: 206 [2025-04-13 22:25:19,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:25:19,956 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:19,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:25:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-04-13 22:25:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 156. [2025-04-13 22:25:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.1870967741935483) internal successors, (339), 155 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 339 transitions. [2025-04-13 22:25:20,324 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 339 transitions. Word has length 21 [2025-04-13 22:25:20,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:20,324 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 339 transitions. [2025-04-13 22:25:20,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:20,324 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 339 transitions. [2025-04-13 22:25:20,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:25:20,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:20,324 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:20,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Ended with exit code 0 [2025-04-13 22:25:20,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,168 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:20,525 INFO L403 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:20,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 190248105, now seen corresponding path program 162 times [2025-04-13 22:25:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:20,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138938671] [2025-04-13 22:25:20,525 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:20,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:25:20,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:20,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:25:20,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:25:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:20,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138938671] [2025-04-13 22:25:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138938671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:20,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672212441] [2025-04-13 22:25:20,883 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:20,884 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:20,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2025-04-13 22:25:21,177 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 3 equivalence classes. [2025-04-13 22:25:21,196 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:25:21,196 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:25:21,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:21,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:25:21,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:21,279 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 82 treesize of output 50 [2025-04-13 22:25:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:21,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:21,356 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:21,356 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 89 treesize of output 49 [2025-04-13 22:25:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672212441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:21,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 24 [2025-04-13 22:25:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302175162] [2025-04-13 22:25:21,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:21,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:25:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:21,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:25:21,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:25:21,405 INFO L87 Difference]: Start difference. First operand 156 states and 339 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-13 22:25:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:22,422 INFO L93 Difference]: Finished difference Result 178 states and 373 transitions. [2025-04-13 22:25:22,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:25:22,422 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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) Word has length 21 [2025-04-13 22:25:22,422 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:22,423 INFO L225 Difference]: With dead ends: 178 [2025-04-13 22:25:22,423 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 22:25:22,424 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:25:22,424 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:22,424 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:25:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 22:25:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-04-13 22:25:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.1699346405228757) internal successors, (332), 153 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 332 transitions. [2025-04-13 22:25:22,786 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 332 transitions. Word has length 21 [2025-04-13 22:25:22,786 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:22,786 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 332 transitions. [2025-04-13 22:25:22,786 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 24 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-13 22:25:22,786 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 332 transitions. [2025-04-13 22:25:22,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:22,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:22,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:22,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Forceful destruction successful, exit code 0 [2025-04-13 22:25:22,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174,169 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:22,987 INFO L403 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:22,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1223865532, now seen corresponding path program 163 times [2025-04-13 22:25:22,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:22,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785594323] [2025-04-13 22:25:22,987 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:22,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:22,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:25:23,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:23,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:23,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:23,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785594323] [2025-04-13 22:25:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785594323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:23,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954520175] [2025-04-13 22:25:23,781 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:23,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:23,783 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:23,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2025-04-13 22:25:24,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:25:24,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:24,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:24,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:24,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:25:24,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:24,440 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 162 treesize of output 96 [2025-04-13 22:25:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:24,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:25,265 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:25,266 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 297 treesize of output 189 [2025-04-13 22:25:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954520175] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2025-04-13 22:25:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236260009] [2025-04-13 22:25:25,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:25,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:25:25,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:25,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:25:25,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:25:25,450 INFO L87 Difference]: Start difference. First operand 154 states and 332 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:25:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:27,731 INFO L93 Difference]: Finished difference Result 184 states and 372 transitions. [2025-04-13 22:25:27,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:25:27,731 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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) Word has length 22 [2025-04-13 22:25:27,731 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:27,732 INFO L225 Difference]: With dead ends: 184 [2025-04-13 22:25:27,732 INFO L226 Difference]: Without dead ends: 162 [2025-04-13 22:25:27,732 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=340, Invalid=2522, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:25:27,732 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:27,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:25:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-13 22:25:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2025-04-13 22:25:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.168918918918919) internal successors, (321), 148 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 321 transitions. [2025-04-13 22:25:28,099 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 321 transitions. Word has length 22 [2025-04-13 22:25:28,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:28,099 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 321 transitions. [2025-04-13 22:25:28,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:25:28,099 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 321 transitions. [2025-04-13 22:25:28,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:28,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:28,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:28,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Ended with exit code 0 [2025-04-13 22:25:28,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175,170 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:28,299 INFO L403 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:28,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash -519917428, now seen corresponding path program 164 times [2025-04-13 22:25:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:28,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223405654] [2025-04-13 22:25:28,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:28,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:25:28,322 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:28,322 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:28,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:29,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223405654] [2025-04-13 22:25:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223405654] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:29,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109726248] [2025-04-13 22:25:29,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:29,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:29,021 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:29,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2025-04-13 22:25:29,294 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:25:29,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:29,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:29,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:29,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:25:29,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:29,671 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 161 treesize of output 105 [2025-04-13 22:25:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:29,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:30,869 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:30,869 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 287 treesize of output 191 [2025-04-13 22:25:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109726248] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:31,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:31,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2025-04-13 22:25:31,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789360337] [2025-04-13 22:25:31,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:31,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:25:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:31,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:25:31,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:25:31,004 INFO L87 Difference]: Start difference. First operand 149 states and 321 transitions. Second operand has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:25:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:32,528 INFO L93 Difference]: Finished difference Result 181 states and 372 transitions. [2025-04-13 22:25:32,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:25:32,528 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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) Word has length 22 [2025-04-13 22:25:32,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:32,529 INFO L225 Difference]: With dead ends: 181 [2025-04-13 22:25:32,529 INFO L226 Difference]: Without dead ends: 174 [2025-04-13 22:25:32,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:25:32,529 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:32,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:25:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-04-13 22:25:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151. [2025-04-13 22:25:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.1733333333333333) internal successors, (326), 150 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 326 transitions. [2025-04-13 22:25:32,945 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 326 transitions. Word has length 22 [2025-04-13 22:25:32,945 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:32,945 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 326 transitions. [2025-04-13 22:25:32,945 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:25:32,945 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 326 transitions. [2025-04-13 22:25:32,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:32,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:32,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:32,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Ended with exit code 0 [2025-04-13 22:25:33,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176,171 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:33,146 INFO L403 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:33,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1460398256, now seen corresponding path program 165 times [2025-04-13 22:25:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:33,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106237332] [2025-04-13 22:25:33,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:33,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:25:33,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:33,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:25:33,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:33,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106237332] [2025-04-13 22:25:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106237332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:33,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441456194] [2025-04-13 22:25:33,790 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:33,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:33,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:33,791 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:33,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2025-04-13 22:25:34,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:25:34,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:34,088 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:25:34,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:34,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 22:25:34,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:34,122 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 19 treesize of output 1 [2025-04-13 22:25:34,415 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 189 treesize of output 105 [2025-04-13 22:25:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:34,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:35,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441456194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:35,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:35,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 11] total 34 [2025-04-13 22:25:35,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72207138] [2025-04-13 22:25:35,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:35,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:25:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:35,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:25:35,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:25:35,961 INFO L87 Difference]: Start difference. First operand 151 states and 326 transitions. Second operand has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 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-13 22:25:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:37,709 INFO L93 Difference]: Finished difference Result 182 states and 372 transitions. [2025-04-13 22:25:37,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:25:37,710 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 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) Word has length 22 [2025-04-13 22:25:37,710 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:37,711 INFO L225 Difference]: With dead ends: 182 [2025-04-13 22:25:37,711 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 22:25:37,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:25:37,711 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:37,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 22:25:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2025-04-13 22:25:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.168831168831169) internal successors, (334), 154 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 334 transitions. [2025-04-13 22:25:38,175 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 334 transitions. Word has length 22 [2025-04-13 22:25:38,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:38,175 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 334 transitions. [2025-04-13 22:25:38,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 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-13 22:25:38,175 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 334 transitions. [2025-04-13 22:25:38,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:38,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:38,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:38,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Ended with exit code 0 [2025-04-13 22:25:38,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 172 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2025-04-13 22:25:38,376 INFO L403 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:38,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash -578009878, now seen corresponding path program 166 times [2025-04-13 22:25:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:38,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224921979] [2025-04-13 22:25:38,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:38,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:25:38,393 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:38,393 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:38,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:38,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:38,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224921979] [2025-04-13 22:25:38,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224921979] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:38,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911210192] [2025-04-13 22:25:38,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:38,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:38,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:38,975 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:38,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2025-04-13 22:25:39,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:25:39,273 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:39,273 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:39,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:39,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:25:39,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:39,661 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 210 treesize of output 120 [2025-04-13 22:25:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:39,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:40,841 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:40,841 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 352 treesize of output 216 [2025-04-13 22:25:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:40,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911210192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:40,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:40,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-04-13 22:25:40,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875843653] [2025-04-13 22:25:40,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:40,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:25:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:40,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:25:40,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:25:40,997 INFO L87 Difference]: Start difference. First operand 155 states and 334 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:43,380 INFO L93 Difference]: Finished difference Result 196 states and 388 transitions. [2025-04-13 22:25:43,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:25:43,380 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:25:43,380 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:43,381 INFO L225 Difference]: With dead ends: 196 [2025-04-13 22:25:43,381 INFO L226 Difference]: Without dead ends: 183 [2025-04-13 22:25:43,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=1521, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:25:43,382 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:43,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-13 22:25:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2025-04-13 22:25:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.164473684210526) internal successors, (329), 152 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 329 transitions. [2025-04-13 22:25:43,816 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 329 transitions. Word has length 22 [2025-04-13 22:25:43,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:43,816 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 329 transitions. [2025-04-13 22:25:43,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:43,816 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 329 transitions. [2025-04-13 22:25:43,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:43,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:43,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:43,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Forceful destruction successful, exit code 0 [2025-04-13 22:25:44,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178,173 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:44,016 INFO L403 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:44,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1061408720, now seen corresponding path program 167 times [2025-04-13 22:25:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:44,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470688205] [2025-04-13 22:25:44,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:44,026 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:25:44,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:44,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:25:44,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:44,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470688205] [2025-04-13 22:25:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470688205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:44,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876635059] [2025-04-13 22:25:44,607 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:44,608 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:44,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2025-04-13 22:25:44,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:25:44,919 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:44,919 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:25:44,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:44,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:25:44,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:45,266 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 210 treesize of output 120 [2025-04-13 22:25:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:45,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:46,204 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:46,204 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 352 treesize of output 216 [2025-04-13 22:25:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:46,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876635059] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:46,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-04-13 22:25:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015022828] [2025-04-13 22:25:46,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:46,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:25:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:46,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:25:46,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:25:46,374 INFO L87 Difference]: Start difference. First operand 153 states and 329 transitions. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:25:48,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:48,584 INFO L93 Difference]: Finished difference Result 184 states and 372 transitions. [2025-04-13 22:25:48,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:25:48,585 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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) Word has length 22 [2025-04-13 22:25:48,585 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:48,586 INFO L225 Difference]: With dead ends: 184 [2025-04-13 22:25:48,586 INFO L226 Difference]: Without dead ends: 168 [2025-04-13 22:25:48,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:25:48,586 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:48,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:25:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-04-13 22:25:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2025-04-13 22:25:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.16) internal successors, (324), 150 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 324 transitions. [2025-04-13 22:25:49,005 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 324 transitions. Word has length 22 [2025-04-13 22:25:49,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:49,005 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 324 transitions. [2025-04-13 22:25:49,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:25:49,005 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 324 transitions. [2025-04-13 22:25:49,005 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:49,005 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:49,005 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:49,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Forceful destruction successful, exit code 0 [2025-04-13 22:25:49,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 174 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2025-04-13 22:25:49,206 INFO L403 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:49,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:49,206 INFO L85 PathProgramCache]: Analyzing trace with hash 288595050, now seen corresponding path program 168 times [2025-04-13 22:25:49,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:49,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086246670] [2025-04-13 22:25:49,206 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:49,214 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:25:49,230 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:49,230 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:25:49,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086246670] [2025-04-13 22:25:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086246670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371619616] [2025-04-13 22:25:49,869 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:49,871 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:49,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2025-04-13 22:25:50,150 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:25:50,172 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:50,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:25:50,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:50,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:25:50,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:50,663 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 178 treesize of output 118 [2025-04-13 22:25:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:50,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:51,645 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:51,646 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 267 treesize of output 175 [2025-04-13 22:25:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371619616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:51,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:51,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2025-04-13 22:25:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031423869] [2025-04-13 22:25:51,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:51,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:25:51,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:51,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:25:51,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:25:51,826 INFO L87 Difference]: Start difference. First operand 151 states and 324 transitions. Second operand has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:25:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:53,324 INFO L93 Difference]: Finished difference Result 168 states and 348 transitions. [2025-04-13 22:25:53,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:25:53,324 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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) Word has length 22 [2025-04-13 22:25:53,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:53,325 INFO L225 Difference]: With dead ends: 168 [2025-04-13 22:25:53,325 INFO L226 Difference]: Without dead ends: 145 [2025-04-13 22:25:53,326 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:25:53,326 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:53,326 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:25:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-04-13 22:25:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-04-13 22:25:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 2.1666666666666665) internal successors, (312), 144 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 312 transitions. [2025-04-13 22:25:53,730 INFO L79 Accepts]: Start accepts. Automaton has 145 states and 312 transitions. Word has length 22 [2025-04-13 22:25:53,731 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:53,731 INFO L485 AbstractCegarLoop]: Abstraction has 145 states and 312 transitions. [2025-04-13 22:25:53,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:25:53,731 INFO L278 IsEmpty]: Start isEmpty. Operand 145 states and 312 transitions. [2025-04-13 22:25:53,731 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:53,731 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:53,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:53,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Ended with exit code 0 [2025-04-13 22:25:53,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 175 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable180 [2025-04-13 22:25:53,931 INFO L403 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:53,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash 661703824, now seen corresponding path program 169 times [2025-04-13 22:25:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:53,932 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958534513] [2025-04-13 22:25:53,932 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:25:53,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:53,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:53,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:54,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958534513] [2025-04-13 22:25:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958534513] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:54,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589345707] [2025-04-13 22:25:54,607 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:54,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:54,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:54,609 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:54,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2025-04-13 22:25:54,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:25:54,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:54,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:54,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:25:54,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:55,159 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 180 treesize of output 102 [2025-04-13 22:25:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:55,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:55,767 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:55,768 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 368 treesize of output 216 [2025-04-13 22:25:56,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:25:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589345707] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:56,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2025-04-13 22:25:56,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831362113] [2025-04-13 22:25:56,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:56,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:25:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:56,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:25:56,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:25:56,001 INFO L87 Difference]: Start difference. First operand 145 states and 312 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:25:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:58,174 INFO L93 Difference]: Finished difference Result 195 states and 403 transitions. [2025-04-13 22:25:58,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:25:58,174 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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) Word has length 22 [2025-04-13 22:25:58,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:58,175 INFO L225 Difference]: With dead ends: 195 [2025-04-13 22:25:58,175 INFO L226 Difference]: Without dead ends: 186 [2025-04-13 22:25:58,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=363, Invalid=2717, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:25:58,176 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:58,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-04-13 22:25:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2025-04-13 22:25:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.175675675675676) internal successors, (322), 148 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:25:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 322 transitions. [2025-04-13 22:25:58,609 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 322 transitions. Word has length 22 [2025-04-13 22:25:58,609 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:58,609 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 322 transitions. [2025-04-13 22:25:58,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:25:58,609 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 322 transitions. [2025-04-13 22:25:58,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:25:58,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:58,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:58,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Forceful destruction successful, exit code 0 [2025-04-13 22:25:58,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181,176 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:58,810 INFO L403 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:58,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2037042520, now seen corresponding path program 170 times [2025-04-13 22:25:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:58,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728584020] [2025-04-13 22:25:58,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:58,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:25:58,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:58,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:58,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:25:59,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:59,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728584020] [2025-04-13 22:25:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728584020] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:59,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923096216] [2025-04-13 22:25:59,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:59,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:59,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:59,544 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:25:59,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2025-04-13 22:25:59,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:25:59,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:25:59,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:59,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:59,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:25:59,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:00,036 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 182 treesize of output 118 [2025-04-13 22:26:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:00,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:00,732 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:00,733 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 325 treesize of output 205 [2025-04-13 22:26:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:00,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923096216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:00,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 35 [2025-04-13 22:26:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818397660] [2025-04-13 22:26:00,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:00,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:26:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:00,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:26:00,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:26:00,989 INFO L87 Difference]: Start difference. First operand 149 states and 322 transitions. Second operand has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 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-13 22:26:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:02,783 INFO L93 Difference]: Finished difference Result 186 states and 387 transitions. [2025-04-13 22:26:02,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:26:02,784 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 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) Word has length 22 [2025-04-13 22:26:02,784 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:02,785 INFO L225 Difference]: With dead ends: 186 [2025-04-13 22:26:02,785 INFO L226 Difference]: Without dead ends: 179 [2025-04-13 22:26:02,785 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=407, Invalid=2349, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:26:02,785 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:02,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-13 22:26:03,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 153. [2025-04-13 22:26:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.1710526315789473) internal successors, (330), 152 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 330 transitions. [2025-04-13 22:26:03,239 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 330 transitions. Word has length 22 [2025-04-13 22:26:03,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:03,239 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 330 transitions. [2025-04-13 22:26:03,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 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-13 22:26:03,239 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 330 transitions. [2025-04-13 22:26:03,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:03,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:03,240 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:03,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Ended with exit code 0 [2025-04-13 22:26:03,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,177 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:03,440 INFO L403 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:03,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:03,440 INFO L85 PathProgramCache]: Analyzing trace with hash 548200114, now seen corresponding path program 171 times [2025-04-13 22:26:03,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:03,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702518367] [2025-04-13 22:26:03,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:03,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:03,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:03,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:03,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:26:04,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:04,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702518367] [2025-04-13 22:26:04,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702518367] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:04,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953975808] [2025-04-13 22:26:04,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:04,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:04,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:04,101 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:04,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2025-04-13 22:26:04,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:04,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:04,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:04,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:04,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:26:04,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:04,639 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 203 treesize of output 131 [2025-04-13 22:26:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:04,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:05,388 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:05,388 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 325 treesize of output 205 [2025-04-13 22:26:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953975808] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:05,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:05,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 35 [2025-04-13 22:26:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106657927] [2025-04-13 22:26:05,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:05,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:26:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:05,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:26:05,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:26:05,658 INFO L87 Difference]: Start difference. First operand 153 states and 330 transitions. Second operand has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 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-13 22:26:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:07,271 INFO L93 Difference]: Finished difference Result 179 states and 378 transitions. [2025-04-13 22:26:07,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:26:07,271 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 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) Word has length 22 [2025-04-13 22:26:07,271 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:07,272 INFO L225 Difference]: With dead ends: 179 [2025-04-13 22:26:07,272 INFO L226 Difference]: Without dead ends: 167 [2025-04-13 22:26:07,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=2059, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:26:07,273 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:07,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 0 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-13 22:26:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2025-04-13 22:26:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.1666666666666665) internal successors, (325), 150 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 325 transitions. [2025-04-13 22:26:07,720 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 325 transitions. Word has length 22 [2025-04-13 22:26:07,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:07,721 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 325 transitions. [2025-04-13 22:26:07,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 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-13 22:26:07,721 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 325 transitions. [2025-04-13 22:26:07,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:07,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:07,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:07,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Ended with exit code 0 [2025-04-13 22:26:07,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183,178 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:07,921 INFO L403 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:07,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -539581070, now seen corresponding path program 172 times [2025-04-13 22:26:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:07,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97998079] [2025-04-13 22:26:07,922 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:07,933 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:26:07,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:07,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:07,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:08,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:08,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97998079] [2025-04-13 22:26:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97998079] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:08,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392672145] [2025-04-13 22:26:08,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:08,445 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:08,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2025-04-13 22:26:08,730 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:26:08,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:08,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:08,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:08,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:26:08,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:08,884 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 240 treesize of output 132 [2025-04-13 22:26:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:09,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:09,582 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:09,582 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 325 treesize of output 205 [2025-04-13 22:26:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392672145] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:09,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-13 22:26:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678956061] [2025-04-13 22:26:09,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:09,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:26:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:09,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:26:09,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:26:09,848 INFO L87 Difference]: Start difference. First operand 151 states and 325 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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-13 22:26:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:13,575 INFO L93 Difference]: Finished difference Result 262 states and 509 transitions. [2025-04-13 22:26:13,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:26:13,575 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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) Word has length 22 [2025-04-13 22:26:13,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:13,576 INFO L225 Difference]: With dead ends: 262 [2025-04-13 22:26:13,576 INFO L226 Difference]: Without dead ends: 249 [2025-04-13 22:26:13,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=520, Invalid=3512, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:26:13,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:13,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:26:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-13 22:26:14,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 155. [2025-04-13 22:26:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.1623376623376624) internal successors, (333), 154 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 333 transitions. [2025-04-13 22:26:14,038 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 333 transitions. Word has length 22 [2025-04-13 22:26:14,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:14,038 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 333 transitions. [2025-04-13 22:26:14,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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-13 22:26:14,038 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 333 transitions. [2025-04-13 22:26:14,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:14,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:14,038 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:14,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Ended with exit code 0 [2025-04-13 22:26:14,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184,179 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:14,239 INFO L403 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:14,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2028423476, now seen corresponding path program 173 times [2025-04-13 22:26:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:14,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252904248] [2025-04-13 22:26:14,239 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:14,247 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:14,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:14,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:26:14,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:14,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252904248] [2025-04-13 22:26:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252904248] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:14,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150013683] [2025-04-13 22:26:14,731 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:14,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:14,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:14,733 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:14,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2025-04-13 22:26:15,020 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:15,056 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:15,056 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:26:15,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:15,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:26:15,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:15,085 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 19 treesize of output 1 [2025-04-13 22:26:15,280 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 240 treesize of output 132 [2025-04-13 22:26:15,461 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:15,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150013683] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:16,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 33 [2025-04-13 22:26:16,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049942081] [2025-04-13 22:26:16,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:16,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:26:16,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:16,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:26:16,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:26:16,884 INFO L87 Difference]: Start difference. First operand 155 states and 333 transitions. Second operand has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:26:20,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:20,754 INFO L93 Difference]: Finished difference Result 263 states and 506 transitions. [2025-04-13 22:26:20,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:26:20,754 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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) Word has length 22 [2025-04-13 22:26:20,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:20,755 INFO L225 Difference]: With dead ends: 263 [2025-04-13 22:26:20,755 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 22:26:20,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=363, Invalid=2289, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:26:20,756 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:20,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:26:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 22:26:21,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 163. [2025-04-13 22:26:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.154320987654321) internal successors, (349), 162 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 349 transitions. [2025-04-13 22:26:21,259 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 349 transitions. Word has length 22 [2025-04-13 22:26:21,259 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:21,259 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 349 transitions. [2025-04-13 22:26:21,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:26:21,259 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 349 transitions. [2025-04-13 22:26:21,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:21,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:21,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:21,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Ended with exit code 0 [2025-04-13 22:26:21,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,180 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:21,460 INFO L403 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:21,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -597673520, now seen corresponding path program 174 times [2025-04-13 22:26:21,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:21,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679883219] [2025-04-13 22:26:21,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:21,469 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:21,482 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:21,482 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:26:21,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:22,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679883219] [2025-04-13 22:26:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679883219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:22,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601344781] [2025-04-13 22:26:22,185 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:22,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:22,187 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:22,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2025-04-13 22:26:22,481 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:22,506 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:22,506 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:26:22,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:22,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:26:22,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:22,772 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 180 treesize of output 120 [2025-04-13 22:26:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:22,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:23,395 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:23,396 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 368 treesize of output 216 [2025-04-13 22:26:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:23,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601344781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:23,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:23,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 32 [2025-04-13 22:26:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107675891] [2025-04-13 22:26:23,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:23,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:23,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:23,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:23,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:26:23,623 INFO L87 Difference]: Start difference. First operand 163 states and 349 transitions. Second operand has 33 states, 32 states have (on average 1.625) internal successors, (52), 33 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-13 22:26:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:26,169 INFO L93 Difference]: Finished difference Result 222 states and 440 transitions. [2025-04-13 22:26:26,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:26:26,169 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.625) internal successors, (52), 33 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) Word has length 22 [2025-04-13 22:26:26,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:26,170 INFO L225 Difference]: With dead ends: 222 [2025-04-13 22:26:26,170 INFO L226 Difference]: Without dead ends: 197 [2025-04-13 22:26:26,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=461, Invalid=2731, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:26:26,171 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:26,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:26:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-04-13 22:26:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 161. [2025-04-13 22:26:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.15) internal successors, (344), 160 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 344 transitions. [2025-04-13 22:26:26,680 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 344 transitions. Word has length 22 [2025-04-13 22:26:26,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:26,680 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 344 transitions. [2025-04-13 22:26:26,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.625) internal successors, (52), 33 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-13 22:26:26,680 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 344 transitions. [2025-04-13 22:26:26,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:26,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:26,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:26,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Ended with exit code 0 [2025-04-13 22:26:26,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186,181 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:26,881 INFO L403 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:26,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash -296694952, now seen corresponding path program 175 times [2025-04-13 22:26:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:26,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093500609] [2025-04-13 22:26:26,881 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:26,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:26:26,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:27,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093500609] [2025-04-13 22:26:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093500609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:27,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946305766] [2025-04-13 22:26:27,668 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:27,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:27,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:27,670 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:27,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2025-04-13 22:26:27,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:26:27,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:27,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:27,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:27,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:26:27,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:28,212 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 240 treesize of output 132 [2025-04-13 22:26:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:28,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:29,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:29,066 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 329 treesize of output 207 [2025-04-13 22:26:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946305766] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:29,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2025-04-13 22:26:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515599345] [2025-04-13 22:26:29,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:29,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:26:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:29,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:26:29,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:26:29,320 INFO L87 Difference]: Start difference. First operand 161 states and 344 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:26:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:33,184 INFO L93 Difference]: Finished difference Result 240 states and 464 transitions. [2025-04-13 22:26:33,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:26:33,185 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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) Word has length 22 [2025-04-13 22:26:33,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:33,186 INFO L225 Difference]: With dead ends: 240 [2025-04-13 22:26:33,186 INFO L226 Difference]: Without dead ends: 227 [2025-04-13 22:26:33,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=488, Invalid=4068, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 22:26:33,186 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:33,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 0 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:26:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-13 22:26:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 161. [2025-04-13 22:26:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.15) internal successors, (344), 160 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 344 transitions. [2025-04-13 22:26:33,700 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 344 transitions. Word has length 22 [2025-04-13 22:26:33,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:33,700 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 344 transitions. [2025-04-13 22:26:33,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:26:33,700 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 344 transitions. [2025-04-13 22:26:33,700 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:33,700 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:33,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:33,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Ended with exit code 0 [2025-04-13 22:26:33,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 182 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable187 [2025-04-13 22:26:33,900 INFO L403 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:33,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1186785074, now seen corresponding path program 176 times [2025-04-13 22:26:33,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:33,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788500010] [2025-04-13 22:26:33,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:33,909 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:26:33,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:33,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:33,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:34,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788500010] [2025-04-13 22:26:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788500010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:34,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22895570] [2025-04-13 22:26:34,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:34,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:34,682 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:34,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2025-04-13 22:26:34,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:26:34,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:34,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:34,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:34,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:26:34,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:35,176 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 161 treesize of output 105 [2025-04-13 22:26:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:35,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:36,012 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:36,012 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 280 treesize of output 181 [2025-04-13 22:26:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:36,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22895570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:36,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:36,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 33 [2025-04-13 22:26:36,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183756676] [2025-04-13 22:26:36,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:36,230 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:26:36,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:36,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:26:36,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:26:36,231 INFO L87 Difference]: Start difference. First operand 161 states and 344 transitions. Second operand has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:38,755 INFO L93 Difference]: Finished difference Result 233 states and 452 transitions. [2025-04-13 22:26:38,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:26:38,755 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:26:38,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:38,756 INFO L225 Difference]: With dead ends: 233 [2025-04-13 22:26:38,756 INFO L226 Difference]: Without dead ends: 214 [2025-04-13 22:26:38,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=405, Invalid=2457, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:26:38,756 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:38,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-13 22:26:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 165. [2025-04-13 22:26:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.1463414634146343) internal successors, (352), 164 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 352 transitions. [2025-04-13 22:26:39,308 INFO L79 Accepts]: Start accepts. Automaton has 165 states and 352 transitions. Word has length 22 [2025-04-13 22:26:39,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:39,308 INFO L485 AbstractCegarLoop]: Abstraction has 165 states and 352 transitions. [2025-04-13 22:26:39,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:39,308 INFO L278 IsEmpty]: Start isEmpty. Operand 165 states and 352 transitions. [2025-04-13 22:26:39,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:39,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:39,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:39,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Ended with exit code 0 [2025-04-13 22:26:39,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188,183 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:39,508 INFO L403 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:39,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash -354787402, now seen corresponding path program 177 times [2025-04-13 22:26:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:39,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593099811] [2025-04-13 22:26:39,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:39,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:39,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:39,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:39,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:26:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:40,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593099811] [2025-04-13 22:26:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593099811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:40,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748105034] [2025-04-13 22:26:40,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:40,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:40,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:40,295 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:40,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2025-04-13 22:26:40,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:40,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:40,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:40,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:40,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:26:40,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:40,971 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 175 treesize of output 115 [2025-04-13 22:26:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:41,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:41,735 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:41,735 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 316 treesize of output 190 [2025-04-13 22:26:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:41,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748105034] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:41,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:41,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 33 [2025-04-13 22:26:41,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967548501] [2025-04-13 22:26:41,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:41,948 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:26:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:41,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:26:41,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:26:41,948 INFO L87 Difference]: Start difference. First operand 165 states and 352 transitions. Second operand has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 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-13 22:26:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:45,118 INFO L93 Difference]: Finished difference Result 233 states and 450 transitions. [2025-04-13 22:26:45,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:26:45,118 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 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) Word has length 22 [2025-04-13 22:26:45,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:45,119 INFO L225 Difference]: With dead ends: 233 [2025-04-13 22:26:45,119 INFO L226 Difference]: Without dead ends: 208 [2025-04-13 22:26:45,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=494, Invalid=2698, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:26:45,119 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:45,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:26:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-13 22:26:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 163. [2025-04-13 22:26:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.1419753086419755) internal successors, (347), 162 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:45,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 347 transitions. [2025-04-13 22:26:45,664 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 347 transitions. Word has length 22 [2025-04-13 22:26:45,664 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:45,664 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 347 transitions. [2025-04-13 22:26:45,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 34 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-13 22:26:45,664 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 347 transitions. [2025-04-13 22:26:45,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:45,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:45,665 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:45,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Ended with exit code 0 [2025-04-13 22:26:45,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 184 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable189 [2025-04-13 22:26:45,865 INFO L403 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:45,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash -586375246, now seen corresponding path program 178 times [2025-04-13 22:26:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:45,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237131949] [2025-04-13 22:26:45,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:45,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:26:45,883 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:45,883 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:45,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:46,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237131949] [2025-04-13 22:26:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237131949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:46,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464690330] [2025-04-13 22:26:46,394 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:46,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:46,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:46,396 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2025-04-13 22:26:46,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:26:46,715 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:46,715 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:46,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:46,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:26:46,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:46,963 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 210 treesize of output 120 [2025-04-13 22:26:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:47,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:47,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:47,581 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 345 treesize of output 205 [2025-04-13 22:26:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464690330] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:47,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-04-13 22:26:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584741055] [2025-04-13 22:26:47,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:47,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:26:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:47,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:26:47,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:26:47,786 INFO L87 Difference]: Start difference. First operand 163 states and 347 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:50,337 INFO L93 Difference]: Finished difference Result 210 states and 414 transitions. [2025-04-13 22:26:50,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:26:50,337 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:26:50,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:50,338 INFO L225 Difference]: With dead ends: 210 [2025-04-13 22:26:50,338 INFO L226 Difference]: Without dead ends: 177 [2025-04-13 22:26:50,338 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=370, Invalid=1792, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:26:50,339 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:50,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-04-13 22:26:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2025-04-13 22:26:50,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.132911392405063) internal successors, (337), 158 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 337 transitions. [2025-04-13 22:26:50,865 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 337 transitions. Word has length 22 [2025-04-13 22:26:50,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:50,866 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 337 transitions. [2025-04-13 22:26:50,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:50,866 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 337 transitions. [2025-04-13 22:26:50,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:50,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:50,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:50,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Ended with exit code 0 [2025-04-13 22:26:51,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2025-04-13 22:26:51,066 INFO L403 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:51,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1764164850, now seen corresponding path program 179 times [2025-04-13 22:26:51,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:51,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451925670] [2025-04-13 22:26:51,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:51,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:51,083 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:51,083 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:26:51,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:51,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:51,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451925670] [2025-04-13 22:26:51,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451925670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:51,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200498679] [2025-04-13 22:26:51,626 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:51,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:51,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:51,628 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:51,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2025-04-13 22:26:51,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:51,979 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:51,979 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:26:51,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:51,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:26:51,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:52,008 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 19 treesize of output 1 [2025-04-13 22:26:52,235 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 239 treesize of output 131 [2025-04-13 22:26:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:52,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:53,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200498679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:53,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:53,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 32 [2025-04-13 22:26:53,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413690494] [2025-04-13 22:26:53,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:53,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:53,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:53,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:53,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:26:53,895 INFO L87 Difference]: Start difference. First operand 159 states and 337 transitions. Second operand has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:56,920 INFO L93 Difference]: Finished difference Result 219 states and 436 transitions. [2025-04-13 22:26:56,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:26:56,920 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:26:56,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:56,921 INFO L225 Difference]: With dead ends: 219 [2025-04-13 22:26:56,921 INFO L226 Difference]: Without dead ends: 212 [2025-04-13 22:26:56,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=229, Invalid=1411, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:26:56,922 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:56,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:26:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-13 22:26:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 161. [2025-04-13 22:26:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.1375) internal successors, (342), 160 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 342 transitions. [2025-04-13 22:26:57,450 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 342 transitions. Word has length 22 [2025-04-13 22:26:57,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:57,450 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 342 transitions. [2025-04-13 22:26:57,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.71875) internal successors, (55), 33 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:26:57,450 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 342 transitions. [2025-04-13 22:26:57,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:26:57,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:57,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:57,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Ended with exit code 0 [2025-04-13 22:26:57,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,186 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:57,651 INFO L403 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:57,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:57,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1047322420, now seen corresponding path program 180 times [2025-04-13 22:26:57,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:57,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127218750] [2025-04-13 22:26:57,651 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:57,660 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:57,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:57,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:26:57,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:58,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127218750] [2025-04-13 22:26:58,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127218750] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:58,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409867810] [2025-04-13 22:26:58,342 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:58,344 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:26:58,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2025-04-13 22:26:58,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:26:58,665 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:26:58,665 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:26:58,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:58,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:26:58,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:58,904 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 161 treesize of output 105 [2025-04-13 22:26:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:26:59,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:59,845 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:59,846 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 329 treesize of output 207 [2025-04-13 22:27:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409867810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:00,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 33 [2025-04-13 22:27:00,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870776912] [2025-04-13 22:27:00,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:00,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:27:00,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:00,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:27:00,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:27:00,070 INFO L87 Difference]: Start difference. First operand 161 states and 342 transitions. Second operand has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 34 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-13 22:27:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:02,792 INFO L93 Difference]: Finished difference Result 209 states and 410 transitions. [2025-04-13 22:27:02,793 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:27:02,793 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 34 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) Word has length 22 [2025-04-13 22:27:02,793 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:02,794 INFO L225 Difference]: With dead ends: 209 [2025-04-13 22:27:02,794 INFO L226 Difference]: Without dead ends: 199 [2025-04-13 22:27:02,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=318, Invalid=2334, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:27:02,795 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:02,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:27:02,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-04-13 22:27:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 165. [2025-04-13 22:27:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.1341463414634148) internal successors, (350), 164 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 350 transitions. [2025-04-13 22:27:03,369 INFO L79 Accepts]: Start accepts. Automaton has 165 states and 350 transitions. Word has length 22 [2025-04-13 22:27:03,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:03,369 INFO L485 AbstractCegarLoop]: Abstraction has 165 states and 350 transitions. [2025-04-13 22:27:03,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 34 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-13 22:27:03,369 INFO L278 IsEmpty]: Start isEmpty. Operand 165 states and 350 transitions. [2025-04-13 22:27:03,370 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:03,370 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:03,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:03,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Ended with exit code 0 [2025-04-13 22:27:03,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,187 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:03,570 INFO L403 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:03,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:03,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1706072400, now seen corresponding path program 181 times [2025-04-13 22:27:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:03,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044655614] [2025-04-13 22:27:03,570 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:27:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:03,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:27:03,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:03,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:27:03,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:27:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:04,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044655614] [2025-04-13 22:27:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044655614] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:04,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228429535] [2025-04-13 22:27:04,318 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:27:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:04,320 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:04,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2025-04-13 22:27:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:27:04,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:04,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:27:04,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:04,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:27:04,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:04,990 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 210 treesize of output 120 [2025-04-13 22:27:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:05,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:05,891 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:05,892 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 376 treesize of output 218 [2025-04-13 22:27:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228429535] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:06,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2025-04-13 22:27:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361507265] [2025-04-13 22:27:06,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:06,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:27:06,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:06,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:27:06,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1211, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:27:06,100 INFO L87 Difference]: Start difference. First operand 165 states and 350 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:27:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:08,734 INFO L93 Difference]: Finished difference Result 193 states and 388 transitions. [2025-04-13 22:27:08,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:27:08,734 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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) Word has length 22 [2025-04-13 22:27:08,734 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:08,735 INFO L225 Difference]: With dead ends: 193 [2025-04-13 22:27:08,735 INFO L226 Difference]: Without dead ends: 180 [2025-04-13 22:27:08,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=281, Invalid=2371, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:27:08,736 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:08,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:27:08,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-04-13 22:27:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2025-04-13 22:27:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.1296296296296298) internal successors, (345), 162 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 345 transitions. [2025-04-13 22:27:09,298 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 345 transitions. Word has length 22 [2025-04-13 22:27:09,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:09,298 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 345 transitions. [2025-04-13 22:27:09,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:27:09,298 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 345 transitions. [2025-04-13 22:27:09,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:09,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:09,298 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:09,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Ended with exit code 0 [2025-04-13 22:27:09,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable193 [2025-04-13 22:27:09,499 INFO L403 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:09,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1474484556, now seen corresponding path program 182 times [2025-04-13 22:27:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:09,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800707634] [2025-04-13 22:27:09,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:27:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:09,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:27:09,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:09,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:27:09,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:27:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:10,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800707634] [2025-04-13 22:27:10,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800707634] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:10,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276450544] [2025-04-13 22:27:10,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:27:10,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:10,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:10,265 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:10,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2025-04-13 22:27:10,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:27:10,587 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:10,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:27:10,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:10,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:27:10,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:10,921 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 159 treesize of output 107 [2025-04-13 22:27:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:11,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:11,678 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:11,678 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 285 treesize of output 177 [2025-04-13 22:27:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276450544] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:11,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 33 [2025-04-13 22:27:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478780816] [2025-04-13 22:27:11,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:11,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:27:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:11,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:27:11,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:27:11,851 INFO L87 Difference]: Start difference. First operand 163 states and 345 transitions. Second operand has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:13,865 INFO L93 Difference]: Finished difference Result 194 states and 388 transitions. [2025-04-13 22:27:13,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:27:13,865 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:27:13,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:13,866 INFO L225 Difference]: With dead ends: 194 [2025-04-13 22:27:13,866 INFO L226 Difference]: Without dead ends: 178 [2025-04-13 22:27:13,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=294, Invalid=1868, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:27:13,867 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:13,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:27:13,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-04-13 22:27:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 161. [2025-04-13 22:27:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.125) internal successors, (340), 160 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 340 transitions. [2025-04-13 22:27:14,399 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 340 transitions. Word has length 22 [2025-04-13 22:27:14,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:14,399 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 340 transitions. [2025-04-13 22:27:14,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:14,399 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 340 transitions. [2025-04-13 22:27:14,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:14,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:14,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:14,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Forceful destruction successful, exit code 0 [2025-04-13 22:27:14,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194,189 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:14,600 INFO L403 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:14,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1722289968, now seen corresponding path program 183 times [2025-04-13 22:27:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:14,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614867072] [2025-04-13 22:27:14,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:27:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:14,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:27:14,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:14,624 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:27:14,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:27:15,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:15,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614867072] [2025-04-13 22:27:15,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614867072] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:15,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583117035] [2025-04-13 22:27:15,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:27:15,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:15,513 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:15,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2025-04-13 22:27:15,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:27:15,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:15,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:27:15,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:15,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:27:15,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:16,272 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 159 treesize of output 107 [2025-04-13 22:27:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:16,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:17,059 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:17,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 204 [2025-04-13 22:27:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:17,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583117035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:17,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:17,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2025-04-13 22:27:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831857105] [2025-04-13 22:27:17,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:17,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:27:17,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:27:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:27:17,261 INFO L87 Difference]: Start difference. First operand 161 states and 340 transitions. Second operand has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:18,950 INFO L93 Difference]: Finished difference Result 178 states and 364 transitions. [2025-04-13 22:27:18,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:27:18,950 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:27:18,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:18,951 INFO L225 Difference]: With dead ends: 178 [2025-04-13 22:27:18,951 INFO L226 Difference]: Without dead ends: 153 [2025-04-13 22:27:18,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:27:18,951 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:18,952 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:27:18,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-13 22:27:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-04-13 22:27:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.138157894736842) internal successors, (325), 152 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:19,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 325 transitions. [2025-04-13 22:27:19,466 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 325 transitions. Word has length 22 [2025-04-13 22:27:19,466 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:19,466 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 325 transitions. [2025-04-13 22:27:19,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:19,466 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 325 transitions. [2025-04-13 22:27:19,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:19,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:19,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:19,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Ended with exit code 0 [2025-04-13 22:27:19,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,190 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:19,667 INFO L403 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:19,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1050224372, now seen corresponding path program 184 times [2025-04-13 22:27:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:19,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81060326] [2025-04-13 22:27:19,667 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:27:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:19,676 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:27:19,684 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:19,684 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:27:19,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:20,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81060326] [2025-04-13 22:27:20,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81060326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:20,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054433719] [2025-04-13 22:27:20,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:27:20,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:20,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:20,207 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:20,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2025-04-13 22:27:20,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:27:20,541 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:20,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:27:20,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:20,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:27:20,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:20,825 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 185 treesize of output 107 [2025-04-13 22:27:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:20,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:21,460 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:21,460 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 285 treesize of output 177 [2025-04-13 22:27:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054433719] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:21,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-04-13 22:27:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698863487] [2025-04-13 22:27:21,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:21,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:27:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:21,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:27:21,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=847, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:27:21,648 INFO L87 Difference]: Start difference. First operand 153 states and 325 transitions. Second operand has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 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-13 22:27:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:24,766 INFO L93 Difference]: Finished difference Result 244 states and 476 transitions. [2025-04-13 22:27:24,766 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:27:24,766 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 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) Word has length 22 [2025-04-13 22:27:24,766 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:24,767 INFO L225 Difference]: With dead ends: 244 [2025-04-13 22:27:24,767 INFO L226 Difference]: Without dead ends: 233 [2025-04-13 22:27:24,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=431, Invalid=1921, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:27:24,768 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 236 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:24,768 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 0 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:27:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-13 22:27:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 155. [2025-04-13 22:27:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.1298701298701297) internal successors, (328), 154 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 328 transitions. [2025-04-13 22:27:25,293 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 328 transitions. Word has length 22 [2025-04-13 22:27:25,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:25,293 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 328 transitions. [2025-04-13 22:27:25,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 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-13 22:27:25,293 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 328 transitions. [2025-04-13 22:27:25,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:25,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:25,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:25,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Ended with exit code 0 [2025-04-13 22:27:25,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196,191 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:25,494 INFO L403 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:25,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1496256146, now seen corresponding path program 185 times [2025-04-13 22:27:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:25,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114154109] [2025-04-13 22:27:25,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:27:25,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:25,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:27:25,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:25,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:27:25,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:26,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:26,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114154109] [2025-04-13 22:27:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114154109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:26,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548710463] [2025-04-13 22:27:26,039 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:27:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:26,040 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:26,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2025-04-13 22:27:26,347 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:27:26,378 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:26,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:27:26,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:26,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:27:26,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:26,681 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 230 treesize of output 128 [2025-04-13 22:27:26,789 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:26,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:27,419 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:27,419 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 376 treesize of output 218 [2025-04-13 22:27:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548710463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:27,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:27,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-04-13 22:27:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620537894] [2025-04-13 22:27:27,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:27,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:27:27,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:27,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:27:27,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:27:27,638 INFO L87 Difference]: Start difference. First operand 155 states and 328 transitions. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:27:32,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:32,017 INFO L93 Difference]: Finished difference Result 311 states and 580 transitions. [2025-04-13 22:27:32,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:27:32,017 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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) Word has length 22 [2025-04-13 22:27:32,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:32,018 INFO L225 Difference]: With dead ends: 311 [2025-04-13 22:27:32,018 INFO L226 Difference]: Without dead ends: 302 [2025-04-13 22:27:32,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:27:32,019 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:32,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:27:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-13 22:27:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 155. [2025-04-13 22:27:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.1298701298701297) internal successors, (328), 154 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 328 transitions. [2025-04-13 22:27:32,557 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 328 transitions. Word has length 22 [2025-04-13 22:27:32,557 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:32,557 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 328 transitions. [2025-04-13 22:27:32,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:27:32,557 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 328 transitions. [2025-04-13 22:27:32,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:32,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:32,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:32,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Ended with exit code 0 [2025-04-13 22:27:32,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197,192 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:32,758 INFO L403 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:32,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -301577716, now seen corresponding path program 186 times [2025-04-13 22:27:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:32,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638401535] [2025-04-13 22:27:32,758 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:27:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:32,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:27:32,784 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:32,784 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:27:32,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:27:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:33,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638401535] [2025-04-13 22:27:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638401535] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:33,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624230122] [2025-04-13 22:27:33,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:27:33,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:33,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:33,491 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:33,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2025-04-13 22:27:33,801 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:27:33,825 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:33,825 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:27:33,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:33,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 22:27:33,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:33,869 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 19 treesize of output 1 [2025-04-13 22:27:34,093 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 214 treesize of output 118 [2025-04-13 22:27:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:27:34,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:35,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624230122] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:35,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:35,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 37 [2025-04-13 22:27:35,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835290487] [2025-04-13 22:27:35,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:35,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:27:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:35,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:27:35,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1266, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:27:35,473 INFO L87 Difference]: Start difference. First operand 155 states and 328 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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-13 22:27:41,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:41,214 INFO L93 Difference]: Finished difference Result 348 states and 647 transitions. [2025-04-13 22:27:41,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:27:41,215 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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) Word has length 22 [2025-04-13 22:27:41,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:41,216 INFO L225 Difference]: With dead ends: 348 [2025-04-13 22:27:41,216 INFO L226 Difference]: Without dead ends: 341 [2025-04-13 22:27:41,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=792, Invalid=4464, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 22:27:41,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 387 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:41,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 0 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:27:41,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-04-13 22:27:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 157. [2025-04-13 22:27:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.121794871794872) internal successors, (331), 156 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 331 transitions. [2025-04-13 22:27:41,769 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 331 transitions. Word has length 22 [2025-04-13 22:27:41,769 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:41,769 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 331 transitions. [2025-04-13 22:27:41,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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-13 22:27:41,769 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 331 transitions. [2025-04-13 22:27:41,769 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:41,769 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:41,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:41,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Forceful destruction successful, exit code 0 [2025-04-13 22:27:41,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198,193 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:41,970 INFO L403 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:41,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:41,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1609759856, now seen corresponding path program 187 times [2025-04-13 22:27:41,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:41,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903303317] [2025-04-13 22:27:41,970 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:27:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:41,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:27:41,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:41,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:27:41,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:27:42,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:42,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903303317] [2025-04-13 22:27:42,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903303317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:42,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499085889] [2025-04-13 22:27:42,691 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:27:42,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:42,693 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:42,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Waiting until timeout for monitored process [2025-04-13 22:27:43,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:27:43,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:43,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:27:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:43,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:27:43,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:43,236 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 214 treesize of output 118 [2025-04-13 22:27:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:43,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:44,057 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:44,057 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 299 treesize of output 193 [2025-04-13 22:27:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499085889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:44,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2025-04-13 22:27:44,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343737352] [2025-04-13 22:27:44,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:44,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:27:44,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:44,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:27:44,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:27:44,261 INFO L87 Difference]: Start difference. First operand 157 states and 331 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:27:46,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:46,920 INFO L93 Difference]: Finished difference Result 197 states and 394 transitions. [2025-04-13 22:27:46,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:27:46,920 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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) Word has length 22 [2025-04-13 22:27:46,920 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:46,921 INFO L225 Difference]: With dead ends: 197 [2025-04-13 22:27:46,921 INFO L226 Difference]: Without dead ends: 183 [2025-04-13 22:27:46,922 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=2537, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:27:46,922 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:46,922 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:27:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-04-13 22:27:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2025-04-13 22:27:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 2.125) internal successors, (323), 152 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 323 transitions. [2025-04-13 22:27:47,463 INFO L79 Accepts]: Start accepts. Automaton has 153 states and 323 transitions. Word has length 22 [2025-04-13 22:27:47,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:47,463 INFO L485 AbstractCegarLoop]: Abstraction has 153 states and 323 transitions. [2025-04-13 22:27:47,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:27:47,463 INFO L278 IsEmpty]: Start isEmpty. Operand 153 states and 323 transitions. [2025-04-13 22:27:47,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:47,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:47,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:47,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Ended with exit code 0 [2025-04-13 22:27:47,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 194 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2025-04-13 22:27:47,663 INFO L403 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:47,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:47,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1151835162, now seen corresponding path program 188 times [2025-04-13 22:27:47,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:47,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166717059] [2025-04-13 22:27:47,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:27:47,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:47,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:27:47,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:47,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:27:47,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:48,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166717059] [2025-04-13 22:27:48,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166717059] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:48,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321076322] [2025-04-13 22:27:48,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:27:48,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:48,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:48,204 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:48,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2025-04-13 22:27:48,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:27:48,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:48,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:27:48,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:48,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:27:48,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:48,739 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 182 treesize of output 118 [2025-04-13 22:27:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:48,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:49,498 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:49,499 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 210 [2025-04-13 22:27:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321076322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:49,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 33 [2025-04-13 22:27:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093158676] [2025-04-13 22:27:49,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:49,738 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:27:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:49,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:27:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:27:49,739 INFO L87 Difference]: Start difference. First operand 153 states and 323 transitions. Second operand has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:27:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:54,085 INFO L93 Difference]: Finished difference Result 279 states and 523 transitions. [2025-04-13 22:27:54,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:27:54,086 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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) Word has length 22 [2025-04-13 22:27:54,086 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:54,087 INFO L225 Difference]: With dead ends: 279 [2025-04-13 22:27:54,087 INFO L226 Difference]: Without dead ends: 256 [2025-04-13 22:27:54,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=723, Invalid=4107, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:27:54,087 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:54,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:27:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-04-13 22:27:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 161. [2025-04-13 22:27:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.13125) internal successors, (341), 160 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 341 transitions. [2025-04-13 22:27:54,677 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 341 transitions. Word has length 22 [2025-04-13 22:27:54,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:54,677 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 341 transitions. [2025-04-13 22:27:54,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.696969696969697) internal successors, (56), 34 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-13 22:27:54,677 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 341 transitions. [2025-04-13 22:27:54,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:27:54,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:54,678 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:54,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Ended with exit code 0 [2025-04-13 22:27:54,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2025-04-13 22:27:54,878 INFO L403 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:54,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -393795120, now seen corresponding path program 189 times [2025-04-13 22:27:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:54,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107058035] [2025-04-13 22:27:54,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:27:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:54,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:27:54,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:54,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:27:54,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:55,593 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:27:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:55,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107058035] [2025-04-13 22:27:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107058035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:55,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060653783] [2025-04-13 22:27:55,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:27:55,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:55,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:55,595 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:27:55,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2025-04-13 22:27:55,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:27:55,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:27:55,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:27:55,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:55,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:27:55,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:56,007 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-13 22:27:56,174 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 182 treesize of output 118 [2025-04-13 22:27:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:27:56,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:27:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060653783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:57,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:57,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 35 [2025-04-13 22:27:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127148211] [2025-04-13 22:27:57,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:57,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:27:57,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:57,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:27:57,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:27:57,749 INFO L87 Difference]: Start difference. First operand 161 states and 341 transitions. Second operand has 36 states, 35 states have (on average 1.6) internal successors, (56), 36 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-13 22:28:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:02,153 INFO L93 Difference]: Finished difference Result 259 states and 512 transitions. [2025-04-13 22:28:02,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:28:02,153 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 36 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) Word has length 22 [2025-04-13 22:28:02,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:02,154 INFO L225 Difference]: With dead ends: 259 [2025-04-13 22:28:02,154 INFO L226 Difference]: Without dead ends: 252 [2025-04-13 22:28:02,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=450, Invalid=2630, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:28:02,154 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:02,155 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:28:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-04-13 22:28:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 159. [2025-04-13 22:28:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.1392405063291138) internal successors, (338), 158 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 338 transitions. [2025-04-13 22:28:02,756 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 338 transitions. Word has length 22 [2025-04-13 22:28:02,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:02,756 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 338 transitions. [2025-04-13 22:28:02,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 36 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-13 22:28:02,756 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 338 transitions. [2025-04-13 22:28:02,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:02,756 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:02,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:02,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Ended with exit code 0 [2025-04-13 22:28:02,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 196 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable201 [2025-04-13 22:28:02,957 INFO L403 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:02,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash 909024640, now seen corresponding path program 190 times [2025-04-13 22:28:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:02,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623623962] [2025-04-13 22:28:02,957 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:28:02,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:02,966 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:28:02,974 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:02,974 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:28:02,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:03,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:03,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623623962] [2025-04-13 22:28:03,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623623962] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:03,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055367823] [2025-04-13 22:28:03,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:28:03,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:03,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:03,444 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:03,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2025-04-13 22:28:03,756 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:28:03,778 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:03,778 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:28:03,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:03,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:28:03,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:03,909 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 189 treesize of output 105 [2025-04-13 22:28:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:04,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:04,667 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:28:04,667 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 301 treesize of output 197 [2025-04-13 22:28:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055367823] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:04,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:04,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2025-04-13 22:28:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662681701] [2025-04-13 22:28:04,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:04,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:28:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:04,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:28:04,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:28:04,882 INFO L87 Difference]: Start difference. First operand 159 states and 338 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:09,443 INFO L93 Difference]: Finished difference Result 303 states and 561 transitions. [2025-04-13 22:28:09,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:28:09,443 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:28:09,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:09,444 INFO L225 Difference]: With dead ends: 303 [2025-04-13 22:28:09,444 INFO L226 Difference]: Without dead ends: 282 [2025-04-13 22:28:09,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=575, Invalid=3331, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:28:09,445 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:09,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 1360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:28:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-04-13 22:28:10,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 159. [2025-04-13 22:28:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.1265822784810124) internal successors, (336), 158 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 336 transitions. [2025-04-13 22:28:10,034 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 336 transitions. Word has length 22 [2025-04-13 22:28:10,034 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:10,034 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 336 transitions. [2025-04-13 22:28:10,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:10,034 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 336 transitions. [2025-04-13 22:28:10,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:10,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:10,035 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:10,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Ended with exit code 0 [2025-04-13 22:28:10,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable202 [2025-04-13 22:28:10,235 INFO L403 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:10,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1335252214, now seen corresponding path program 191 times [2025-04-13 22:28:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:10,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858065826] [2025-04-13 22:28:10,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:28:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:10,244 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:10,254 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:10,254 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:28:10,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:10,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858065826] [2025-04-13 22:28:10,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858065826] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:10,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203932538] [2025-04-13 22:28:10,783 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:28:10,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:10,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:10,785 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:10,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2025-04-13 22:28:11,100 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:11,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:11,131 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:28:11,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:11,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:28:11,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:11,156 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 19 treesize of output 1 [2025-04-13 22:28:11,359 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 214 treesize of output 118 [2025-04-13 22:28:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:28:11,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:12,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203932538] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:12,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:12,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 34 [2025-04-13 22:28:12,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751166749] [2025-04-13 22:28:12,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:12,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:28:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:12,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:28:12,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:28:12,918 INFO L87 Difference]: Start difference. First operand 159 states and 336 transitions. Second operand has 35 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 35 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-13 22:28:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:18,040 INFO L93 Difference]: Finished difference Result 299 states and 576 transitions. [2025-04-13 22:28:18,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:28:18,040 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 35 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) Word has length 22 [2025-04-13 22:28:18,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:18,042 INFO L225 Difference]: With dead ends: 299 [2025-04-13 22:28:18,042 INFO L226 Difference]: Without dead ends: 292 [2025-04-13 22:28:18,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=389, Invalid=2061, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:28:18,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:18,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:28:18,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-13 22:28:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 159. [2025-04-13 22:28:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 2.1265822784810124) internal successors, (336), 158 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 336 transitions. [2025-04-13 22:28:18,635 INFO L79 Accepts]: Start accepts. Automaton has 159 states and 336 transitions. Word has length 22 [2025-04-13 22:28:18,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:18,635 INFO L485 AbstractCegarLoop]: Abstraction has 159 states and 336 transitions. [2025-04-13 22:28:18,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 35 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-13 22:28:18,636 INFO L278 IsEmpty]: Start isEmpty. Operand 159 states and 336 transitions. [2025-04-13 22:28:18,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:18,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:18,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:18,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Ended with exit code 0 [2025-04-13 22:28:18,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2025-04-13 22:28:18,836 INFO L403 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:18,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1656895322, now seen corresponding path program 192 times [2025-04-13 22:28:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:18,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953624062] [2025-04-13 22:28:18,837 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:28:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:18,845 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:18,858 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:18,858 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:28:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:19,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:19,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953624062] [2025-04-13 22:28:19,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953624062] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:19,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643999305] [2025-04-13 22:28:19,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:28:19,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:19,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:19,399 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:19,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2025-04-13 22:28:19,716 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:19,741 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:19,741 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:28:19,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:19,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 22:28:19,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:19,775 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 23 treesize of output 1 [2025-04-13 22:28:19,958 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 214 treesize of output 118 [2025-04-13 22:28:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:28:20,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643999305] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:21,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 11] total 33 [2025-04-13 22:28:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84768650] [2025-04-13 22:28:21,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:21,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:28:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:21,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:28:21,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:28:21,800 INFO L87 Difference]: Start difference. First operand 159 states and 336 transitions. Second operand has 34 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:26,036 INFO L93 Difference]: Finished difference Result 308 states and 585 transitions. [2025-04-13 22:28:26,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:28:26,037 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:28:26,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:26,038 INFO L225 Difference]: With dead ends: 308 [2025-04-13 22:28:26,038 INFO L226 Difference]: Without dead ends: 298 [2025-04-13 22:28:26,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=414, Invalid=2036, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:28:26,038 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:26,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:28:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-04-13 22:28:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 163. [2025-04-13 22:28:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.123456790123457) internal successors, (344), 162 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 344 transitions. [2025-04-13 22:28:26,695 INFO L79 Accepts]: Start accepts. Automaton has 163 states and 344 transitions. Word has length 22 [2025-04-13 22:28:26,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:26,695 INFO L485 AbstractCegarLoop]: Abstraction has 163 states and 344 transitions. [2025-04-13 22:28:26,696 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:26,696 INFO L278 IsEmpty]: Start isEmpty. Operand 163 states and 344 transitions. [2025-04-13 22:28:26,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:26,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:26,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:26,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Ended with exit code 0 [2025-04-13 22:28:26,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204,199 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:26,896 INFO L403 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:26,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:26,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1277159764, now seen corresponding path program 193 times [2025-04-13 22:28:26,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:26,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633162986] [2025-04-13 22:28:26,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:28:26,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:26,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:28:26,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:26,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:28:26,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:28:27,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:27,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633162986] [2025-04-13 22:28:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633162986] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:27,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736124660] [2025-04-13 22:28:27,727 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:28:27,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:27,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:27,729 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:27,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2025-04-13 22:28:28,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 22:28:28,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:28,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:28:28,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:28,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:28:28,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:28,392 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 210 treesize of output 120 [2025-04-13 22:28:28,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:28,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:29,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:28:29,109 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 315 treesize of output 191 [2025-04-13 22:28:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:29,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736124660] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:29,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 36 [2025-04-13 22:28:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741134530] [2025-04-13 22:28:29,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:29,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:28:29,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:29,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:28:29,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:28:29,324 INFO L87 Difference]: Start difference. First operand 163 states and 344 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:28:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:32,084 INFO L93 Difference]: Finished difference Result 192 states and 387 transitions. [2025-04-13 22:28:32,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:28:32,084 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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) Word has length 22 [2025-04-13 22:28:32,084 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:32,085 INFO L225 Difference]: With dead ends: 192 [2025-04-13 22:28:32,086 INFO L226 Difference]: Without dead ends: 179 [2025-04-13 22:28:32,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=351, Invalid=2841, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:28:32,086 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:32,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:28:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-13 22:28:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 161. [2025-04-13 22:28:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 2.11875) internal successors, (339), 160 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 339 transitions. [2025-04-13 22:28:32,716 INFO L79 Accepts]: Start accepts. Automaton has 161 states and 339 transitions. Word has length 22 [2025-04-13 22:28:32,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:32,716 INFO L485 AbstractCegarLoop]: Abstraction has 161 states and 339 transitions. [2025-04-13 22:28:32,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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-13 22:28:32,716 INFO L278 IsEmpty]: Start isEmpty. Operand 161 states and 339 transitions. [2025-04-13 22:28:32,716 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:32,716 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:32,716 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:32,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Ended with exit code 0 [2025-04-13 22:28:32,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2025-04-13 22:28:32,917 INFO L403 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:32,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash 864911654, now seen corresponding path program 194 times [2025-04-13 22:28:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:32,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224461737] [2025-04-13 22:28:32,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:28:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:32,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:28:32,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:32,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:28:32,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:28:33,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:33,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224461737] [2025-04-13 22:28:33,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224461737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:33,683 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104682322] [2025-04-13 22:28:33,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:28:33,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:33,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:33,685 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:33,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Waiting until timeout for monitored process [2025-04-13 22:28:34,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:28:34,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:34,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:28:34,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:34,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:28:34,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:34,328 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 138 treesize of output 94 [2025-04-13 22:28:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:34,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:35,006 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:28:35,006 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 315 treesize of output 191 [2025-04-13 22:28:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:35,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104682322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:35,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:35,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 34 [2025-04-13 22:28:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468767720] [2025-04-13 22:28:35,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:35,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:28:35,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:35,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:28:35,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1058, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:28:35,261 INFO L87 Difference]: Start difference. First operand 161 states and 339 transitions. Second operand has 35 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 35 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-13 22:28:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:39,484 INFO L93 Difference]: Finished difference Result 255 states and 498 transitions. [2025-04-13 22:28:39,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:28:39,485 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 35 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) Word has length 22 [2025-04-13 22:28:39,485 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:39,486 INFO L225 Difference]: With dead ends: 255 [2025-04-13 22:28:39,486 INFO L226 Difference]: Without dead ends: 222 [2025-04-13 22:28:39,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=512, Invalid=3520, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:28:39,486 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:39,486 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:28:39,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-04-13 22:28:40,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 155. [2025-04-13 22:28:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.116883116883117) internal successors, (326), 154 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 326 transitions. [2025-04-13 22:28:40,090 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 326 transitions. Word has length 22 [2025-04-13 22:28:40,090 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:40,090 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 326 transitions. [2025-04-13 22:28:40,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 35 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-13 22:28:40,090 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 326 transitions. [2025-04-13 22:28:40,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:40,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:40,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:40,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Ended with exit code 0 [2025-04-13 22:28:40,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 201 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable206 [2025-04-13 22:28:40,291 INFO L403 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:40,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash -934331888, now seen corresponding path program 195 times [2025-04-13 22:28:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:40,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552131207] [2025-04-13 22:28:40,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:28:40,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:40,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:40,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:40,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:28:40,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:28:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:41,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552131207] [2025-04-13 22:28:41,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552131207] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:41,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711553459] [2025-04-13 22:28:41,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:28:41,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:41,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:41,035 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:41,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Waiting until timeout for monitored process [2025-04-13 22:28:41,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:41,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:41,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:28:41,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:41,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:28:41,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:41,563 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 182 treesize of output 118 [2025-04-13 22:28:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:41,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:42,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:28:42,285 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 325 treesize of output 205 [2025-04-13 22:28:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711553459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:42,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 32 [2025-04-13 22:28:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010491657] [2025-04-13 22:28:42,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:42,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:28:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:42,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:28:42,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:28:42,538 INFO L87 Difference]: Start difference. First operand 155 states and 326 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 33 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-13 22:28:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:44,854 INFO L93 Difference]: Finished difference Result 220 states and 433 transitions. [2025-04-13 22:28:44,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:28:44,854 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 33 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) Word has length 22 [2025-04-13 22:28:44,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:44,855 INFO L225 Difference]: With dead ends: 220 [2025-04-13 22:28:44,855 INFO L226 Difference]: Without dead ends: 204 [2025-04-13 22:28:44,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=1458, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:28:44,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:44,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:28:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-04-13 22:28:45,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 149. [2025-04-13 22:28:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 2.1283783783783785) internal successors, (315), 148 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 315 transitions. [2025-04-13 22:28:45,422 INFO L79 Accepts]: Start accepts. Automaton has 149 states and 315 transitions. Word has length 22 [2025-04-13 22:28:45,422 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:45,422 INFO L485 AbstractCegarLoop]: Abstraction has 149 states and 315 transitions. [2025-04-13 22:28:45,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 33 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-13 22:28:45,422 INFO L278 IsEmpty]: Start isEmpty. Operand 149 states and 315 transitions. [2025-04-13 22:28:45,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:45,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:45,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:45,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Ended with exit code 0 [2025-04-13 22:28:45,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,202 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:45,623 INFO L403 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:45,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -131209908, now seen corresponding path program 196 times [2025-04-13 22:28:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:45,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903194138] [2025-04-13 22:28:45,623 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:28:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:45,632 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:28:45,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:45,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:28:45,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:46,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903194138] [2025-04-13 22:28:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903194138] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:46,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392633476] [2025-04-13 22:28:46,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:28:46,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:46,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:46,162 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:46,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Waiting until timeout for monitored process [2025-04-13 22:28:46,489 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:28:46,511 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:46,511 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:28:46,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:46,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:28:46,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:46,703 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 189 treesize of output 105 [2025-04-13 22:28:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:46,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:47,621 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:28:47,621 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 269 treesize of output 179 [2025-04-13 22:28:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:47,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392633476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:47,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-04-13 22:28:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276959616] [2025-04-13 22:28:47,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:47,840 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:28:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:47,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:28:47,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:28:47,840 INFO L87 Difference]: Start difference. First operand 149 states and 315 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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-13 22:28:50,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:50,281 INFO L93 Difference]: Finished difference Result 194 states and 382 transitions. [2025-04-13 22:28:50,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:28:50,282 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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) Word has length 22 [2025-04-13 22:28:50,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:50,283 INFO L225 Difference]: With dead ends: 194 [2025-04-13 22:28:50,283 INFO L226 Difference]: Without dead ends: 187 [2025-04-13 22:28:50,283 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=256, Invalid=1466, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:28:50,283 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:50,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:28:50,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-04-13 22:28:50,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 151. [2025-04-13 22:28:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 2.1333333333333333) internal successors, (320), 150 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 320 transitions. [2025-04-13 22:28:50,866 INFO L79 Accepts]: Start accepts. Automaton has 151 states and 320 transitions. Word has length 22 [2025-04-13 22:28:50,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:50,866 INFO L485 AbstractCegarLoop]: Abstraction has 151 states and 320 transitions. [2025-04-13 22:28:50,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 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-13 22:28:50,866 INFO L278 IsEmpty]: Start isEmpty. Operand 151 states and 320 transitions. [2025-04-13 22:28:50,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:50,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:50,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:50,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Forceful destruction successful, exit code 0 [2025-04-13 22:28:51,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208,203 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:51,067 INFO L403 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:51,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1439392048, now seen corresponding path program 197 times [2025-04-13 22:28:51,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:51,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212022065] [2025-04-13 22:28:51,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:28:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:51,076 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:51,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:51,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:28:51,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:28:51,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212022065] [2025-04-13 22:28:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212022065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:28:51,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493414902] [2025-04-13 22:28:51,706 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:28:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:28:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:28:51,708 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:28:51,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Waiting until timeout for monitored process [2025-04-13 22:28:52,037 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 4 equivalence classes. [2025-04-13 22:28:52,068 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:52,068 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:28:52,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:28:52,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:28:52,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:28:52,313 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 239 treesize of output 131 [2025-04-13 22:28:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:52,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:28:53,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:28:53,264 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 279 treesize of output 180 [2025-04-13 22:28:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:28:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493414902] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:28:53,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:28:53,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-04-13 22:28:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103804052] [2025-04-13 22:28:53,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:28:53,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:28:53,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:28:53,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:28:53,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:28:53,471 INFO L87 Difference]: Start difference. First operand 151 states and 320 transitions. Second operand has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:28:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:28:55,477 INFO L93 Difference]: Finished difference Result 182 states and 366 transitions. [2025-04-13 22:28:55,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:28:55,477 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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) Word has length 22 [2025-04-13 22:28:55,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:28:55,478 INFO L225 Difference]: With dead ends: 182 [2025-04-13 22:28:55,478 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 22:28:55,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:28:55,478 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:28:55,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:28:55,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 22:28:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2025-04-13 22:28:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 2.1298701298701297) internal successors, (328), 154 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:28:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 328 transitions. [2025-04-13 22:28:56,103 INFO L79 Accepts]: Start accepts. Automaton has 155 states and 328 transitions. Word has length 22 [2025-04-13 22:28:56,103 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:28:56,103 INFO L485 AbstractCegarLoop]: Abstraction has 155 states and 328 transitions. [2025-04-13 22:28:56,103 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 31 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-13 22:28:56,103 INFO L278 IsEmpty]: Start isEmpty. Operand 155 states and 328 transitions. [2025-04-13 22:28:56,103 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:28:56,103 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:28:56,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:28:56,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Ended with exit code 0 [2025-04-13 22:28:56,303 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable209 [2025-04-13 22:28:56,303 INFO L403 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:28:56,304 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:28:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -189302358, now seen corresponding path program 198 times [2025-04-13 22:28:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:28:56,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284753683] [2025-04-13 22:28:56,304 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:28:56,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:28:56,313 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:28:56,326 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:28:56,326 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:28:56,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2025-04-13 22:28:56,975 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:28:56,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2025-04-13 22:28:56,976 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-2-3-4-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-3-2-2-1 context. [2025-04-13 22:28:56,977 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:28:56,977 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:28:56,978 INFO L422 BasicCegarLoop]: Path program histogram: [198, 5, 5, 2, 1] [2025-04-13 22:28:56,980 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:28:56,980 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:28:56,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:28:56 BasicIcfg [2025-04-13 22:28:56,981 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:28:56,982 INFO L158 Benchmark]: Toolchain (without parser) took 861356.12ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 101.9MB in the beginning and 494.2MB in the end (delta: -392.3MB). Peak memory consumption was 219.7MB. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.41ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 86.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.23ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 83.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 INFO L158 Benchmark]: Boogie Preprocessor took 27.36ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 INFO L158 Benchmark]: IcfgBuilder took 687.74ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 49.4MB in the end (delta: 32.0MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 INFO L158 Benchmark]: TraceAbstraction took 860356.53ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 49.4MB in the beginning and 494.2MB in the end (delta: -444.8MB). Peak memory consumption was 166.9MB. Max. memory is 8.0GB. [2025-04-13 22:28:56,982 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.21ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.41ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 86.2MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.23ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 83.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.36ms. Allocated memory is still 142.6MB. Free memory was 83.5MB in the beginning and 81.3MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 687.74ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 49.4MB in the end (delta: 32.0MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. * TraceAbstraction took 860356.53ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 49.4MB in the beginning and 494.2MB in the end (delta: -444.8MB). Peak memory consumption was 166.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-2-3-4-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-3-2-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-2-3-4-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-3-2-2-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 23 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-2-3-4-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∧-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 25 locations, 29 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 860.3s, OverallIterations: 211, TraceHistogramMax: 3, PathProgramHistogramMax: 198, EmptinessCheckTime: 0.1s, AutomataDifference: 470.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26600 SdHoareTripleChecker+Valid, 77.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26600 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 66.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5007 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200427 IncrementalHoareTripleChecker+Invalid, 205434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5007 mSolverCounterUnsat, 0 mSDtfsCounter, 200427 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15774 GetRequests, 7023 SyntacticMatches, 3 SemanticMatches, 8748 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94495 ImplicationChecksByTransitivity, 189.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=777occurred in iteration=84, InterpolantAutomatonStates: 5231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 105.7s AutomataMinimizationTime, 210 MinimizatonAttempts, 20807 StatesRemovedByMinimization, 205 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 2.2s SsaConstructionTime, 6.6s SatisfiabilityAnalysisTime, 196.7s InterpolantComputationTime, 8420 NumberOfCodeBlocks, 8398 NumberOfCodeBlocksAsserted, 971 NumberOfCheckSat, 11943 ConstructedInterpolants, 7 QuantifiedInterpolants, 187085 SizeOfPredicates, 4666 NumberOfNonLiveVariables, 45829 ConjunctsInSsa, 6410 ConjunctsInUnsatCore, 615 InterpolantComputations, 12 PerfectInterpolantSequences, 3228/9207 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