/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/array-eq-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:58:41,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:58:41,160 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 21:58:41,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:58:41,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:58:41,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:58:41,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:58:41,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:58:41,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:58:41,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:58:41,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:58:41,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:58:41,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:58:41,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:58:41,189 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:58:41,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:58:41,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:58:41,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:58:41,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:58:41,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:58:41,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:58:41,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:58:41,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:58:41,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:41,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:41,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:58:41,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:58:41,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:58:41,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:58:41,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:58:41,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:58:41,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:58:41,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:58:41,192 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 21:58:41,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:58:41,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:58:41,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:58:41,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:58:41,441 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:58:41,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-04-13 21:58:42,767 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a4b1b63/9e236dbd10414c11b4fc7b0f35c0c80d/FLAG04cd60f54 [2025-04-13 21:58:43,000 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:58:43,001 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/array-eq-symm.wvr.c [2025-04-13 21:58:43,006 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a4b1b63/9e236dbd10414c11b4fc7b0f35c0c80d/FLAG04cd60f54 [2025-04-13 21:58:43,768 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76a4b1b63/9e236dbd10414c11b4fc7b0f35c0c80d [2025-04-13 21:58:43,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:58:43,771 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:58:43,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:58:43,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:58:43,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:58:43,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:43,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fea962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43, skipping insertion in model container [2025-04-13 21:58:43,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:43,794 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:58:43,938 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/array-eq-symm.wvr.c[2277,2290] [2025-04-13 21:58:43,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:58:43,951 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:58:43,973 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/array-eq-symm.wvr.c[2277,2290] [2025-04-13 21:58:43,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:58:43,994 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:58:43,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43 WrapperNode [2025-04-13 21:58:43,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:58:43,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:58:43,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:58:43,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:58:44,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,026 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 99 [2025-04-13 21:58:44,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:58:44,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:58:44,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:58:44,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:58:44,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,054 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 21:58:44,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:58:44,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:58:44,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:58:44,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:58:44,073 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (1/1) ... [2025-04-13 21:58:44,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:58:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:44,098 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 21:58:44,103 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 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:58:44,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:58:44,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:58:44,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:58:44,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 21:58:44,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:58:44,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:58:44,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:58:44,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:58:44,123 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 21:58:44,202 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:58:44,204 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:58:44,439 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:58:44,439 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:58:44,439 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:58:44,628 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:58:44,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:58:44 BoogieIcfgContainer [2025-04-13 21:58:44,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:58:44,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:58:44,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:58:44,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:58:44,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:58:43" (1/3) ... [2025-04-13 21:58:44,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79c42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:58:44, skipping insertion in model container [2025-04-13 21:58:44,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:58:43" (2/3) ... [2025-04-13 21:58:44,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79c42f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:58:44, skipping insertion in model container [2025-04-13 21:58:44,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:58:44" (3/3) ... [2025-04-13 21:58:44,638 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2025-04-13 21:58:44,648 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:58:44,650 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 21:58:44,650 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:58:44,691 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:58:44,712 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 21:58:44,720 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:44,740 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:58:44,750 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;@7f7ee926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:58:44,750 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:58:44,752 INFO L278 IsEmpty]: Start isEmpty. Operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:44,755 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 21:58:44,755 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:44,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:44,755 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 21:58:44,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -683042607, now seen corresponding path program 1 times [2025-04-13 21:58:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:44,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5564972] [2025-04-13 21:58:44,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 21:58:44,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 21:58:44,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:44,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:45,119 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 21:58:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:45,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5564972] [2025-04-13 21:58:45,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5564972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:45,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:45,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 21:58:45,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338515696] [2025-04-13 21:58:45,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:45,125 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:58:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:45,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:58:45,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:58:45,140 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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 21:58:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:45,196 INFO L93 Difference]: Finished difference Result 58 states and 127 transitions. [2025-04-13 21:58:45,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:58:45,199 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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 14 [2025-04-13 21:58:45,200 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:45,205 INFO L225 Difference]: With dead ends: 58 [2025-04-13 21:58:45,206 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 21:58:45,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 21:58:45,211 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:45,211 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 21:58:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-13 21:58:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.269230769230769) internal successors, (118), 52 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 118 transitions. [2025-04-13 21:58:45,239 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 118 transitions. Word has length 14 [2025-04-13 21:58:45,239 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:45,239 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 118 transitions. [2025-04-13 21:58:45,239 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 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 21:58:45,239 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 118 transitions. [2025-04-13 21:58:45,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:58:45,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:45,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:45,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:58:45,240 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 21:58:45,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -837325384, now seen corresponding path program 1 times [2025-04-13 21:58:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:45,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727307404] [2025-04-13 21:58:45,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:45,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:45,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:58:45,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:58:45,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:45,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:45,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727307404] [2025-04-13 21:58:45,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727307404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:45,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:45,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:58:45,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476860483] [2025-04-13 21:58:45,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:45,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:45,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:45,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:45,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:45,426 INFO L87 Difference]: Start difference. First operand 53 states and 118 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 21:58:45,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:45,490 INFO L93 Difference]: Finished difference Result 117 states and 261 transitions. [2025-04-13 21:58:45,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:58:45,490 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 15 [2025-04-13 21:58:45,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:45,491 INFO L225 Difference]: With dead ends: 117 [2025-04-13 21:58:45,491 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 21:58:45,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:45,491 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 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.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:45,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:45,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 21:58:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2025-04-13 21:58:45,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.28) internal successors, (171), 75 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 171 transitions. [2025-04-13 21:58:45,505 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 171 transitions. Word has length 15 [2025-04-13 21:58:45,506 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:45,506 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 171 transitions. [2025-04-13 21:58:45,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 21:58:45,507 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 171 transitions. [2025-04-13 21:58:45,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:58:45,508 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:45,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:45,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:58:45,508 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 21:58:45,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 300482279, now seen corresponding path program 1 times [2025-04-13 21:58:45,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:45,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614672960] [2025-04-13 21:58:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 21:58:45,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:58:45,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:45,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:45,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:45,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614672960] [2025-04-13 21:58:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614672960] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:58:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053537131] [2025-04-13 21:58:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:45,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:58:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:45,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:58:45,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:45,630 INFO L87 Difference]: Start difference. First operand 76 states and 171 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 21:58:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:45,712 INFO L93 Difference]: Finished difference Result 92 states and 195 transitions. [2025-04-13 21:58:45,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:58:45,712 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 15 [2025-04-13 21:58:45,713 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:45,713 INFO L225 Difference]: With dead ends: 92 [2025-04-13 21:58:45,713 INFO L226 Difference]: Without dead ends: 54 [2025-04-13 21:58:45,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:58:45,714 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 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.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:45,714 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-04-13 21:58:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-04-13 21:58:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.2452830188679247) internal successors, (119), 53 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 119 transitions. [2025-04-13 21:58:45,720 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 119 transitions. Word has length 15 [2025-04-13 21:58:45,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:45,721 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 119 transitions. [2025-04-13 21:58:45,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 21:58:45,721 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 119 transitions. [2025-04-13 21:58:45,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 21:58:45,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:45,721 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:45,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:58:45,721 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 21:58:45,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1930132860, now seen corresponding path program 1 times [2025-04-13 21:58:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:45,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802000403] [2025-04-13 21:58:45,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:45,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:58:45,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:58:45,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:58:45,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:45,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802000403] [2025-04-13 21:58:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802000403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:45,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:45,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:58:45,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916076428] [2025-04-13 21:58:45,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:45,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:58:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:45,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:58:45,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:45,836 INFO L87 Difference]: Start difference. First operand 54 states and 119 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:45,911 INFO L93 Difference]: Finished difference Result 129 states and 286 transitions. [2025-04-13 21:58:45,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:45,912 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 21:58:45,912 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:45,913 INFO L225 Difference]: With dead ends: 129 [2025-04-13 21:58:45,913 INFO L226 Difference]: Without dead ends: 104 [2025-04-13 21:58:45,913 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:45,913 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:45,914 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 7 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:45,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-13 21:58:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2025-04-13 21:58:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 2.2666666666666666) internal successors, (170), 75 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 170 transitions. [2025-04-13 21:58:45,928 INFO L79 Accepts]: Start accepts. Automaton has 76 states and 170 transitions. Word has length 16 [2025-04-13 21:58:45,928 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:45,928 INFO L485 AbstractCegarLoop]: Abstraction has 76 states and 170 transitions. [2025-04-13 21:58:45,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:45,928 INFO L278 IsEmpty]: Start isEmpty. Operand 76 states and 170 transitions. [2025-04-13 21:58:45,928 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 21:58:45,928 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:45,928 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:45,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:58:45,929 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 21:58:45,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:45,929 INFO L85 PathProgramCache]: Analyzing trace with hash -792325197, now seen corresponding path program 1 times [2025-04-13 21:58:45,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:45,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040647502] [2025-04-13 21:58:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:45,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:45,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 21:58:45,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 21:58:45,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:45,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 21:58:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:46,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040647502] [2025-04-13 21:58:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040647502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:58:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:58:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:58:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129468325] [2025-04-13 21:58:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:46,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:58:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:46,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:58:46,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:58:46,023 INFO L87 Difference]: Start difference. First operand 76 states and 170 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:46,082 INFO L93 Difference]: Finished difference Result 92 states and 194 transitions. [2025-04-13 21:58:46,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:58:46,083 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 21:58:46,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:46,084 INFO L225 Difference]: With dead ends: 92 [2025-04-13 21:58:46,084 INFO L226 Difference]: Without dead ends: 55 [2025-04-13 21:58:46,085 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:58:46,085 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:46,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:58:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-13 21:58:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-13 21:58:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.2222222222222223) internal successors, (120), 54 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 21:58:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 120 transitions. [2025-04-13 21:58:46,089 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 120 transitions. Word has length 16 [2025-04-13 21:58:46,089 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:46,089 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 120 transitions. [2025-04-13 21:58:46,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:46,090 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 120 transitions. [2025-04-13 21:58:46,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:58:46,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:46,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:46,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:58:46,090 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 21:58:46,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash -445433064, now seen corresponding path program 1 times [2025-04-13 21:58:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:46,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594906075] [2025-04-13 21:58:46,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:46,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:58:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:46,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594906075] [2025-04-13 21:58:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594906075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:46,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345005979] [2025-04-13 21:58:46,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:46,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:46,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:46,609 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 21:58:46,610 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 21:58:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:58:46,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:46,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:46,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:46,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 21:58:46,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:46,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:47,025 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:58:47,026 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:58:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345005979] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:47,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:47,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 21:58:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873287783] [2025-04-13 21:58:47,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:47,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:58:47,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:47,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:58:47,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:58:47,198 INFO L87 Difference]: Start difference. First operand 55 states and 120 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 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 21:58:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:47,389 INFO L93 Difference]: Finished difference Result 74 states and 155 transitions. [2025-04-13 21:58:47,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:58:47,390 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 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 17 [2025-04-13 21:58:47,390 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:47,390 INFO L225 Difference]: With dead ends: 74 [2025-04-13 21:58:47,390 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 21:58:47,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:58:47,391 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 18 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:47,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 27 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 21:58:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2025-04-13 21:58:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.3529411764705883) internal successors, (120), 51 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 21:58:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 120 transitions. [2025-04-13 21:58:47,396 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 120 transitions. Word has length 17 [2025-04-13 21:58:47,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:47,397 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 120 transitions. [2025-04-13 21:58:47,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 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 21:58:47,397 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 120 transitions. [2025-04-13 21:58:47,397 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:58:47,397 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:47,397 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:47,404 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 21:58:47,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 21:58:47,598 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 21:58:47,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 692374599, now seen corresponding path program 1 times [2025-04-13 21:58:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:47,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277069239] [2025-04-13 21:58:47,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:47,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:58:47,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:47,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:47,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:48,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:48,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277069239] [2025-04-13 21:58:48,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277069239] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:48,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751880222] [2025-04-13 21:58:48,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:48,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:48,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:48,027 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 21:58:48,028 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 21:58:48,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:58:48,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:48,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:48,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:48,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 21:58:48,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:48,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:48,296 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:58:48,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:58:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751880222] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:48,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 21:58:48,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 17 [2025-04-13 21:58:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739569414] [2025-04-13 21:58:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:58:48,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:58:48,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:48,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:58:48,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:58:48,440 INFO L87 Difference]: Start difference. First operand 52 states and 120 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:48,556 INFO L93 Difference]: Finished difference Result 70 states and 149 transitions. [2025-04-13 21:58:48,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:58:48,556 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 21:58:48,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:48,557 INFO L225 Difference]: With dead ends: 70 [2025-04-13 21:58:48,557 INFO L226 Difference]: Without dead ends: 48 [2025-04-13 21:58:48,558 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:58:48,558 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:48,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-13 21:58:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-04-13 21:58:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.2127659574468086) internal successors, (104), 47 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 104 transitions. [2025-04-13 21:58:48,568 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 104 transitions. Word has length 17 [2025-04-13 21:58:48,569 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:48,569 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 104 transitions. [2025-04-13 21:58:48,569 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:48,569 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 104 transitions. [2025-04-13 21:58:48,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:58:48,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:48,569 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:48,576 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 21:58:48,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 21:58:48,770 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 21:58:48,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1381267449, now seen corresponding path program 2 times [2025-04-13 21:58:48,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:48,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697740509] [2025-04-13 21:58:48,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:48,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:48,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:58:48,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:48,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:48,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:49,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:49,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697740509] [2025-04-13 21:58:49,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697740509] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:49,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587246186] [2025-04-13 21:58:49,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:49,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:49,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:49,180 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 21:58:49,181 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 21:58:49,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 21:58:49,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:58:49,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:49,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:49,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 21:58:49,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:49,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:49,494 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:58:49,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:58:49,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587246186] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:49,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 15 [2025-04-13 21:58:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188093123] [2025-04-13 21:58:49,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:49,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 21:58:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:49,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 21:58:49,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:58:49,690 INFO L87 Difference]: Start difference. First operand 48 states and 104 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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 21:58:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:49,811 INFO L93 Difference]: Finished difference Result 60 states and 130 transitions. [2025-04-13 21:58:49,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 21:58:49,812 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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 17 [2025-04-13 21:58:49,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:49,812 INFO L225 Difference]: With dead ends: 60 [2025-04-13 21:58:49,812 INFO L226 Difference]: Without dead ends: 52 [2025-04-13 21:58:49,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:58:49,813 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:49,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-13 21:58:49,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-13 21:58:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 2.235294117647059) internal successors, (114), 51 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 114 transitions. [2025-04-13 21:58:49,819 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 114 transitions. Word has length 17 [2025-04-13 21:58:49,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:49,819 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 114 transitions. [2025-04-13 21:58:49,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 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 21:58:49,819 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 114 transitions. [2025-04-13 21:58:49,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:58:49,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:49,820 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:49,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:58:50,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:50,025 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 21:58:50,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:50,025 INFO L85 PathProgramCache]: Analyzing trace with hash -923556480, now seen corresponding path program 1 times [2025-04-13 21:58:50,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:50,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885705617] [2025-04-13 21:58:50,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:50,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:58:50,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:58:50,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:50,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:50,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:50,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885705617] [2025-04-13 21:58:50,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885705617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:50,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595387388] [2025-04-13 21:58:50,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:58:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:50,092 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 21:58:50,093 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 21:58:50,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:58:50,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:58:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:50,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:58:50,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:50,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595387388] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:50,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2025-04-13 21:58:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523399523] [2025-04-13 21:58:50,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:50,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:58:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:50,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:58:50,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:58:50,200 INFO L87 Difference]: Start difference. First operand 52 states and 114 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 21:58:50,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:50,279 INFO L93 Difference]: Finished difference Result 101 states and 224 transitions. [2025-04-13 21:58:50,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:58:50,279 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 18 [2025-04-13 21:58:50,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:50,280 INFO L225 Difference]: With dead ends: 101 [2025-04-13 21:58:50,280 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 21:58:50,280 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:58:50,281 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:50,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 10 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 21:58:50,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2025-04-13 21:58:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.388888888888889) internal successors, (172), 72 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 172 transitions. [2025-04-13 21:58:50,291 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 172 transitions. Word has length 18 [2025-04-13 21:58:50,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:50,293 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 172 transitions. [2025-04-13 21:58:50,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 21:58:50,293 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 172 transitions. [2025-04-13 21:58:50,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:58:50,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:50,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:50,299 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 21:58:50,494 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 21:58:50,494 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 21:58:50,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:50,494 INFO L85 PathProgramCache]: Analyzing trace with hash -131571508, now seen corresponding path program 2 times [2025-04-13 21:58:50,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:50,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620748263] [2025-04-13 21:58:50,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:50,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:50,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:58:50,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:58:50,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:50,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:50,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:50,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620748263] [2025-04-13 21:58:50,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620748263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:50,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070832423] [2025-04-13 21:58:50,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:50,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:50,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:50,552 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 21:58:50,554 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 21:58:50,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:58:50,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:58:50,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:50,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:50,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 21:58:50,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:50,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:50,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070832423] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:50,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:50,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2025-04-13 21:58:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618272045] [2025-04-13 21:58:50,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:50,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:58:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:50,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:58:50,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:58:50,668 INFO L87 Difference]: Start difference. First operand 73 states and 172 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 21:58:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:50,748 INFO L93 Difference]: Finished difference Result 116 states and 270 transitions. [2025-04-13 21:58:50,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:58:50,748 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 18 [2025-04-13 21:58:50,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:50,749 INFO L225 Difference]: With dead ends: 116 [2025-04-13 21:58:50,749 INFO L226 Difference]: Without dead ends: 107 [2025-04-13 21:58:50,749 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:58:50,750 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 11 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:50,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 13 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-13 21:58:50,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2025-04-13 21:58:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.5) internal successors, (215), 86 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 215 transitions. [2025-04-13 21:58:50,757 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 215 transitions. Word has length 18 [2025-04-13 21:58:50,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:50,757 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 215 transitions. [2025-04-13 21:58:50,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 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 21:58:50,757 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 215 transitions. [2025-04-13 21:58:50,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:58:50,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:50,758 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:50,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 21:58:50,958 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 21:58:50,958 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 21:58:50,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 522187623, now seen corresponding path program 3 times [2025-04-13 21:58:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:50,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545611550] [2025-04-13 21:58:50,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:58:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:50,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:58:50,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:58:50,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:58:50,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:51,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545611550] [2025-04-13 21:58:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545611550] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:51,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990344145] [2025-04-13 21:58:51,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:58:51,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:51,047 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 21:58:51,048 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 21:58:51,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:58:51,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:58:51,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:58:51,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 21:58:51,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:51,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:51,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990344145] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:51,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:51,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-04-13 21:58:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851034251] [2025-04-13 21:58:51,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:51,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:58:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:51,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:58:51,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:58:51,243 INFO L87 Difference]: Start difference. First operand 87 states and 215 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 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 21:58:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:51,424 INFO L93 Difference]: Finished difference Result 337 states and 835 transitions. [2025-04-13 21:58:51,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:58:51,424 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 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 21:58:51,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:51,426 INFO L225 Difference]: With dead ends: 337 [2025-04-13 21:58:51,426 INFO L226 Difference]: Without dead ends: 278 [2025-04-13 21:58:51,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-04-13 21:58:51,426 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 82 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:51,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 31 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-04-13 21:58:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 128. [2025-04-13 21:58:51,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.440944881889764) internal successors, (310), 127 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 310 transitions. [2025-04-13 21:58:51,445 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 310 transitions. Word has length 19 [2025-04-13 21:58:51,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:51,445 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 310 transitions. [2025-04-13 21:58:51,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 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 21:58:51,445 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 310 transitions. [2025-04-13 21:58:51,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:58:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:51,446 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:51,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:58:51,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:51,650 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 21:58:51,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1434486808, now seen corresponding path program 4 times [2025-04-13 21:58:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:51,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124717372] [2025-04-13 21:58:51,651 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:58:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:51,656 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:58:51,664 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 21:58:51,665 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:58:51,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:51,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:51,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124717372] [2025-04-13 21:58:51,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124717372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:51,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553071442] [2025-04-13 21:58:51,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:58:51,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:51,716 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 21:58:51,718 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 21:58:51,757 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:58:51,774 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 21:58:51,774 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:58:51,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:51,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 21:58:51,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:51,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:58:51,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553071442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:51,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:51,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 21:58:51,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698588758] [2025-04-13 21:58:51,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:51,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:58:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:51,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:58:51,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:58:51,882 INFO L87 Difference]: Start difference. First operand 128 states and 310 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 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 21:58:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:51,977 INFO L93 Difference]: Finished difference Result 184 states and 427 transitions. [2025-04-13 21:58:51,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:58:51,977 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 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 21:58:51,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:51,980 INFO L225 Difference]: With dead ends: 184 [2025-04-13 21:58:51,980 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 21:58:51,980 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:58:51,981 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:51,981 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 21:58:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-13 21:58:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.448) internal successors, (306), 125 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 21:58:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 306 transitions. [2025-04-13 21:58:51,996 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 306 transitions. Word has length 19 [2025-04-13 21:58:51,996 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:51,996 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 306 transitions. [2025-04-13 21:58:51,996 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 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 21:58:51,996 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 306 transitions. [2025-04-13 21:58:51,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 21:58:51,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:51,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:52,003 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 21:58:52,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:52,201 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 21:58:52,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:52,201 INFO L85 PathProgramCache]: Analyzing trace with hash -2098309404, now seen corresponding path program 5 times [2025-04-13 21:58:52,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:52,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085054410] [2025-04-13 21:58:52,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:58:52,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:52,207 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:58:52,213 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:52,213 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 21:58:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:52,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085054410] [2025-04-13 21:58:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085054410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:52,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893359305] [2025-04-13 21:58:52,261 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:58:52,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:52,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:52,263 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 21:58:52,264 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 21:58:52,303 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:58:52,320 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:58:52,321 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:52,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 21:58:52,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 21:58:52,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 21:58:52,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893359305] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:52,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 21:58:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053907487] [2025-04-13 21:58:52,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:52,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:58:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:52,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:58:52,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:58:52,431 INFO L87 Difference]: Start difference. First operand 126 states and 306 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 21:58:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:52,503 INFO L93 Difference]: Finished difference Result 145 states and 335 transitions. [2025-04-13 21:58:52,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 21:58:52,504 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 21:58:52,504 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:52,505 INFO L225 Difference]: With dead ends: 145 [2025-04-13 21:58:52,505 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 21:58:52,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:58:52,505 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:52,505 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 14 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 21:58:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-04-13 21:58:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.465909090909091) internal successors, (217), 88 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 217 transitions. [2025-04-13 21:58:52,525 INFO L79 Accepts]: Start accepts. Automaton has 89 states and 217 transitions. Word has length 20 [2025-04-13 21:58:52,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:52,525 INFO L485 AbstractCegarLoop]: Abstraction has 89 states and 217 transitions. [2025-04-13 21:58:52,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 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 21:58:52,525 INFO L278 IsEmpty]: Start isEmpty. Operand 89 states and 217 transitions. [2025-04-13 21:58:52,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:58:52,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:52,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:52,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 21:58:52,729 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,SelfDestructingSolverStorable12 [2025-04-13 21:58:52,729 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 21:58:52,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -501904121, now seen corresponding path program 6 times [2025-04-13 21:58:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:52,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490670601] [2025-04-13 21:58:52,730 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:58:52,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:52,736 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:52,754 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:52,754 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:58:52,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:53,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490670601] [2025-04-13 21:58:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490670601] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:53,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818014761] [2025-04-13 21:58:53,164 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:58:53,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:53,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:53,167 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 21:58:53,168 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 21:58:53,210 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:53,227 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:53,228 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:58:53,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:53,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 21:58:53,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:53,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:53,649 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 21:58:53,650 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 21:58:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818014761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:53,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-04-13 21:58:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790523745] [2025-04-13 21:58:53,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:53,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:58:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:53,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:58:53,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:58:53,886 INFO L87 Difference]: Start difference. First operand 89 states and 217 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 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 21:58:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:54,150 INFO L93 Difference]: Finished difference Result 104 states and 248 transitions. [2025-04-13 21:58:54,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:58:54,151 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 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 21 [2025-04-13 21:58:54,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:54,151 INFO L225 Difference]: With dead ends: 104 [2025-04-13 21:58:54,151 INFO L226 Difference]: Without dead ends: 97 [2025-04-13 21:58:54,153 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 21:58:54,153 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:54,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 36 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:58:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-13 21:58:54,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-04-13 21:58:54,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.552941176470588) internal successors, (217), 85 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:54,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 217 transitions. [2025-04-13 21:58:54,161 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 217 transitions. Word has length 21 [2025-04-13 21:58:54,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:54,162 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 217 transitions. [2025-04-13 21:58:54,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 28 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 21:58:54,162 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 217 transitions. [2025-04-13 21:58:54,163 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:58:54,163 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:54,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:54,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 21:58:54,367 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,SelfDestructingSolverStorable13 [2025-04-13 21:58:54,367 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 21:58:54,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:54,367 INFO L85 PathProgramCache]: Analyzing trace with hash 410395064, now seen corresponding path program 7 times [2025-04-13 21:58:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:54,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150313160] [2025-04-13 21:58:54,368 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:58:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:54,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:58:54,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:54,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:54,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:54,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:54,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150313160] [2025-04-13 21:58:54,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150313160] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:54,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073201266] [2025-04-13 21:58:54,799 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:58:54,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:54,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:54,801 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 21:58:54,803 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 21:58:54,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:58:54,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:54,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:58:54,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:54,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 21:58:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:55,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:55,130 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 21:58:55,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 21:58:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:55,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073201266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:55,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:55,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-04-13 21:58:55,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384056136] [2025-04-13 21:58:55,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:55,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 21:58:55,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:55,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 21:58:55,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2025-04-13 21:58:55,340 INFO L87 Difference]: Start difference. First operand 86 states and 217 transitions. Second operand has 30 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:55,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:55,607 INFO L93 Difference]: Finished difference Result 105 states and 246 transitions. [2025-04-13 21:58:55,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:58:55,607 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 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 21:58:55,608 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:55,608 INFO L225 Difference]: With dead ends: 105 [2025-04-13 21:58:55,608 INFO L226 Difference]: Without dead ends: 86 [2025-04-13 21:58:55,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 21:58:55,609 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:55,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 51 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:58:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-13 21:58:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-13 21:58:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.4823529411764707) internal successors, (211), 85 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 211 transitions. [2025-04-13 21:58:55,616 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 211 transitions. Word has length 21 [2025-04-13 21:58:55,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:55,616 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 211 transitions. [2025-04-13 21:58:55,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:55,616 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 211 transitions. [2025-04-13 21:58:55,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:58:55,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:55,616 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:55,622 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 21:58:55,817 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,SelfDestructingSolverStorable14 [2025-04-13 21:58:55,817 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 21:58:55,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 265145784, now seen corresponding path program 8 times [2025-04-13 21:58:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:55,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042635374] [2025-04-13 21:58:55,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:55,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:55,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:55,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:55,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:56,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042635374] [2025-04-13 21:58:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042635374] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:56,163 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940280926] [2025-04-13 21:58:56,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:58:56,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:56,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:56,165 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 21:58:56,168 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 21:58:56,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:56,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:56,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:56,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:56,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 21:58:56,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:56,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:56,578 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:58:56,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:58:56,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940280926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:56,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-04-13 21:58:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674504598] [2025-04-13 21:58:56,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:56,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:58:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:58:56,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:58:56,795 INFO L87 Difference]: Start difference. First operand 86 states and 211 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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 21:58:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:57,104 INFO L93 Difference]: Finished difference Result 115 states and 269 transitions. [2025-04-13 21:58:57,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:58:57,104 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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 21 [2025-04-13 21:58:57,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:57,105 INFO L225 Difference]: With dead ends: 115 [2025-04-13 21:58:57,105 INFO L226 Difference]: Without dead ends: 107 [2025-04-13 21:58:57,105 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 21:58:57,105 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:57,106 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:58:57,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-13 21:58:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2025-04-13 21:58:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.528735632183908) internal successors, (220), 87 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 21:58:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 220 transitions. [2025-04-13 21:58:57,113 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 220 transitions. Word has length 21 [2025-04-13 21:58:57,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:57,114 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 220 transitions. [2025-04-13 21:58:57,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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 21:58:57,114 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 220 transitions. [2025-04-13 21:58:57,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:58:57,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:57,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:57,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 21:58:57,314 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,SelfDestructingSolverStorable15 [2025-04-13 21:58:57,315 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 21:58:57,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:57,315 INFO L85 PathProgramCache]: Analyzing trace with hash 290080851, now seen corresponding path program 9 times [2025-04-13 21:58:57,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:57,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838627680] [2025-04-13 21:58:57,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:58:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:57,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:57,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:57,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:58:57,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:57,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838627680] [2025-04-13 21:58:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838627680] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:57,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588512158] [2025-04-13 21:58:57,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:58:57,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:57,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:57,632 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 21:58:57,633 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 21:58:57,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:57,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:57,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:58:57,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:57,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 21:58:57,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:58:57,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:57,927 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:58:57,928 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:58:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 21:58:58,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588512158] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:58,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:58,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 25 [2025-04-13 21:58:58,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17815796] [2025-04-13 21:58:58,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:58,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 21:58:58,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:58,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 21:58:58,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:58:58,071 INFO L87 Difference]: Start difference. First operand 88 states and 220 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 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 21:58:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:58,272 INFO L93 Difference]: Finished difference Result 103 states and 245 transitions. [2025-04-13 21:58:58,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:58:58,272 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 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 21 [2025-04-13 21:58:58,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:58,273 INFO L225 Difference]: With dead ends: 103 [2025-04-13 21:58:58,273 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 21:58:58,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2025-04-13 21:58:58,274 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:58,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 25 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 21:58:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-13 21:58:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.4827586206896552) internal successors, (216), 87 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 216 transitions. [2025-04-13 21:58:58,284 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 216 transitions. Word has length 21 [2025-04-13 21:58:58,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:58,284 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 216 transitions. [2025-04-13 21:58:58,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 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 21:58:58,284 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 216 transitions. [2025-04-13 21:58:58,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:58:58,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:58,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:58,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 21:58:58,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 21:58:58,485 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 21:58:58,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 179258331, now seen corresponding path program 10 times [2025-04-13 21:58:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:58,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400983386] [2025-04-13 21:58:58,486 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:58:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:58,492 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:58,500 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 21:58:58,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:58:58,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:58,658 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 21:58:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:58,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400983386] [2025-04-13 21:58:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400983386] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:58,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088593626] [2025-04-13 21:58:58,659 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:58:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:58,660 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 21:58:58,662 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 21:58:58,710 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:58,730 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 21:58:58,730 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:58:58,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:58,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 21:58:58,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:58,860 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 21:58:58,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:58,900 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 21:58:58,900 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 21:58:58,937 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 21:58:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088593626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:58,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 4] total 14 [2025-04-13 21:58:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600462546] [2025-04-13 21:58:58,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:58,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 21:58:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:58,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 21:58:58,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:58:58,938 INFO L87 Difference]: Start difference. First operand 88 states and 216 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 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 21:58:59,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:58:59,073 INFO L93 Difference]: Finished difference Result 129 states and 302 transitions. [2025-04-13 21:58:59,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:58:59,074 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 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 21:58:59,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:58:59,074 INFO L225 Difference]: With dead ends: 129 [2025-04-13 21:58:59,074 INFO L226 Difference]: Without dead ends: 122 [2025-04-13 21:58:59,075 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:58:59,075 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 55 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:58:59,075 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 21 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:58:59,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-13 21:58:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 85. [2025-04-13 21:58:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 2.4523809523809526) internal successors, (206), 84 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:58:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 206 transitions. [2025-04-13 21:58:59,084 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 206 transitions. Word has length 21 [2025-04-13 21:58:59,084 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:58:59,084 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 206 transitions. [2025-04-13 21:58:59,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 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 21:58:59,084 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 206 transitions. [2025-04-13 21:58:59,084 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:58:59,084 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:58:59,084 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:58:59,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 21:58:59,287 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,SelfDestructingSolverStorable17 [2025-04-13 21:58:59,287 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 21:58:59,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:58:59,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1582017740, now seen corresponding path program 11 times [2025-04-13 21:58:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:58:59,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710056098] [2025-04-13 21:58:59,287 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:58:59,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:58:59,292 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:59,297 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:59,297 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:59,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:58:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:58:59,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710056098] [2025-04-13 21:58:59,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710056098] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:58:59,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268964164] [2025-04-13 21:58:59,594 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:58:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:58:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:58:59,596 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 21:58:59,596 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 21:58:59,635 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:58:59,652 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:58:59,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:58:59,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:58:59,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 21:58:59,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:58:59,776 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 21:58:59,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:58:59,827 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 21:58:59,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 21:58:59,871 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 21:58:59,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268964164] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:58:59,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:58:59,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 5] total 17 [2025-04-13 21:58:59,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298248133] [2025-04-13 21:58:59,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:58:59,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 21:58:59,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:58:59,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 21:58:59,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-04-13 21:58:59,872 INFO L87 Difference]: Start difference. First operand 85 states and 206 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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 21:59:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:00,256 INFO L93 Difference]: Finished difference Result 130 states and 302 transitions. [2025-04-13 21:59:00,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:59:00,256 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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 21 [2025-04-13 21:59:00,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:00,257 INFO L225 Difference]: With dead ends: 130 [2025-04-13 21:59:00,257 INFO L226 Difference]: Without dead ends: 122 [2025-04-13 21:59:00,258 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:59:00,258 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 62 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:00,258 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 42 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-04-13 21:59:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 81. [2025-04-13 21:59:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.45) internal successors, (196), 80 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 196 transitions. [2025-04-13 21:59:00,274 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 196 transitions. Word has length 21 [2025-04-13 21:59:00,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:00,275 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 196 transitions. [2025-04-13 21:59:00,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 17 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 21:59:00,275 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 196 transitions. [2025-04-13 21:59:00,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:59:00,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:00,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:00,281 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 21:59:00,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:00,476 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 21:59:00,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash -809030663, now seen corresponding path program 12 times [2025-04-13 21:59:00,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:00,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598591606] [2025-04-13 21:59:00,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:00,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:00,483 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:59:00,492 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:59:00,492 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:59:00,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:00,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:00,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:00,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598591606] [2025-04-13 21:59:00,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598591606] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:00,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145399352] [2025-04-13 21:59:00,782 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:00,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:00,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:00,784 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 21:59:00,785 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 21:59:00,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:59:00,840 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:59:00,840 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:59:00,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:00,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 21:59:00,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:00,886 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 21:59:00,926 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 8 treesize of output 1 [2025-04-13 21:59:00,958 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 21:59:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:01,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:01,333 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-13 21:59:01,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-13 21:59:01,370 INFO L325 Elim1Store]: treesize reduction 15, result has 65.1 percent of original size [2025-04-13 21:59:01,370 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 70 [2025-04-13 21:59:01,414 INFO L325 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2025-04-13 21:59:01,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 125 [2025-04-13 21:59:01,650 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~i_BA~0 4)) (.cse15 (* c_~i_AB~0 4)) (.cse2 (= c_~i_AB~0 0))) (let ((.cse3 (not .cse2)) (.cse4 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (+ 4 .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ 4 .cse15)) (.cse6 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse14 4))) (and (or (< c_~i_BA~0 1) (and (or (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_2 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_2 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0) (select v_arrayElimArr_2 .cse1)))) .cse2) (or .cse3 (forall ((v_arrayElimArr_2 (Array Int Int)) (v_subst_1 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_1 v_arrayElimArr_2) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select v_arrayElimArr_2 4))))))) (or (and (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_6 Int)) (let ((.cse5 (select (store |c_#memory_int#1| v_subst_6 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse5 .cse6) (select v_arrayElimArr_3 .cse7)) (not (= (select .cse5 .cse4) (select v_arrayElimArr_3 4)))))) (forall ((v_arrayElimArr_3 (Array Int Int)) (v_subst_5 Int)) (let ((.cse10 (select (store |c_#memory_int#1| v_subst_5 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse9 (select v_arrayElimArr_3 4)) (.cse8 (select .cse10 .cse6))) (or (= .cse8 .cse9) (not (= (select .cse10 .cse4) .cse9)) (= (select v_arrayElimArr_3 .cse7) .cse8)))))) .cse3) (or (< (+ c_~i_BA~0 1) c_~An~0) (and (or .cse2 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_3 Int)) (not (= (select v_arrayElimArr_1 .cse1) (select (select (store |c_#memory_int#1| v_subst_3 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse0))))) (or .cse3 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_subst_4 Int)) (not (= (select v_arrayElimArr_1 4) (select (select (store |c_#memory_int#1| v_subst_4 v_arrayElimArr_1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4))))))) (or (and (forall ((v_subst_7 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int#1| v_subst_7 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse12 .cse6))) (or (= .cse11 (select v_arrayElimArr_3 4)) (not (= (select .cse12 .cse0) (select v_arrayElimArr_3 .cse1))) (= (select v_arrayElimArr_3 .cse7) .cse11))))) (or (forall ((v_subst_8 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int#1| v_subst_8 v_arrayElimArr_3) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 .cse0) (select v_arrayElimArr_3 .cse1))) (= (select .cse13 .cse6) (select v_arrayElimArr_3 .cse7))))) (= c_~i_BA~0 0))) .cse2)))) is different from false [2025-04-13 21:59:01,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:01,687 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 21:59:01,691 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 46 treesize of output 37 [2025-04-13 21:59:01,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:01,698 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 21:59:01,701 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 32 treesize of output 26 [2025-04-13 21:59:01,706 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 21:59:01,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 4 [2025-04-13 21:59:01,713 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:01,714 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-04-13 21:59:01,721 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:59:01,721 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 111 treesize of output 90 [2025-04-13 21:59:01,726 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 21:59:01,757 INFO L325 Elim1Store]: treesize reduction 8, result has 83.0 percent of original size [2025-04-13 21:59:01,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 87 [2025-04-13 21:59:01,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:01,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 21:59:01,813 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:59:01,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2025-04-13 21:59:01,816 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 21:59:01,817 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 21:59:01,866 INFO L325 Elim1Store]: treesize reduction 8, result has 90.6 percent of original size [2025-04-13 21:59:01,866 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 125 [2025-04-13 21:59:01,971 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 21:59:01,971 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-04-13 21:59:01,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:01,980 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 21:59:01,982 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 46 treesize of output 37 [2025-04-13 21:59:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-13 21:59:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145399352] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:02,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:02,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 21:59:02,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116038217] [2025-04-13 21:59:02,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:02,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:59:02,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:02,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:59:02,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=598, Unknown=2, NotChecked=50, Total=756 [2025-04-13 21:59:02,050 INFO L87 Difference]: Start difference. First operand 81 states and 196 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) 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 21:59:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:02,359 INFO L93 Difference]: Finished difference Result 96 states and 221 transitions. [2025-04-13 21:59:02,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:59:02,359 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) 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 21:59:02,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:02,360 INFO L225 Difference]: With dead ends: 96 [2025-04-13 21:59:02,360 INFO L226 Difference]: Without dead ends: 83 [2025-04-13 21:59:02,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=851, Unknown=2, NotChecked=60, Total=1056 [2025-04-13 21:59:02,360 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:02,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 60 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 350 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2025-04-13 21:59:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-13 21:59:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-04-13 21:59:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 2.426829268292683) internal successors, (199), 82 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 199 transitions. [2025-04-13 21:59:02,370 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 199 transitions. Word has length 21 [2025-04-13 21:59:02,370 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:02,370 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 199 transitions. [2025-04-13 21:59:02,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) 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 21:59:02,371 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 199 transitions. [2025-04-13 21:59:02,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:59:02,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:02,371 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:02,377 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 21:59:02,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:02,572 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 21:59:02,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash 50438513, now seen corresponding path program 13 times [2025-04-13 21:59:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:02,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054719733] [2025-04-13 21:59:02,572 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:02,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:02,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:59:02,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:59:02,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:02,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:02,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054719733] [2025-04-13 21:59:02,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054719733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:02,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204563804] [2025-04-13 21:59:02,906 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:02,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:02,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:02,908 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 21:59:02,909 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 21:59:02,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 21:59:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:59:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:02,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 21:59:02,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:03,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:03,228 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:03,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204563804] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:03,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2025-04-13 21:59:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089369469] [2025-04-13 21:59:03,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:03,467 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 21:59:03,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 21:59:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2025-04-13 21:59:03,467 INFO L87 Difference]: Start difference. First operand 83 states and 199 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 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 21:59:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:03,696 INFO L93 Difference]: Finished difference Result 100 states and 233 transitions. [2025-04-13 21:59:03,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:59:03,697 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 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 21 [2025-04-13 21:59:03,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:03,697 INFO L225 Difference]: With dead ends: 100 [2025-04-13 21:59:03,697 INFO L226 Difference]: Without dead ends: 85 [2025-04-13 21:59:03,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 21:59:03,698 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:03,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 43 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-13 21:59:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-04-13 21:59:03,708 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 21:59:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 204 transitions. [2025-04-13 21:59:03,708 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 204 transitions. Word has length 21 [2025-04-13 21:59:03,708 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:03,708 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 204 transitions. [2025-04-13 21:59:03,708 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 29 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 21:59:03,708 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 204 transitions. [2025-04-13 21:59:03,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:59:03,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:03,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:03,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 21:59:03,909 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:03,909 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 21:59:03,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:03,910 INFO L85 PathProgramCache]: Analyzing trace with hash -60384007, now seen corresponding path program 14 times [2025-04-13 21:59:03,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:03,910 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863166584] [2025-04-13 21:59:03,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:03,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:03,914 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:59:03,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:59:03,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:04,197 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 21:59:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:04,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863166584] [2025-04-13 21:59:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863166584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:04,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000004641] [2025-04-13 21:59:04,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:04,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:04,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:04,200 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 21:59:04,201 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 21:59:04,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 21:59:04,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:59:04,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:04,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:04,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 21:59:04,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:04,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:04,555 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:04,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:04,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000004641] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:04,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:04,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 27 [2025-04-13 21:59:04,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795427487] [2025-04-13 21:59:04,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:04,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:59:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:04,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:59:04,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:59:04,759 INFO L87 Difference]: Start difference. First operand 85 states and 204 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) 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 21:59:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:04,957 INFO L93 Difference]: Finished difference Result 100 states and 235 transitions. [2025-04-13 21:59:04,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:59:04,958 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) 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 21:59:04,958 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:04,958 INFO L225 Difference]: With dead ends: 100 [2025-04-13 21:59:04,958 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 21:59:04,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2025-04-13 21:59:04,960 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:04,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 21:59:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2025-04-13 21:59:04,969 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 21:59:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 204 transitions. [2025-04-13 21:59:04,970 INFO L79 Accepts]: Start accepts. Automaton has 85 states and 204 transitions. Word has length 21 [2025-04-13 21:59:04,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:04,970 INFO L485 AbstractCegarLoop]: Abstraction has 85 states and 204 transitions. [2025-04-13 21:59:04,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) 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 21:59:04,970 INFO L278 IsEmpty]: Start isEmpty. Operand 85 states and 204 transitions. [2025-04-13 21:59:04,970 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:59:04,970 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:04,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:04,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 21:59:05,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:05,171 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 21:59:05,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1620808049, now seen corresponding path program 15 times [2025-04-13 21:59:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:05,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178091858] [2025-04-13 21:59:05,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:05,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 21:59:05,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:59:05,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:59:05,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:05,224 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 21:59:05,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:05,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178091858] [2025-04-13 21:59:05,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178091858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:05,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116633496] [2025-04-13 21:59:05,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:05,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:05,226 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 21:59:05,228 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 21:59:05,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 21:59:05,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:59:05,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:59:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:05,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:59:05,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:05,351 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 21:59:05,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:05,372 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 21:59:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116633496] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:05,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:05,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 3] total 8 [2025-04-13 21:59:05,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581310410] [2025-04-13 21:59:05,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:05,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:59:05,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:05,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:59:05,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:59:05,374 INFO L87 Difference]: Start difference. First operand 85 states and 204 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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 21:59:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:05,509 INFO L93 Difference]: Finished difference Result 164 states and 377 transitions. [2025-04-13 21:59:05,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:59:05,509 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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 22 [2025-04-13 21:59:05,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:05,510 INFO L225 Difference]: With dead ends: 164 [2025-04-13 21:59:05,510 INFO L226 Difference]: Without dead ends: 155 [2025-04-13 21:59:05,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:59:05,511 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:05,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 21 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-13 21:59:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 118. [2025-04-13 21:59:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.547008547008547) internal successors, (298), 117 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 298 transitions. [2025-04-13 21:59:05,528 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 298 transitions. Word has length 22 [2025-04-13 21:59:05,529 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:05,529 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 298 transitions. [2025-04-13 21:59:05,529 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 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 21:59:05,529 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 298 transitions. [2025-04-13 21:59:05,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:59:05,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:05,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:05,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 21:59:05,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:05,730 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 21:59:05,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash -371604755, now seen corresponding path program 16 times [2025-04-13 21:59:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:05,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626333996] [2025-04-13 21:59:05,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:05,735 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 21:59:05,740 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 21:59:05,740 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:05,796 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 21:59:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:05,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626333996] [2025-04-13 21:59:05,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626333996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:05,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236136184] [2025-04-13 21:59:05,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:05,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:05,799 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 21:59:05,800 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 21:59:05,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 21:59:05,869 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 21:59:05,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:05,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:05,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:59:05,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:05,934 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 21:59:05,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:05,953 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 21:59:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236136184] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:05,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:05,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 8 [2025-04-13 21:59:05,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325025216] [2025-04-13 21:59:05,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:05,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:59:05,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:05,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:59:05,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:59:05,954 INFO L87 Difference]: Start difference. First operand 118 states and 298 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 21:59:06,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:06,123 INFO L93 Difference]: Finished difference Result 184 states and 440 transitions. [2025-04-13 21:59:06,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:59:06,123 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 22 [2025-04-13 21:59:06,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:06,124 INFO L225 Difference]: With dead ends: 184 [2025-04-13 21:59:06,124 INFO L226 Difference]: Without dead ends: 175 [2025-04-13 21:59:06,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:59:06,125 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:06,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-13 21:59:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 130. [2025-04-13 21:59:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.6666666666666665) internal successors, (344), 129 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 21:59:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 344 transitions. [2025-04-13 21:59:06,143 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 344 transitions. Word has length 22 [2025-04-13 21:59:06,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:06,143 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 344 transitions. [2025-04-13 21:59:06,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 21:59:06,143 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 344 transitions. [2025-04-13 21:59:06,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:59:06,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:06,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:06,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 21:59:06,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:06,344 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 21:59:06,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1799099151, now seen corresponding path program 17 times [2025-04-13 21:59:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:06,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157862056] [2025-04-13 21:59:06,345 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:59:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:06,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 21:59:06,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:59:06,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:06,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:06,387 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 21:59:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:06,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157862056] [2025-04-13 21:59:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157862056] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:06,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753897203] [2025-04-13 21:59:06,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:59:06,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:06,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:06,390 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 21:59:06,391 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 21:59:06,439 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 21:59:06,458 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:59:06,459 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:06,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:06,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:59:06,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:06,517 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 21:59:06,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:06,531 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 21:59:06,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753897203] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:06,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:06,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 3] total 8 [2025-04-13 21:59:06,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977850792] [2025-04-13 21:59:06,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:06,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:59:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:06,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:59:06,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:59:06,532 INFO L87 Difference]: Start difference. First operand 130 states and 344 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 21:59:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:06,666 INFO L93 Difference]: Finished difference Result 208 states and 519 transitions. [2025-04-13 21:59:06,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 21:59:06,666 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 22 [2025-04-13 21:59:06,666 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:06,667 INFO L225 Difference]: With dead ends: 208 [2025-04-13 21:59:06,667 INFO L226 Difference]: Without dead ends: 199 [2025-04-13 21:59:06,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:59:06,668 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:06,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-04-13 21:59:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 152. [2025-04-13 21:59:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.7350993377483444) internal successors, (413), 151 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:06,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 413 transitions. [2025-04-13 21:59:06,689 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 413 transitions. Word has length 22 [2025-04-13 21:59:06,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:06,689 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 413 transitions. [2025-04-13 21:59:06,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 21:59:06,689 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 413 transitions. [2025-04-13 21:59:06,690 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:59:06,690 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:06,690 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:06,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 21:59:06,890 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,SelfDestructingSolverStorable24 [2025-04-13 21:59:06,891 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 21:59:06,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:06,891 INFO L85 PathProgramCache]: Analyzing trace with hash 488904920, now seen corresponding path program 18 times [2025-04-13 21:59:06,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:06,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70838660] [2025-04-13 21:59:06,891 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:06,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:06,896 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-04-13 21:59:06,903 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:59:06,903 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 21:59:06,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:06,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70838660] [2025-04-13 21:59:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70838660] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:06,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40082490] [2025-04-13 21:59:06,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:06,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:06,973 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 21:59:06,973 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 21:59:07,021 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-04-13 21:59:07,040 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:59:07,040 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 21:59:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:07,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:59:07,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:07,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40082490] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:07,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-04-13 21:59:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179066834] [2025-04-13 21:59:07,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:07,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:59:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:07,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:59:07,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:59:07,189 INFO L87 Difference]: Start difference. First operand 152 states and 413 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 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 21:59:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:07,498 INFO L93 Difference]: Finished difference Result 677 states and 1858 transitions. [2025-04-13 21:59:07,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:59:07,498 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 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 23 [2025-04-13 21:59:07,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:07,501 INFO L225 Difference]: With dead ends: 677 [2025-04-13 21:59:07,501 INFO L226 Difference]: Without dead ends: 491 [2025-04-13 21:59:07,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:59:07,502 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 142 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:07,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 44 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-13 21:59:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 220. [2025-04-13 21:59:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 2.598173515981735) internal successors, (569), 219 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 569 transitions. [2025-04-13 21:59:07,540 INFO L79 Accepts]: Start accepts. Automaton has 220 states and 569 transitions. Word has length 23 [2025-04-13 21:59:07,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:07,540 INFO L485 AbstractCegarLoop]: Abstraction has 220 states and 569 transitions. [2025-04-13 21:59:07,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 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 21:59:07,540 INFO L278 IsEmpty]: Start isEmpty. Operand 220 states and 569 transitions. [2025-04-13 21:59:07,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 21:59:07,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:07,540 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:07,548 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 21:59:07,741 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,SelfDestructingSolverStorable25 [2025-04-13 21:59:07,741 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 21:59:07,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1294591417, now seen corresponding path program 19 times [2025-04-13 21:59:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:07,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537157620] [2025-04-13 21:59:07,741 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:07,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:59:07,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:59:07,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:07,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:07,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537157620] [2025-04-13 21:59:07,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537157620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:07,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246717865] [2025-04-13 21:59:07,812 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:07,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:07,814 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 21:59:07,816 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 21:59:07,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 21:59:07,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 21:59:07,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:07,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:07,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 21:59:07,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:07,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:08,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246717865] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:08,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:08,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-04-13 21:59:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856060249] [2025-04-13 21:59:08,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:08,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 21:59:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:08,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 21:59:08,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-04-13 21:59:08,058 INFO L87 Difference]: Start difference. First operand 220 states and 569 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:08,325 INFO L93 Difference]: Finished difference Result 365 states and 865 transitions. [2025-04-13 21:59:08,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 21:59:08,326 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 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 23 [2025-04-13 21:59:08,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:08,327 INFO L225 Difference]: With dead ends: 365 [2025-04-13 21:59:08,327 INFO L226 Difference]: Without dead ends: 154 [2025-04-13 21:59:08,327 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 21:59:08,328 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 68 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:08,328 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 52 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:59:08,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-13 21:59:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-04-13 21:59:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.712418300653595) internal successors, (415), 153 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 415 transitions. [2025-04-13 21:59:08,348 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 415 transitions. Word has length 23 [2025-04-13 21:59:08,348 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:08,348 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 415 transitions. [2025-04-13 21:59:08,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:08,349 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 415 transitions. [2025-04-13 21:59:08,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:08,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:08,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:08,358 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 21:59:08,549 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,SelfDestructingSolverStorable26 [2025-04-13 21:59:08,550 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 21:59:08,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:08,550 INFO L85 PathProgramCache]: Analyzing trace with hash 865074744, now seen corresponding path program 20 times [2025-04-13 21:59:08,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:08,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939915182] [2025-04-13 21:59:08,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:08,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:08,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:08,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:08,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:08,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:09,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:09,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939915182] [2025-04-13 21:59:09,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939915182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:09,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448558300] [2025-04-13 21:59:09,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:09,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:09,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:09,014 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 21:59:09,014 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 21:59:09,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:09,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:09,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:09,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:09,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 21:59:09,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:09,153 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 21:59:09,202 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 8 treesize of output 1 [2025-04-13 21:59:09,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 8 treesize of output 1 [2025-04-13 21:59:09,334 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 21:59:09,584 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 21:59:09,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:10,036 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 21:59:10,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 21:59:10,061 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 21:59:10,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 21:59:10,094 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 21:59:10,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 21:59:10,359 WARN L849 $PredicateComparison]: unable to prove that (or (let ((.cse7 (= c_~i_AB~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse15 (* c_~i_AB~0 4)) (.cse16 (* c_~i_BA~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse16 8)) (.cse5 (+ .cse16 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (+ 8 .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ c_~A~0.offset 8 .cse15)) (.cse8 (not .cse7)) (.cse9 (+ c_~i_BA~0 2))) (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse3 (select .cse1 .cse6))) (or (not (= (select v_arrayElimArr_12 .cse0) (select .cse1 .cse2))) (= .cse3 (select v_arrayElimArr_12 .cse4)) (= .cse3 (select v_arrayElimArr_12 .cse5)))))) (or (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse0) (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse2)))) .cse7) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse4) (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse2)))) .cse8)) (< .cse9 c_~Bn~0)) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse11 (select v_arrayElimArr_12 .cse4)) (.cse10 (select .cse12 .cse6))) (or (= .cse10 .cse11) (not (= (select .cse12 .cse2) .cse11)) (= .cse10 (select v_arrayElimArr_12 .cse5)))))) .cse8) (or (and (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select v_arrayElimArr_12 .cse0) (select .cse13 .cse2))) (= (select .cse13 .cse6) (select v_arrayElimArr_12 .cse5))))) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select .cse14 .cse2) (select v_arrayElimArr_12 .cse4))) (= (select .cse14 .cse6) (select v_arrayElimArr_12 .cse5))))) .cse8)) (= c_~i_BA~0 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (or (and (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_10 (Array Int Int))) (not (= (select v_arrayElimArr_10 .cse0) (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_10) c_~A~0.base) .cse2)))) .cse7) (or (forall ((|ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| Int) (v_arrayElimArr_10 (Array Int Int))) (not (= (select v_arrayElimArr_10 .cse4) (select (select (store |c_#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_10) c_~A~0.base) .cse2)))) .cse8)) (< .cse9 c_~An~0))))) (= c_~i_BA~0 (+ c_~i_AB~0 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) is different from false [2025-04-13 21:59:10,424 WARN L849 $PredicateComparison]: unable to prove that (or (= c_~i_BA~0 (+ c_~i_AB~0 1)) (let ((.cse14 (* c_~i_BA~0 4)) (.cse2 (= c_~i_AB~0 0)) (.cse15 (* c_~i_AB~0 4))) (let ((.cse0 (+ 8 .cse15)) (.cse1 (+ 8 .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (not .cse2)) (.cse7 (+ .cse14 8)) (.cse3 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse14 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (and (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_subst_12 Int)) (not (= (select v_arrayElimArr_10 .cse0) (select (select (store |c_#memory_int#1| v_subst_12 v_arrayElimArr_10) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1)))) .cse2) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_subst_13 Int)) (not (= (select v_arrayElimArr_10 8) (select (select (store |c_#memory_int#1| v_subst_13 v_arrayElimArr_10) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3)))) .cse4)) (< (+ c_~i_BA~0 2) c_~An~0)) (or (and (or (forall ((v_subst_15 Int) (v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse0) (select (select (store |c_#memory_int#1| v_subst_15 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1)))) .cse2) (or .cse4 (forall ((v_arrayElimArr_11 (Array Int Int)) (v_subst_16 Int)) (not (= (select (select (store |c_#memory_int#1| v_subst_16 v_arrayElimArr_11) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3) (select v_arrayElimArr_11 8)))))) (< c_~i_BA~0 1)) (or (and (forall ((v_arrayElimArr_12 (Array Int Int)) (v_subst_10 Int)) (let ((.cse5 (select (store |c_#memory_int#1| v_subst_10 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (= (select .cse5 .cse6) (select v_arrayElimArr_12 .cse7)) (not (= (select .cse5 .cse1) (select v_arrayElimArr_12 .cse0)))))) (or (forall ((v_arrayElimArr_12 (Array Int Int)) (v_subst_9 Int)) (let ((.cse8 (select (store |c_#memory_int#1| v_subst_9 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse8 .cse3) (select v_arrayElimArr_12 8))) (= (select .cse8 .cse6) (select v_arrayElimArr_12 .cse7))))) .cse4)) (= c_~i_BA~0 0)) (forall ((v_arrayElimArr_12 (Array Int Int)) (v_subst_11 Int)) (let ((.cse9 (select (store |c_#memory_int#1| v_subst_11 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse9 .cse6))) (or (not (= (select v_arrayElimArr_12 .cse0) (select .cse9 .cse1))) (= .cse10 (select v_arrayElimArr_12 .cse7)) (= .cse10 (select v_arrayElimArr_12 8)))))) (or .cse4 (forall ((v_subst_14 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int#1| v_subst_14 v_arrayElimArr_12) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse12 .cse6)) (.cse13 (select v_arrayElimArr_12 8))) (or (= .cse11 (select v_arrayElimArr_12 .cse7)) (not (= (select .cse12 .cse3) .cse13)) (= .cse11 .cse13)))))))))) is different from false [2025-04-13 21:59:10,456 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:10,456 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 21:59:10,462 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:59:10,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 125 treesize of output 101 [2025-04-13 21:59:10,467 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 21:59:10,511 INFO L325 Elim1Store]: treesize reduction 8, result has 91.4 percent of original size [2025-04-13 21:59:10,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 133 [2025-04-13 21:59:10,640 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 21:59:10,643 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 21:59:10,643 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2025-04-13 21:59:10,647 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:10,648 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 21:59:10,650 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 46 treesize of output 37 [2025-04-13 21:59:10,656 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:10,656 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 21:59:10,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 32 treesize of output 26 [2025-04-13 21:59:10,666 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:10,667 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 21:59:10,670 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 46 treesize of output 37 [2025-04-13 21:59:10,676 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 21:59:10,676 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2025-04-13 21:59:10,804 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-13 21:59:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448558300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:10,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:10,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2025-04-13 21:59:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991367860] [2025-04-13 21:59:10,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:10,805 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 21:59:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:10,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 21:59:10,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1601, Unknown=7, NotChecked=166, Total=1980 [2025-04-13 21:59:10,806 INFO L87 Difference]: Start difference. First operand 154 states and 415 transitions. Second operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:11,324 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_~i_AB~0 4)) (.cse32 (* c_~i_BA~0 4))) (let ((.cse13 (+ c_~A~0.offset .cse32 8)) (.cse33 (+ c_~i_BA~0 3)) (.cse20 (+ c_~i_AB~0 1)) (.cse34 (select |c_#memory_int#1| c_~A~0.base)) (.cse5 (+ c_~A~0.offset 8 .cse31)) (.cse35 (+ c_~i_BA~0 2))) (let ((.cse0 (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1))) (.cse14 (< .cse35 c_~An~0)) (.cse8 (< .cse35 c_~Bn~0)) (.cse19 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) (.cse4 (+ 8 .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse23 (select |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse12 (+ .cse32 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse27 (select .cse34 .cse5)) (.cse2 (= c_~i_BA~0 .cse20)) (.cse28 (<= .cse33 c_~Bn~0)) (.cse29 (select .cse34 .cse13)) (.cse1 (<= .cse33 c_~An~0))) (and (or .cse0 (and (<= c_~i_BA~0 0) (= c_~i_AB~0 c_~i_BA~0) .cse1) .cse2) (or (let ((.cse3 (= .cse20 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) (let ((.cse7 (not .cse3)) (.cse6 (+ .cse19 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (or (and (or .cse3 (forall ((v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse4) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse5))))) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (not (= (select v_arrayElimArr_11 .cse6) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_11) c_~A~0.base) .cse5)))) .cse7)) .cse8) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse9 (select v_arrayElimArr_12 .cse6)) (.cse11 (select .cse10 .cse13))) (or (not (= .cse9 (select .cse10 .cse5))) (= .cse9 .cse11) (= (select v_arrayElimArr_12 .cse12) .cse11))))) .cse7) (or (and (or (forall ((v_arrayElimArr_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_10) c_~A~0.base) .cse5) (select v_arrayElimArr_10 .cse6)))) .cse7) (or (forall ((v_arrayElimArr_10 (Array Int Int))) (not (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_10) c_~A~0.base) .cse5) (select v_arrayElimArr_10 .cse4)))) .cse3)) .cse14) (or (= (+ c_~i_BA~0 1) |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (and (or (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select v_arrayElimArr_12 .cse6) (select .cse15 .cse5))) (= (select v_arrayElimArr_12 .cse12) (select .cse15 .cse13))))) .cse7) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (or (not (= (select v_arrayElimArr_12 .cse4) (select .cse16 .cse5))) (= (select v_arrayElimArr_12 .cse12) (select .cse16 .cse13))))))) (forall ((v_arrayElimArr_12 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_arrayElimArr_12) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse13))) (or (= (select v_arrayElimArr_12 .cse6) .cse17) (not (= (select v_arrayElimArr_12 .cse4) (select .cse18 .cse5))) (= (select v_arrayElimArr_12 .cse12) .cse17)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) .cse2) (or .cse0 .cse2 (let ((.cse24 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse25 (forall ((v_ArrVal_532 Int)) (not (let ((.cse26 (store .cse23 .cse24 v_ArrVal_532))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse26) c_~A~0.base) .cse5) (select .cse26 .cse4))))))) (and (forall ((v_ArrVal_532 Int)) (let ((.cse22 (store .cse23 .cse24 v_ArrVal_532))) (let ((.cse21 (select (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| .cse22) c_~A~0.base))) (or (not (= (select .cse21 .cse5) (select .cse22 .cse4))) (= (select .cse22 .cse12) (select .cse21 .cse13)))))) (or .cse14 .cse25) (or .cse25 .cse8))))) (or .cse2 (not (= .cse27 (select .cse23 .cse4))) (and .cse28 (= (select .cse23 .cse12) .cse29) .cse1)) (let ((.cse30 (select |c_#memory_int#1| c_~B~0.base))) (or (not (= .cse27 (select .cse30 (+ 8 c_~B~0.offset .cse31)))) .cse2 (and .cse28 (= (select .cse30 (+ .cse32 8 c_~B~0.offset)) .cse29) .cse1))))))) is different from false [2025-04-13 21:59:12,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:12,669 INFO L93 Difference]: Finished difference Result 507 states and 1258 transitions. [2025-04-13 21:59:12,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 21:59:12,669 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 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 25 [2025-04-13 21:59:12,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:12,671 INFO L225 Difference]: With dead ends: 507 [2025-04-13 21:59:12,671 INFO L226 Difference]: Without dead ends: 464 [2025-04-13 21:59:12,672 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=458, Invalid=3705, Unknown=9, NotChecked=384, Total=4556 [2025-04-13 21:59:12,674 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 301 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:12,674 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 116 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1652 Invalid, 0 Unknown, 716 Unchecked, 0.8s Time] [2025-04-13 21:59:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-04-13 21:59:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 251. [2025-04-13 21:59:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.944) internal successors, (736), 250 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 736 transitions. [2025-04-13 21:59:12,721 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 736 transitions. Word has length 25 [2025-04-13 21:59:12,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:12,721 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 736 transitions. [2025-04-13 21:59:12,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:12,721 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 736 transitions. [2025-04-13 21:59:12,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:12,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:12,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:12,728 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 21:59:12,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:12,922 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 21:59:12,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -918421593, now seen corresponding path program 21 times [2025-04-13 21:59:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:12,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149014623] [2025-04-13 21:59:12,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:12,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:12,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:12,939 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:59:12,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:13,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149014623] [2025-04-13 21:59:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149014623] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:13,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866333460] [2025-04-13 21:59:13,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:13,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:13,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:13,144 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 21:59:13,145 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 21:59:13,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:13,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:13,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:59:13,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:13,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 21:59:13,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:13,379 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 21:59:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:13,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:14,572 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:14,573 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 80 treesize of output 83 [2025-04-13 21:59:14,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 13 [2025-04-13 21:59:14,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 30 [2025-04-13 21:59:14,620 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:14,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 80 treesize of output 83 [2025-04-13 21:59:14,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 13 [2025-04-13 21:59:14,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 30 [2025-04-13 21:59:14,660 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:14,660 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 163 treesize of output 159 [2025-04-13 21:59:14,697 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 21:59:14,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2025-04-13 21:59:14,733 INFO L325 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2025-04-13 21:59:14,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2025-04-13 21:59:15,383 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 21:59:15,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866333460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:15,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:15,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 38 [2025-04-13 21:59:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736843847] [2025-04-13 21:59:15,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:15,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 21:59:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:15,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 21:59:15,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1235, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 21:59:15,385 INFO L87 Difference]: Start difference. First operand 251 states and 736 transitions. Second operand has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:22,143 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:59:23,699 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:59:28,245 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:59:34,021 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 21:59:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:34,987 INFO L93 Difference]: Finished difference Result 1164 states and 3112 transitions. [2025-04-13 21:59:34,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-04-13 21:59:34,988 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 21:59:34,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:34,991 INFO L225 Difference]: With dead ends: 1164 [2025-04-13 21:59:34,991 INFO L226 Difference]: Without dead ends: 780 [2025-04-13 21:59:34,994 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4770 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2246, Invalid=13756, Unknown=0, NotChecked=0, Total=16002 [2025-04-13 21:59:34,994 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 543 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 200 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:34,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 169 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2178 Invalid, 4 Unknown, 0 Unchecked, 11.9s Time] [2025-04-13 21:59:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-04-13 21:59:35,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 410. [2025-04-13 21:59:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.9095354523227384) internal successors, (1190), 409 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1190 transitions. [2025-04-13 21:59:35,133 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1190 transitions. Word has length 25 [2025-04-13 21:59:35,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:35,133 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1190 transitions. [2025-04-13 21:59:35,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 38 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:35,133 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1190 transitions. [2025-04-13 21:59:35,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:35,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:35,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:35,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 21:59:35,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 21:59:35,335 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 21:59:35,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1152273127, now seen corresponding path program 22 times [2025-04-13 21:59:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:35,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651336866] [2025-04-13 21:59:35,335 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:35,340 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:35,349 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:35,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:35,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:35,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651336866] [2025-04-13 21:59:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651336866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:35,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751270839] [2025-04-13 21:59:35,529 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:35,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:35,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:35,531 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 21:59:35,531 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 21:59:35,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:35,603 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:35,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:35,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:35,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 21:59:35,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:35,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:35,740 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 21:59:35,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 21:59:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751270839] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:35,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:35,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2025-04-13 21:59:35,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142152203] [2025-04-13 21:59:35,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:35,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 21:59:35,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:35,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 21:59:35,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-04-13 21:59:35,796 INFO L87 Difference]: Start difference. First operand 410 states and 1190 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 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 21:59:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:36,378 INFO L93 Difference]: Finished difference Result 533 states and 1466 transitions. [2025-04-13 21:59:36,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:59:36,378 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 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 25 [2025-04-13 21:59:36,378 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:36,381 INFO L225 Difference]: With dead ends: 533 [2025-04-13 21:59:36,381 INFO L226 Difference]: Without dead ends: 516 [2025-04-13 21:59:36,381 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:59:36,382 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 65 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:36,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 47 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-04-13 21:59:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 400. [2025-04-13 21:59:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 2.927318295739348) internal successors, (1168), 399 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 21:59:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1168 transitions. [2025-04-13 21:59:36,518 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1168 transitions. Word has length 25 [2025-04-13 21:59:36,518 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:36,518 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1168 transitions. [2025-04-13 21:59:36,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 16 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 21:59:36,518 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1168 transitions. [2025-04-13 21:59:36,519 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:36,519 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:36,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:36,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 21:59:36,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:36,720 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 21:59:36,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 967147763, now seen corresponding path program 23 times [2025-04-13 21:59:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:36,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187869277] [2025-04-13 21:59:36,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:59:36,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:36,726 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:36,733 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:36,733 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:59:36,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:36,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187869277] [2025-04-13 21:59:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187869277] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:36,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106644428] [2025-04-13 21:59:36,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:59:36,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:36,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:36,980 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 21:59:36,981 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 21:59:37,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:37,064 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:37,064 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:59:37,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:37,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:59:37,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:37,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:37,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:37,268 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 21:59:37,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 21:59:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106644428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:37,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:37,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 18 [2025-04-13 21:59:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047209892] [2025-04-13 21:59:37,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:37,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 21:59:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:37,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 21:59:37,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-04-13 21:59:37,345 INFO L87 Difference]: Start difference. First operand 400 states and 1168 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 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 21:59:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:38,126 INFO L93 Difference]: Finished difference Result 525 states and 1454 transitions. [2025-04-13 21:59:38,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:59:38,126 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 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 25 [2025-04-13 21:59:38,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:38,129 INFO L225 Difference]: With dead ends: 525 [2025-04-13 21:59:38,129 INFO L226 Difference]: Without dead ends: 508 [2025-04-13 21:59:38,130 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-04-13 21:59:38,131 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:38,131 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 54 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-04-13 21:59:38,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 396. [2025-04-13 21:59:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.911392405063291) internal successors, (1150), 395 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1150 transitions. [2025-04-13 21:59:38,300 INFO L79 Accepts]: Start accepts. Automaton has 396 states and 1150 transitions. Word has length 25 [2025-04-13 21:59:38,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:38,300 INFO L485 AbstractCegarLoop]: Abstraction has 396 states and 1150 transitions. [2025-04-13 21:59:38,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 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 21:59:38,300 INFO L278 IsEmpty]: Start isEmpty. Operand 396 states and 1150 transitions. [2025-04-13 21:59:38,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:38,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:38,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:38,307 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 21:59:38,501 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,SelfDestructingSolverStorable30 [2025-04-13 21:59:38,502 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 21:59:38,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1740134840, now seen corresponding path program 24 times [2025-04-13 21:59:38,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:38,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093328284] [2025-04-13 21:59:38,502 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:38,508 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:38,518 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:38,518 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 21:59:38,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:39,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:39,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093328284] [2025-04-13 21:59:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093328284] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:39,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31220834] [2025-04-13 21:59:39,032 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:39,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:39,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:39,034 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 21:59:39,035 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 21:59:39,088 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:39,106 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:39,106 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 21:59:39,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:39,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 21:59:39,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:39,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:39,547 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 21:59:39,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 21:59:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31220834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:39,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 10] total 35 [2025-04-13 21:59:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753322587] [2025-04-13 21:59:39,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:39,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 21:59:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:39,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 21:59:39,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 21:59:39,788 INFO L87 Difference]: Start difference. First operand 396 states and 1150 transitions. Second operand has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:41,287 INFO L93 Difference]: Finished difference Result 467 states and 1275 transitions. [2025-04-13 21:59:41,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 21:59:41,288 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 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 25 [2025-04-13 21:59:41,288 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:41,290 INFO L225 Difference]: With dead ends: 467 [2025-04-13 21:59:41,290 INFO L226 Difference]: Without dead ends: 435 [2025-04-13 21:59:41,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=2822, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 21:59:41,291 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:41,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 134 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 21:59:41,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-04-13 21:59:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 402. [2025-04-13 21:59:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.890274314214464) internal successors, (1159), 401 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 21:59:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1159 transitions. [2025-04-13 21:59:41,491 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 1159 transitions. Word has length 25 [2025-04-13 21:59:41,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:41,491 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 1159 transitions. [2025-04-13 21:59:41,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.75) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:41,492 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 1159 transitions. [2025-04-13 21:59:41,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:41,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:41,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:41,500 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 21:59:41,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:41,693 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 21:59:41,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:41,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1695363280, now seen corresponding path program 25 times [2025-04-13 21:59:41,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:41,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470474544] [2025-04-13 21:59:41,694 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:41,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:59:41,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:41,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:41,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:42,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:42,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470474544] [2025-04-13 21:59:42,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470474544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:42,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590892682] [2025-04-13 21:59:42,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:42,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:42,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:42,230 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 21:59:42,231 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 21:59:42,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:59:42,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:42,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:42,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:42,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 21:59:42,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:42,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:42,651 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:42,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:43,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590892682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:43,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:43,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-13 21:59:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012064017] [2025-04-13 21:59:43,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:43,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 21:59:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:43,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 21:59:43,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 21:59:43,093 INFO L87 Difference]: Start difference. First operand 402 states and 1159 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:43,817 INFO L93 Difference]: Finished difference Result 433 states and 1213 transitions. [2025-04-13 21:59:43,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 21:59:43,817 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 21:59:43,817 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:43,820 INFO L225 Difference]: With dead ends: 433 [2025-04-13 21:59:43,820 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 21:59:43,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=318, Invalid=2232, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 21:59:43,821 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:43,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 61 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 21:59:44,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2025-04-13 21:59:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.863979848866499) internal successors, (1137), 397 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1137 transitions. [2025-04-13 21:59:44,065 INFO L79 Accepts]: Start accepts. Automaton has 398 states and 1137 transitions. Word has length 25 [2025-04-13 21:59:44,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:44,065 INFO L485 AbstractCegarLoop]: Abstraction has 398 states and 1137 transitions. [2025-04-13 21:59:44,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:44,065 INFO L278 IsEmpty]: Start isEmpty. Operand 398 states and 1137 transitions. [2025-04-13 21:59:44,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:44,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:44,066 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:44,072 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 21:59:44,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:44,267 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 21:59:44,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1806185800, now seen corresponding path program 26 times [2025-04-13 21:59:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:44,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816733173] [2025-04-13 21:59:44,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:44,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:44,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:44,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:44,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:44,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816733173] [2025-04-13 21:59:44,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816733173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:44,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606191750] [2025-04-13 21:59:44,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:44,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:44,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:44,865 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 21:59:44,866 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 21:59:44,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:44,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:44,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:44,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:44,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 21:59:44,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:45,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:45,473 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:45,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:45,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606191750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:45,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:45,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2025-04-13 21:59:45,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817732618] [2025-04-13 21:59:45,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:45,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 21:59:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:45,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 21:59:45,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1637, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 21:59:45,884 INFO L87 Difference]: Start difference. First operand 398 states and 1137 transitions. Second operand has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:47,105 INFO L93 Difference]: Finished difference Result 440 states and 1221 transitions. [2025-04-13 21:59:47,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 21:59:47,105 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 21:59:47,105 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:47,107 INFO L225 Difference]: With dead ends: 440 [2025-04-13 21:59:47,107 INFO L226 Difference]: Without dead ends: 424 [2025-04-13 21:59:47,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=377, Invalid=3405, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 21:59:47,108 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 96 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:47,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 102 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 21:59:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-04-13 21:59:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 394. [2025-04-13 21:59:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.8575063613231553) internal successors, (1123), 393 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1123 transitions. [2025-04-13 21:59:47,264 INFO L79 Accepts]: Start accepts. Automaton has 394 states and 1123 transitions. Word has length 25 [2025-04-13 21:59:47,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:47,264 INFO L485 AbstractCegarLoop]: Abstraction has 394 states and 1123 transitions. [2025-04-13 21:59:47,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.558139534883721) internal successors, (67), 42 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:47,264 INFO L278 IsEmpty]: Start isEmpty. Operand 394 states and 1123 transitions. [2025-04-13 21:59:47,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:47,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:47,265 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:47,271 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 21:59:47,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:47,465 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 21:59:47,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -2050281383, now seen corresponding path program 27 times [2025-04-13 21:59:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:47,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509683290] [2025-04-13 21:59:47,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:47,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:47,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:47,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:59:47,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:47,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:47,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509683290] [2025-04-13 21:59:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509683290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:47,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965081663] [2025-04-13 21:59:47,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:47,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:47,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:47,673 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 21:59:47,673 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 21:59:47,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:47,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:47,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:59:47,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:47,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 21:59:47,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:47,819 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 21:59:47,914 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 21:59:47,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:48,172 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:48,172 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 85 treesize of output 88 [2025-04-13 21:59:48,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 21:59:48,201 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 21:59:48,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 21:59:48,212 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 21:59:48,212 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 168 treesize of output 164 [2025-04-13 21:59:48,223 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 21:59:48,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 21:59:48,286 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 21:59:48,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 190 [2025-04-13 21:59:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 21:59:48,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965081663] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:48,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 9] total 22 [2025-04-13 21:59:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452264975] [2025-04-13 21:59:48,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:48,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:59:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:48,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:59:48,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:59:48,404 INFO L87 Difference]: Start difference. First operand 394 states and 1123 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 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 21:59:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:49,300 INFO L93 Difference]: Finished difference Result 496 states and 1387 transitions. [2025-04-13 21:59:49,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:59:49,300 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 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 25 [2025-04-13 21:59:49,300 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:49,303 INFO L225 Difference]: With dead ends: 496 [2025-04-13 21:59:49,303 INFO L226 Difference]: Without dead ends: 479 [2025-04-13 21:59:49,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 21:59:49,303 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 127 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:49,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 57 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:59:49,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-04-13 21:59:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 406. [2025-04-13 21:59:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.8962962962962964) internal successors, (1173), 405 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 21:59:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1173 transitions. [2025-04-13 21:59:49,494 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1173 transitions. Word has length 25 [2025-04-13 21:59:49,494 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:49,494 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1173 transitions. [2025-04-13 21:59:49,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 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 21:59:49,494 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1173 transitions. [2025-04-13 21:59:49,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:49,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:49,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:49,501 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 21:59:49,695 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,SelfDestructingSolverStorable34 [2025-04-13 21:59:49,695 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 21:59:49,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 437481524, now seen corresponding path program 28 times [2025-04-13 21:59:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:49,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200661203] [2025-04-13 21:59:49,696 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:49,701 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:49,706 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:49,706 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:49,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:49,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:49,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200661203] [2025-04-13 21:59:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200661203] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:49,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658850503] [2025-04-13 21:59:49,906 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:59:49,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:49,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:49,908 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 21:59:49,909 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 21:59:49,970 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:49,994 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:49,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:59:49,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:49,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 21:59:49,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:50,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:50,262 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 21:59:50,263 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 21:59:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 21:59:50,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658850503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:50,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-04-13 21:59:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928076171] [2025-04-13 21:59:50,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:50,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:59:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:50,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:59:50,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:59:50,345 INFO L87 Difference]: Start difference. First operand 406 states and 1173 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 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 21:59:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:51,299 INFO L93 Difference]: Finished difference Result 485 states and 1324 transitions. [2025-04-13 21:59:51,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:59:51,299 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 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 25 [2025-04-13 21:59:51,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:51,301 INFO L225 Difference]: With dead ends: 485 [2025-04-13 21:59:51,302 INFO L226 Difference]: Without dead ends: 446 [2025-04-13 21:59:51,302 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 21:59:51,302 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:51,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 84 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:59:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-13 21:59:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 410. [2025-04-13 21:59:51,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.750611246943765) internal successors, (1125), 409 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1125 transitions. [2025-04-13 21:59:51,501 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1125 transitions. Word has length 25 [2025-04-13 21:59:51,501 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:51,501 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1125 transitions. [2025-04-13 21:59:51,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 21 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 21:59:51,501 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1125 transitions. [2025-04-13 21:59:51,501 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:51,502 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:51,502 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:51,507 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 21:59:51,702 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,SelfDestructingSolverStorable35 [2025-04-13 21:59:51,702 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 21:59:51,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 538235127, now seen corresponding path program 29 times [2025-04-13 21:59:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:51,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826798750] [2025-04-13 21:59:51,703 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:59:51,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:51,708 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:51,714 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:51,714 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:59:51,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:51,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826798750] [2025-04-13 21:59:51,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826798750] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:51,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448610542] [2025-04-13 21:59:51,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:59:51,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:51,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:51,980 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 21:59:51,982 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 21:59:52,049 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 21:59:52,070 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:52,070 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:59:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:52,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 21:59:52,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 21:59:52,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:52,316 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 21:59:52,316 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 21:59:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 21:59:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448610542] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:52,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 6] total 24 [2025-04-13 21:59:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016081766] [2025-04-13 21:59:52,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:52,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:59:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:52,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:59:52,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:59:52,397 INFO L87 Difference]: Start difference. First operand 410 states and 1125 transitions. Second operand has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 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 21:59:53,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:53,306 INFO L93 Difference]: Finished difference Result 476 states and 1306 transitions. [2025-04-13 21:59:53,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:59:53,307 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 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 25 [2025-04-13 21:59:53,307 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:53,309 INFO L225 Difference]: With dead ends: 476 [2025-04-13 21:59:53,309 INFO L226 Difference]: Without dead ends: 447 [2025-04-13 21:59:53,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1682, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 21:59:53,309 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 67 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:53,309 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 49 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-04-13 21:59:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 361. [2025-04-13 21:59:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.6777777777777776) internal successors, (964), 360 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:53,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 964 transitions. [2025-04-13 21:59:53,498 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 964 transitions. Word has length 25 [2025-04-13 21:59:53,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:53,498 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 964 transitions. [2025-04-13 21:59:53,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.32) internal successors, (58), 24 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 21:59:53,499 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 964 transitions. [2025-04-13 21:59:53,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:53,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:53,499 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:53,506 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 21:59:53,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:53,700 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 21:59:53,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2059868860, now seen corresponding path program 30 times [2025-04-13 21:59:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:53,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60355551] [2025-04-13 21:59:53,700 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:53,707 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-04-13 21:59:53,725 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:53,725 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 21:59:53,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:54,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:54,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60355551] [2025-04-13 21:59:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60355551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:54,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152078094] [2025-04-13 21:59:54,024 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:59:54,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:54,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:54,026 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 21:59:54,027 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 21:59:54,088 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-04-13 21:59:54,107 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:54,107 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 21:59:54,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:54,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 21:59:54,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:54,302 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:54,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:54,362 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:54,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:54,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152078094] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:54,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:54,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 28 [2025-04-13 21:59:54,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016157809] [2025-04-13 21:59:54,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:54,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:59:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:59:54,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:59:54,547 INFO L87 Difference]: Start difference. First operand 361 states and 964 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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 21:59:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:55,066 INFO L93 Difference]: Finished difference Result 403 states and 1056 transitions. [2025-04-13 21:59:55,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:59:55,066 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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 25 [2025-04-13 21:59:55,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:55,068 INFO L225 Difference]: With dead ends: 403 [2025-04-13 21:59:55,068 INFO L226 Difference]: Without dead ends: 391 [2025-04-13 21:59:55,068 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=835, Unknown=0, NotChecked=0, Total=992 [2025-04-13 21:59:55,068 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:55,069 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 65 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-04-13 21:59:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 367. [2025-04-13 21:59:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.669398907103825) internal successors, (977), 366 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 977 transitions. [2025-04-13 21:59:55,247 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 977 transitions. Word has length 25 [2025-04-13 21:59:55,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:55,247 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 977 transitions. [2025-04-13 21:59:55,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 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 21:59:55,247 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 977 transitions. [2025-04-13 21:59:55,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:55,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:55,247 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:55,257 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 21:59:55,448 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,SelfDestructingSolverStorable37 [2025-04-13 21:59:55,448 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 21:59:55,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:55,448 INFO L85 PathProgramCache]: Analyzing trace with hash -174238634, now seen corresponding path program 31 times [2025-04-13 21:59:55,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:55,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042672] [2025-04-13 21:59:55,448 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:55,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:55,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:59:55,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:55,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:55,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:55,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042672] [2025-04-13 21:59:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:55,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136347979] [2025-04-13 21:59:55,887 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:59:55,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:55,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:55,889 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 21:59:55,890 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 21:59:55,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:59:55,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:55,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:59:55,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:55,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 21:59:55,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:56,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:56,334 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:56,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:59:56,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136347979] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:56,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:56,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2025-04-13 21:59:56,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310684975] [2025-04-13 21:59:56,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:56,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 21:59:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 21:59:56,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 21:59:56,695 INFO L87 Difference]: Start difference. First operand 367 states and 977 transitions. Second operand has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:57,386 INFO L93 Difference]: Finished difference Result 410 states and 1076 transitions. [2025-04-13 21:59:57,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:59:57,386 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 21:59:57,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:57,388 INFO L225 Difference]: With dead ends: 410 [2025-04-13 21:59:57,388 INFO L226 Difference]: Without dead ends: 398 [2025-04-13 21:59:57,389 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=314, Invalid=2136, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 21:59:57,389 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:57,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 61 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 21:59:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-04-13 21:59:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 367. [2025-04-13 21:59:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.6748633879781423) internal successors, (979), 366 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 979 transitions. [2025-04-13 21:59:57,568 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 979 transitions. Word has length 25 [2025-04-13 21:59:57,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:57,568 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 979 transitions. [2025-04-13 21:59:57,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:57,568 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 979 transitions. [2025-04-13 21:59:57,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:57,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:57,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:57,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-13 21:59:57,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 21:59:57,769 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 21:59:57,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:57,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1665631220, now seen corresponding path program 32 times [2025-04-13 21:59:57,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:57,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23696828] [2025-04-13 21:59:57,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:57,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:57,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:57,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:57,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:57,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:57,987 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 21:59:57,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:59:57,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23696828] [2025-04-13 21:59:57,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23696828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:59:57,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898659275] [2025-04-13 21:59:57,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:59:57,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:59:57,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:59:57,989 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 21:59:57,991 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 21:59:58,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 21:59:58,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:58,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:59:58,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:59:58,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 21:59:58,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:59:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:58,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:59:58,472 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 21:59:58,472 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 21:59:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 21:59:58,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898659275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:59:58,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:59:58,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 28 [2025-04-13 21:59:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626215421] [2025-04-13 21:59:58,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:59:58,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:59:58,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:59:58,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:59:58,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:59:58,657 INFO L87 Difference]: Start difference. First operand 367 states and 979 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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 21:59:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:59:59,360 INFO L93 Difference]: Finished difference Result 434 states and 1118 transitions. [2025-04-13 21:59:59,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 21:59:59,361 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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 25 [2025-04-13 21:59:59,361 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:59:59,365 INFO L225 Difference]: With dead ends: 434 [2025-04-13 21:59:59,366 INFO L226 Difference]: Without dead ends: 396 [2025-04-13 21:59:59,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 21:59:59,366 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 55 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:59:59,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 53 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:59:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-04-13 21:59:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 360. [2025-04-13 21:59:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 2.668523676880223) internal successors, (958), 359 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:59:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 958 transitions. [2025-04-13 21:59:59,532 INFO L79 Accepts]: Start accepts. Automaton has 360 states and 958 transitions. Word has length 25 [2025-04-13 21:59:59,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:59:59,532 INFO L485 AbstractCegarLoop]: Abstraction has 360 states and 958 transitions. [2025-04-13 21:59:59,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 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 21:59:59,533 INFO L278 IsEmpty]: Start isEmpty. Operand 360 states and 958 transitions. [2025-04-13 21:59:59,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 21:59:59,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:59:59,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:59:59,539 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 21:59:59,734 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,SelfDestructingSolverStorable39 [2025-04-13 21:59:59,734 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 21:59:59,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:59:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1554808700, now seen corresponding path program 33 times [2025-04-13 21:59:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:59:59,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071181689] [2025-04-13 21:59:59,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:59:59,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:59:59,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 21:59:59,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:59:59,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 21:59:59,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:00:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:00,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071181689] [2025-04-13 22:00:00,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071181689] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:00,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675847775] [2025-04-13 22:00:00,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:00,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:00,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:00,059 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:00:00,060 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:00:00,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:00:00,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:00:00,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:00:00,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:00,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 22:00:00,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:00,350 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:00:00,577 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:00,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:00,967 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:00:00,968 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2025-04-13 22:00:00,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:00:00,998 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:00:00,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:00:01,008 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:00:01,009 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 168 treesize of output 164 [2025-04-13 22:00:01,048 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:00:01,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:00:01,086 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:00:01,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-13 22:00:01,232 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:00:01,233 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 85 treesize of output 88 [2025-04-13 22:00:01,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2025-04-13 22:00:01,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:00:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675847775] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:01,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:01,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 40 [2025-04-13 22:00:01,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402714137] [2025-04-13 22:00:01,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:01,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:00:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:01,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:00:01,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:00:01,469 INFO L87 Difference]: Start difference. First operand 360 states and 958 transitions. Second operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:02,436 INFO L93 Difference]: Finished difference Result 400 states and 1052 transitions. [2025-04-13 22:00:02,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:00:02,436 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 22:00:02,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:02,438 INFO L225 Difference]: With dead ends: 400 [2025-04-13 22:00:02,438 INFO L226 Difference]: Without dead ends: 388 [2025-04-13 22:00:02,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=258, Invalid=2094, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:00:02,439 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:02,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 86 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:00:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-04-13 22:00:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 362. [2025-04-13 22:00:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.673130193905817) internal successors, (965), 361 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 965 transitions. [2025-04-13 22:00:02,616 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 965 transitions. Word has length 25 [2025-04-13 22:00:02,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:02,616 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 965 transitions. [2025-04-13 22:00:02,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 40 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:02,616 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 965 transitions. [2025-04-13 22:00:02,616 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:00:02,616 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:02,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:02,623 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:00:02,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:02,817 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:00:02,817 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:02,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1021814890, now seen corresponding path program 34 times [2025-04-13 22:00:02,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:02,817 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518727856] [2025-04-13 22:00:02,817 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:02,822 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:00:02,828 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:00:02,828 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:02,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:00:02,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:02,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518727856] [2025-04-13 22:00:02,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518727856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:02,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409099245] [2025-04-13 22:00:02,979 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:02,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:02,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:02,981 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:00:02,981 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:00:03,049 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:00:03,069 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:00:03,070 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:03,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:03,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 22:00:03,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:03,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:03,217 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:00:03,217 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:00:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:00:03,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409099245] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:03,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:03,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2025-04-13 22:00:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545440059] [2025-04-13 22:00:03,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:03,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:00:03,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:03,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:00:03,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:00:03,272 INFO L87 Difference]: Start difference. First operand 362 states and 965 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 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:00:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:04,011 INFO L93 Difference]: Finished difference Result 497 states and 1263 transitions. [2025-04-13 22:00:04,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:00:04,012 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 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 25 [2025-04-13 22:00:04,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:04,014 INFO L225 Difference]: With dead ends: 497 [2025-04-13 22:00:04,014 INFO L226 Difference]: Without dead ends: 462 [2025-04-13 22:00:04,014 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:00:04,014 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 79 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:04,014 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:00:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-04-13 22:00:04,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 364. [2025-04-13 22:00:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 2.6225895316804406) internal successors, (952), 363 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 952 transitions. [2025-04-13 22:00:04,199 INFO L79 Accepts]: Start accepts. Automaton has 364 states and 952 transitions. Word has length 25 [2025-04-13 22:00:04,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:04,199 INFO L485 AbstractCegarLoop]: Abstraction has 364 states and 952 transitions. [2025-04-13 22:00:04,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 17 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:00:04,199 INFO L278 IsEmpty]: Start isEmpty. Operand 364 states and 952 transitions. [2025-04-13 22:00:04,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:00:04,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:04,199 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:04,205 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:00:04,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:04,400 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:00:04,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1451305823, now seen corresponding path program 35 times [2025-04-13 22:00:04,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:04,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161503736] [2025-04-13 22:00:04,401 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:04,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:04,406 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 22:00:04,413 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:04,413 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:04,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:00:04,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:04,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161503736] [2025-04-13 22:00:04,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161503736] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:04,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514808323] [2025-04-13 22:00:04,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:04,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:04,747 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:00:04,748 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:00:04,817 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 3 equivalence classes. [2025-04-13 22:00:04,850 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:04,851 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:04,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:04,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:00:04,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:00:05,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:05,239 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:00:05,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:00:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:00:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514808323] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:05,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 32 [2025-04-13 22:00:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773556860] [2025-04-13 22:00:05,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:05,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:00:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:05,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:00:05,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=897, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:00:05,425 INFO L87 Difference]: Start difference. First operand 364 states and 952 transitions. Second operand has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:06,061 INFO L93 Difference]: Finished difference Result 448 states and 1130 transitions. [2025-04-13 22:00:06,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:00:06,061 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:00:06,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:06,063 INFO L225 Difference]: With dead ends: 448 [2025-04-13 22:00:06,063 INFO L226 Difference]: Without dead ends: 413 [2025-04-13 22:00:06,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:00:06,064 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:06,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 82 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:00:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-04-13 22:00:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 362. [2025-04-13 22:00:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.623268698060942) internal successors, (947), 361 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:06,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 947 transitions. [2025-04-13 22:00:06,258 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 947 transitions. Word has length 26 [2025-04-13 22:00:06,259 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:06,259 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 947 transitions. [2025-04-13 22:00:06,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:06,259 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 947 transitions. [2025-04-13 22:00:06,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:00:06,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:06,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:06,266 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:00:06,460 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,SelfDestructingSolverStorable42 [2025-04-13 22:00:06,460 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:00:06,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:06,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1361918036, now seen corresponding path program 36 times [2025-04-13 22:00:06,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:06,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420034462] [2025-04-13 22:00:06,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:06,465 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 22:00:06,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:06,473 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:06,667 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:00:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:06,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420034462] [2025-04-13 22:00:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420034462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:06,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432823369] [2025-04-13 22:00:06,667 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:06,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:06,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:06,669 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:00:06,670 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:00:06,740 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 3 equivalence classes. [2025-04-13 22:00:06,758 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:06,758 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:06,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:00:06,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:06,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:06,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432823369] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:06,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:06,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 4] total 22 [2025-04-13 22:00:06,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566769292] [2025-04-13 22:00:06,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:06,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:00:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:06,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:00:06,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:00:06,937 INFO L87 Difference]: Start difference. First operand 362 states and 947 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:08,213 INFO L93 Difference]: Finished difference Result 736 states and 1910 transitions. [2025-04-13 22:00:08,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:00:08,213 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 22:00:08,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:08,215 INFO L225 Difference]: With dead ends: 736 [2025-04-13 22:00:08,215 INFO L226 Difference]: Without dead ends: 514 [2025-04-13 22:00:08,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:00:08,216 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 106 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:08,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 93 Invalid, 1571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:00:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-04-13 22:00:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 413. [2025-04-13 22:00:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 2.6990291262135924) internal successors, (1112), 412 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1112 transitions. [2025-04-13 22:00:08,431 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 1112 transitions. Word has length 26 [2025-04-13 22:00:08,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:08,431 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 1112 transitions. [2025-04-13 22:00:08,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:08,431 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 1112 transitions. [2025-04-13 22:00:08,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:00:08,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:08,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:08,438 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:00:08,632 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,SelfDestructingSolverStorable43 [2025-04-13 22:00:08,632 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:00:08,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:08,633 INFO L85 PathProgramCache]: Analyzing trace with hash -84379886, now seen corresponding path program 37 times [2025-04-13 22:00:08,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:08,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363446241] [2025-04-13 22:00:08,633 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:08,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:08,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:00:08,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:08,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:08,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:08,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:08,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:08,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363446241] [2025-04-13 22:00:08,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363446241] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:08,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519261066] [2025-04-13 22:00:08,701 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:08,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:08,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:08,703 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:00:08,705 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:00:08,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:00:08,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:08,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:08,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:08,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:00:08,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:08,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519261066] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:08,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:08,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 4] total 11 [2025-04-13 22:00:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119281749] [2025-04-13 22:00:08,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:08,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:00:08,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:08,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:00:08,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:00:08,915 INFO L87 Difference]: Start difference. First operand 413 states and 1112 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:00:09,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:09,564 INFO L93 Difference]: Finished difference Result 521 states and 1354 transitions. [2025-04-13 22:00:09,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:00:09,564 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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 26 [2025-04-13 22:00:09,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:09,567 INFO L225 Difference]: With dead ends: 521 [2025-04-13 22:00:09,567 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 22:00:09,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:00:09,567 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:09,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:00:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 22:00:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 433. [2025-04-13 22:00:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 2.740740740740741) internal successors, (1184), 432 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 1184 transitions. [2025-04-13 22:00:09,796 INFO L79 Accepts]: Start accepts. Automaton has 433 states and 1184 transitions. Word has length 26 [2025-04-13 22:00:09,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:09,796 INFO L485 AbstractCegarLoop]: Abstraction has 433 states and 1184 transitions. [2025-04-13 22:00:09,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:00:09,797 INFO L278 IsEmpty]: Start isEmpty. Operand 433 states and 1184 transitions. [2025-04-13 22:00:09,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:00:09,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:09,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:09,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:09,997 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,SelfDestructingSolverStorable44 [2025-04-13 22:00:09,998 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:00:09,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:09,998 INFO L85 PathProgramCache]: Analyzing trace with hash 864597100, now seen corresponding path program 38 times [2025-04-13 22:00:09,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:09,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098272590] [2025-04-13 22:00:09,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:10,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:00:10,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:10,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:10,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:10,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098272590] [2025-04-13 22:00:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098272590] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:10,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134386071] [2025-04-13 22:00:10,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:10,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:10,080 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:00:10,081 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:00:10,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:00:10,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:00:10,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:10,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:10,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 22:00:10,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:10,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 22:00:10,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134386071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:10,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:10,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 4] total 11 [2025-04-13 22:00:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380252345] [2025-04-13 22:00:10,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:10,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:00:10,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:10,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:00:10,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:00:10,274 INFO L87 Difference]: Start difference. First operand 433 states and 1184 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:00:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:10,916 INFO L93 Difference]: Finished difference Result 543 states and 1441 transitions. [2025-04-13 22:00:10,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:00:10,916 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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 26 [2025-04-13 22:00:10,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:10,918 INFO L225 Difference]: With dead ends: 543 [2025-04-13 22:00:10,918 INFO L226 Difference]: Without dead ends: 531 [2025-04-13 22:00:10,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:00:10,919 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 36 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:10,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 33 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:00:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-04-13 22:00:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 467. [2025-04-13 22:00:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 2.7703862660944205) internal successors, (1291), 466 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1291 transitions. [2025-04-13 22:00:11,199 INFO L79 Accepts]: Start accepts. Automaton has 467 states and 1291 transitions. Word has length 26 [2025-04-13 22:00:11,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:11,199 INFO L485 AbstractCegarLoop]: Abstraction has 467 states and 1291 transitions. [2025-04-13 22:00:11,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 12 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:00:11,199 INFO L278 IsEmpty]: Start isEmpty. Operand 467 states and 1291 transitions. [2025-04-13 22:00:11,200 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:00:11,200 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:11,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:11,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:11,401 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,SelfDestructingSolverStorable45 [2025-04-13 22:00:11,401 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:00:11,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1469991325, now seen corresponding path program 39 times [2025-04-13 22:00:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:11,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340488101] [2025-04-13 22:00:11,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:11,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 22:00:11,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:00:11,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:11,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:00:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:11,530 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340488101] [2025-04-13 22:00:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340488101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:11,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800011678] [2025-04-13 22:00:11,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:11,532 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:00:11,534 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:00:11,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 22:00:11,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:00:11,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:11,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:11,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:00:11,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:00:11,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:00:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800011678] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:11,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:11,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-04-13 22:00:11,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954962386] [2025-04-13 22:00:11,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:11,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:00:11,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:11,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:00:11,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:00:11,851 INFO L87 Difference]: Start difference. First operand 467 states and 1291 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 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:00:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:12,699 INFO L93 Difference]: Finished difference Result 976 states and 2815 transitions. [2025-04-13 22:00:12,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:00:12,700 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 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 27 [2025-04-13 22:00:12,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:12,702 INFO L225 Difference]: With dead ends: 976 [2025-04-13 22:00:12,702 INFO L226 Difference]: Without dead ends: 609 [2025-04-13 22:00:12,703 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:00:12,703 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 79 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:12,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 36 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:00:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-04-13 22:00:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 510. [2025-04-13 22:00:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.760314341846758) internal successors, (1405), 509 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1405 transitions. [2025-04-13 22:00:12,973 INFO L79 Accepts]: Start accepts. Automaton has 510 states and 1405 transitions. Word has length 27 [2025-04-13 22:00:12,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:12,973 INFO L485 AbstractCegarLoop]: Abstraction has 510 states and 1405 transitions. [2025-04-13 22:00:12,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 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:00:12,973 INFO L278 IsEmpty]: Start isEmpty. Operand 510 states and 1405 transitions. [2025-04-13 22:00:12,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:00:12,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:12,974 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:12,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:13,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:13,174 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:00:13,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash -794959799, now seen corresponding path program 40 times [2025-04-13 22:00:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:13,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130267970] [2025-04-13 22:00:13,175 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:13,181 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:00:13,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:13,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:13,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:13,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130267970] [2025-04-13 22:00:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130267970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:13,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067993829] [2025-04-13 22:00:13,417 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:13,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:13,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:13,419 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:00:13,420 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:00:13,501 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:00:13,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:13,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:13,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:13,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:00:13,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:13,632 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:13,702 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:00:13,702 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 64 [2025-04-13 22:00:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067993829] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:13,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 20 [2025-04-13 22:00:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379832536] [2025-04-13 22:00:13,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:13,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:00:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:13,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:00:13,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:00:13,761 INFO L87 Difference]: Start difference. First operand 510 states and 1405 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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:00:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:14,900 INFO L93 Difference]: Finished difference Result 681 states and 1739 transitions. [2025-04-13 22:00:14,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:00:14,901 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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 28 [2025-04-13 22:00:14,901 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:14,903 INFO L225 Difference]: With dead ends: 681 [2025-04-13 22:00:14,904 INFO L226 Difference]: Without dead ends: 662 [2025-04-13 22:00:14,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1208, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:00:14,904 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 108 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:14,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 52 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:14,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-04-13 22:00:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 516. [2025-04-13 22:00:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 515 states have (on average 2.7766990291262137) internal successors, (1430), 515 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1430 transitions. [2025-04-13 22:00:15,171 INFO L79 Accepts]: Start accepts. Automaton has 516 states and 1430 transitions. Word has length 28 [2025-04-13 22:00:15,171 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:15,171 INFO L485 AbstractCegarLoop]: Abstraction has 516 states and 1430 transitions. [2025-04-13 22:00:15,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 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:00:15,171 INFO L278 IsEmpty]: Start isEmpty. Operand 516 states and 1430 transitions. [2025-04-13 22:00:15,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:00:15,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:15,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:15,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:15,372 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,SelfDestructingSolverStorable47 [2025-04-13 22:00:15,373 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:00:15,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash 934087535, now seen corresponding path program 41 times [2025-04-13 22:00:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:15,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13070435] [2025-04-13 22:00:15,373 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:15,378 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-04-13 22:00:15,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:15,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:15,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:00:15,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:15,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13070435] [2025-04-13 22:00:15,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13070435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:15,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227385402] [2025-04-13 22:00:15,647 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:15,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:15,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:15,649 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:00:15,650 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:00:15,729 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-04-13 22:00:15,757 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:15,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:15,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:15,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:00:15,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:15,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:16,007 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:00:16,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 70 [2025-04-13 22:00:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227385402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:16,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:16,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 21 [2025-04-13 22:00:16,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380411668] [2025-04-13 22:00:16,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:16,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:00:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:16,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:00:16,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:00:16,032 INFO L87 Difference]: Start difference. First operand 516 states and 1430 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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:00:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:17,387 INFO L93 Difference]: Finished difference Result 687 states and 1764 transitions. [2025-04-13 22:00:17,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:00:17,387 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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 28 [2025-04-13 22:00:17,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:17,390 INFO L225 Difference]: With dead ends: 687 [2025-04-13 22:00:17,390 INFO L226 Difference]: Without dead ends: 664 [2025-04-13 22:00:17,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1793, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:00:17,391 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 135 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:17,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 55 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-04-13 22:00:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 510. [2025-04-13 22:00:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.7406679764243616) internal successors, (1395), 509 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1395 transitions. [2025-04-13 22:00:17,679 INFO L79 Accepts]: Start accepts. Automaton has 510 states and 1395 transitions. Word has length 28 [2025-04-13 22:00:17,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:17,679 INFO L485 AbstractCegarLoop]: Abstraction has 510 states and 1395 transitions. [2025-04-13 22:00:17,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 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:00:17,679 INFO L278 IsEmpty]: Start isEmpty. Operand 510 states and 1395 transitions. [2025-04-13 22:00:17,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:00:17,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:17,680 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:17,686 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:00:17,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 22:00:17,881 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:00:17,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:17,881 INFO L85 PathProgramCache]: Analyzing trace with hash 935413252, now seen corresponding path program 42 times [2025-04-13 22:00:17,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:17,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764658051] [2025-04-13 22:00:17,881 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:17,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:17,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-13 22:00:17,892 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:17,892 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:17,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:00:17,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:17,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764658051] [2025-04-13 22:00:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764658051] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:17,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73922266] [2025-04-13 22:00:17,986 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:17,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:17,989 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:00:17,990 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:00:18,081 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-13 22:00:18,105 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:18,105 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:18,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:18,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:00:18,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:00:18,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:00:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73922266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:18,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-04-13 22:00:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170670478] [2025-04-13 22:00:18,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:18,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:00:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:18,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:00:18,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:00:18,321 INFO L87 Difference]: Start difference. First operand 510 states and 1395 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 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:00:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:18,764 INFO L93 Difference]: Finished difference Result 539 states and 1440 transitions. [2025-04-13 22:00:18,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:00:18,764 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 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 28 [2025-04-13 22:00:18,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:18,766 INFO L225 Difference]: With dead ends: 539 [2025-04-13 22:00:18,766 INFO L226 Difference]: Without dead ends: 403 [2025-04-13 22:00:18,767 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:00:18,767 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:18,767 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 36 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:00:18,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-04-13 22:00:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-04-13 22:00:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 2.853233830845771) internal successors, (1147), 402 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1147 transitions. [2025-04-13 22:00:18,979 INFO L79 Accepts]: Start accepts. Automaton has 403 states and 1147 transitions. Word has length 28 [2025-04-13 22:00:18,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:18,980 INFO L485 AbstractCegarLoop]: Abstraction has 403 states and 1147 transitions. [2025-04-13 22:00:18,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 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:00:18,980 INFO L278 IsEmpty]: Start isEmpty. Operand 403 states and 1147 transitions. [2025-04-13 22:00:18,980 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:00:18,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:18,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:18,986 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:00:19,181 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,SelfDestructingSolverStorable49 [2025-04-13 22:00:19,181 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:00:19,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:19,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1566982579, now seen corresponding path program 43 times [2025-04-13 22:00:19,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:19,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417001157] [2025-04-13 22:00:19,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:19,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:00:19,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:19,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:19,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:00:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:19,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417001157] [2025-04-13 22:00:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417001157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:19,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198666135] [2025-04-13 22:00:19,278 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:19,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:19,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:19,279 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:00:19,280 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:00:19,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:00:19,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:19,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:19,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:19,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:00:19,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:00:19,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:00:19,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198666135] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:19,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:19,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 22:00:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660634372] [2025-04-13 22:00:19,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:19,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:00:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:19,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:00:19,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:00:19,576 INFO L87 Difference]: Start difference. First operand 403 states and 1147 transitions. Second operand has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 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:00:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:20,293 INFO L93 Difference]: Finished difference Result 792 states and 2304 transitions. [2025-04-13 22:00:20,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:00:20,293 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 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 28 [2025-04-13 22:00:20,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:20,296 INFO L225 Difference]: With dead ends: 792 [2025-04-13 22:00:20,296 INFO L226 Difference]: Without dead ends: 505 [2025-04-13 22:00:20,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:00:20,297 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 55 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:20,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 43 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:00:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-04-13 22:00:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 434. [2025-04-13 22:00:20,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.812933025404157) internal successors, (1218), 433 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1218 transitions. [2025-04-13 22:00:20,548 INFO L79 Accepts]: Start accepts. Automaton has 434 states and 1218 transitions. Word has length 28 [2025-04-13 22:00:20,548 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:20,548 INFO L485 AbstractCegarLoop]: Abstraction has 434 states and 1218 transitions. [2025-04-13 22:00:20,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 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:00:20,548 INFO L278 IsEmpty]: Start isEmpty. Operand 434 states and 1218 transitions. [2025-04-13 22:00:20,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:00:20,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:20,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:20,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 22:00:20,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:20,750 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:00:20,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:20,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1103663132, now seen corresponding path program 44 times [2025-04-13 22:00:20,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:20,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292280030] [2025-04-13 22:00:20,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:20,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:20,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:00:20,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:20,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:20,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:00:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:20,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292280030] [2025-04-13 22:00:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292280030] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:20,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002002526] [2025-04-13 22:00:20,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:20,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:20,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:20,851 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:00:20,852 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:00:20,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:00:20,959 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:00:20,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:20,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:20,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 22:00:20,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:00:21,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-13 22:00:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002002526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:21,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 22:00:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290963309] [2025-04-13 22:00:21,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:21,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:00:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:21,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:00:21,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:00:21,138 INFO L87 Difference]: Start difference. First operand 434 states and 1218 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 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:00:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:21,576 INFO L93 Difference]: Finished difference Result 453 states and 1248 transitions. [2025-04-13 22:00:21,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:00:21,576 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 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 28 [2025-04-13 22:00:21,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:21,578 INFO L225 Difference]: With dead ends: 453 [2025-04-13 22:00:21,578 INFO L226 Difference]: Without dead ends: 338 [2025-04-13 22:00:21,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:00:21,579 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:21,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 41 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:00:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-04-13 22:00:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-04-13 22:00:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 337 states have (on average 2.9851632047477743) internal successors, (1006), 337 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 1006 transitions. [2025-04-13 22:00:21,767 INFO L79 Accepts]: Start accepts. Automaton has 338 states and 1006 transitions. Word has length 28 [2025-04-13 22:00:21,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:21,767 INFO L485 AbstractCegarLoop]: Abstraction has 338 states and 1006 transitions. [2025-04-13 22:00:21,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 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:00:21,767 INFO L278 IsEmpty]: Start isEmpty. Operand 338 states and 1006 transitions. [2025-04-13 22:00:21,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:21,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:21,768 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:21,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:21,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:21,969 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:00:21,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1104783257, now seen corresponding path program 45 times [2025-04-13 22:00:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:21,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464797424] [2025-04-13 22:00:21,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:21,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:21,990 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:21,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:21,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:22,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:22,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464797424] [2025-04-13 22:00:22,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464797424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:22,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568171429] [2025-04-13 22:00:22,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:22,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:22,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:22,586 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:00:22,587 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:00:22,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:22,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:22,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:22,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:22,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:00:22,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:23,056 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:23,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:23,226 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:00:23,227 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:00:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568171429] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:23,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:23,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 9] total 38 [2025-04-13 22:00:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380817165] [2025-04-13 22:00:23,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:23,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:00:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:23,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:00:23,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:00:23,351 INFO L87 Difference]: Start difference. First operand 338 states and 1006 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:25,952 INFO L93 Difference]: Finished difference Result 822 states and 2369 transitions. [2025-04-13 22:00:25,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:00:25,952 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:25,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:25,955 INFO L225 Difference]: With dead ends: 822 [2025-04-13 22:00:25,955 INFO L226 Difference]: Without dead ends: 769 [2025-04-13 22:00:25,956 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=522, Invalid=5640, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 22:00:25,956 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 518 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2088 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:25,956 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 141 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2088 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:00:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-04-13 22:00:26,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 347. [2025-04-13 22:00:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 2.838150289017341) internal successors, (982), 346 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:26,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 982 transitions. [2025-04-13 22:00:26,144 INFO L79 Accepts]: Start accepts. Automaton has 347 states and 982 transitions. Word has length 29 [2025-04-13 22:00:26,144 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:26,145 INFO L485 AbstractCegarLoop]: Abstraction has 347 states and 982 transitions. [2025-04-13 22:00:26,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:26,145 INFO L278 IsEmpty]: Start isEmpty. Operand 347 states and 982 transitions. [2025-04-13 22:00:26,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:26,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:26,145 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:26,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:26,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:26,346 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:00:26,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash -558594856, now seen corresponding path program 46 times [2025-04-13 22:00:26,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:26,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342890594] [2025-04-13 22:00:26,346 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:26,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:26,352 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:26,369 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:26,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:26,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:26,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:26,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:26,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342890594] [2025-04-13 22:00:26,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342890594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:26,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081084845] [2025-04-13 22:00:26,652 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:26,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:26,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:26,654 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:00:26,654 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:00:26,741 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:26,770 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:26,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:26,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:26,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:00:26,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:26,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:27,079 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:00:27,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:00:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:27,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081084845] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:27,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:27,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 27 [2025-04-13 22:00:27,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350586993] [2025-04-13 22:00:27,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:27,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:00:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:27,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:00:27,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:00:27,164 INFO L87 Difference]: Start difference. First operand 347 states and 982 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:28,003 INFO L93 Difference]: Finished difference Result 396 states and 1079 transitions. [2025-04-13 22:00:28,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:00:28,003 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 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 29 [2025-04-13 22:00:28,003 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:28,005 INFO L225 Difference]: With dead ends: 396 [2025-04-13 22:00:28,005 INFO L226 Difference]: Without dead ends: 355 [2025-04-13 22:00:28,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:00:28,006 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 77 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:28,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 125 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-13 22:00:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 341. [2025-04-13 22:00:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 2.75) internal successors, (935), 340 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 935 transitions. [2025-04-13 22:00:28,199 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 935 transitions. Word has length 29 [2025-04-13 22:00:28,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:28,199 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 935 transitions. [2025-04-13 22:00:28,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 27 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:28,199 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 935 transitions. [2025-04-13 22:00:28,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:28,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:28,199 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:28,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:28,400 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,SelfDestructingSolverStorable53 [2025-04-13 22:00:28,400 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:00:28,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 755851032, now seen corresponding path program 47 times [2025-04-13 22:00:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:28,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360270091] [2025-04-13 22:00:28,400 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:28,406 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:28,413 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:28,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:28,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:28,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:28,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360270091] [2025-04-13 22:00:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360270091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:28,742 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584123846] [2025-04-13 22:00:28,742 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:28,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:28,744 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:00:28,745 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:00:28,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:28,888 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:28,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:28,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:28,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:00:28,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:00:29,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:29,193 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:00:29,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:00:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584123846] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:29,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 6] total 29 [2025-04-13 22:00:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396587771] [2025-04-13 22:00:29,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:29,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:00:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:29,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:00:29,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:00:29,320 INFO L87 Difference]: Start difference. First operand 341 states and 935 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:30,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:30,174 INFO L93 Difference]: Finished difference Result 381 states and 1039 transitions. [2025-04-13 22:00:30,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:00:30,174 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:30,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:30,176 INFO L225 Difference]: With dead ends: 381 [2025-04-13 22:00:30,176 INFO L226 Difference]: Without dead ends: 373 [2025-04-13 22:00:30,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1788, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:00:30,177 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 57 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:30,177 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 85 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:30,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-04-13 22:00:30,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 341. [2025-04-13 22:00:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 2.7441176470588236) internal successors, (933), 340 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 933 transitions. [2025-04-13 22:00:30,376 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 933 transitions. Word has length 29 [2025-04-13 22:00:30,376 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:30,377 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 933 transitions. [2025-04-13 22:00:30,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 29 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:30,377 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 933 transitions. [2025-04-13 22:00:30,377 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:30,377 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:30,377 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:30,384 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:00:30,577 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,SelfDestructingSolverStorable54 [2025-04-13 22:00:30,578 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:00:30,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:30,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1285337172, now seen corresponding path program 48 times [2025-04-13 22:00:30,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:30,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453074387] [2025-04-13 22:00:30,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:30,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:30,584 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:30,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:30,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:30,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:31,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:31,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453074387] [2025-04-13 22:00:31,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453074387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:31,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099007359] [2025-04-13 22:00:31,088 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:31,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:31,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:31,089 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:00:31,090 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:00:31,178 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:31,198 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:31,198 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:31,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:31,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:00:31,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:31,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:31,711 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:00:31,711 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:00:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099007359] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:32,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 13] total 45 [2025-04-13 22:00:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510388952] [2025-04-13 22:00:32,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:32,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 22:00:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:32,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 22:00:32,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1830, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:00:32,036 INFO L87 Difference]: Start difference. First operand 341 states and 933 transitions. Second operand has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:33,216 INFO L93 Difference]: Finished difference Result 451 states and 1200 transitions. [2025-04-13 22:00:33,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:00:33,216 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 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 29 [2025-04-13 22:00:33,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:33,218 INFO L225 Difference]: With dead ends: 451 [2025-04-13 22:00:33,218 INFO L226 Difference]: Without dead ends: 443 [2025-04-13 22:00:33,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=362, Invalid=3298, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:00:33,219 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 85 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:33,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 103 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-04-13 22:00:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 347. [2025-04-13 22:00:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 2.745664739884393) internal successors, (950), 346 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 950 transitions. [2025-04-13 22:00:33,416 INFO L79 Accepts]: Start accepts. Automaton has 347 states and 950 transitions. Word has length 29 [2025-04-13 22:00:33,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:33,416 INFO L485 AbstractCegarLoop]: Abstraction has 347 states and 950 transitions. [2025-04-13 22:00:33,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:33,416 INFO L278 IsEmpty]: Start isEmpty. Operand 347 states and 950 transitions. [2025-04-13 22:00:33,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:33,417 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:33,417 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:33,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:33,617 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,SelfDestructingSolverStorable55 [2025-04-13 22:00:33,617 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:00:33,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2058324249, now seen corresponding path program 49 times [2025-04-13 22:00:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:33,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947942065] [2025-04-13 22:00:33,618 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:33,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:33,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:00:33,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:33,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:33,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:34,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:34,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:34,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947942065] [2025-04-13 22:00:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947942065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:34,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339267796] [2025-04-13 22:00:34,129 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:34,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:34,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:34,131 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:00:34,133 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:00:34,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:00:34,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:34,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:34,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:34,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:00:34,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:34,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:34,750 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:00:34,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:00:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339267796] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:35,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:35,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 22:00:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827272102] [2025-04-13 22:00:35,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:35,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:00:35,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:35,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:00:35,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:00:35,285 INFO L87 Difference]: Start difference. First operand 347 states and 950 transitions. Second operand has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:36,175 INFO L93 Difference]: Finished difference Result 358 states and 965 transitions. [2025-04-13 22:00:36,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:00:36,175 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:36,176 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:36,177 INFO L225 Difference]: With dead ends: 358 [2025-04-13 22:00:36,178 INFO L226 Difference]: Without dead ends: 347 [2025-04-13 22:00:36,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=3849, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:00:36,178 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:36,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 84 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-13 22:00:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-04-13 22:00:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 2.739884393063584) internal successors, (948), 346 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 948 transitions. [2025-04-13 22:00:36,383 INFO L79 Accepts]: Start accepts. Automaton has 347 states and 948 transitions. Word has length 29 [2025-04-13 22:00:36,383 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:36,383 INFO L485 AbstractCegarLoop]: Abstraction has 347 states and 948 transitions. [2025-04-13 22:00:36,383 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:36,384 INFO L278 IsEmpty]: Start isEmpty. Operand 347 states and 948 transitions. [2025-04-13 22:00:36,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:36,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:36,384 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:36,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 22:00:36,584 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,SelfDestructingSolverStorable56 [2025-04-13 22:00:36,585 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:00:36,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1402108938, now seen corresponding path program 50 times [2025-04-13 22:00:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:36,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898363391] [2025-04-13 22:00:36,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:36,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:36,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:36,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:36,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:37,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:37,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898363391] [2025-04-13 22:00:37,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898363391] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:37,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024950264] [2025-04-13 22:00:37,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:37,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:37,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:37,070 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:00:37,070 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:00:37,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:37,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:37,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:37,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:37,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:00:37,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:37,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:37,747 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:00:37,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:00:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024950264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:38,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-13 22:00:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793530016] [2025-04-13 22:00:38,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:38,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 22:00:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:38,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 22:00:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2439, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:00:38,237 INFO L87 Difference]: Start difference. First operand 347 states and 948 transitions. Second operand has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:39,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:39,129 INFO L93 Difference]: Finished difference Result 396 states and 1066 transitions. [2025-04-13 22:00:39,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:00:39,130 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 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 29 [2025-04-13 22:00:39,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:39,131 INFO L225 Difference]: With dead ends: 396 [2025-04-13 22:00:39,132 INFO L226 Difference]: Without dead ends: 388 [2025-04-13 22:00:39,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=429, Invalid=3111, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:00:39,132 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:39,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 93 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:00:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-04-13 22:00:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 349. [2025-04-13 22:00:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.75) internal successors, (957), 348 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 957 transitions. [2025-04-13 22:00:39,334 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 957 transitions. Word has length 29 [2025-04-13 22:00:39,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:39,335 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 957 transitions. [2025-04-13 22:00:39,335 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:39,335 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 957 transitions. [2025-04-13 22:00:39,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:39,335 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:39,335 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:39,342 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:00:39,536 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,SelfDestructingSolverStorable57 [2025-04-13 22:00:39,536 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:00:39,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1377173871, now seen corresponding path program 51 times [2025-04-13 22:00:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:39,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450830609] [2025-04-13 22:00:39,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:39,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:39,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:39,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:39,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:00:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:39,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450830609] [2025-04-13 22:00:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450830609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:39,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772490318] [2025-04-13 22:00:39,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:39,762 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:00:39,764 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:00:39,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:39,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:39,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:39,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 22:00:39,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:40,149 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:00:40,358 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:40,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:40,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:00:40,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 168 treesize of output 164 [2025-04-13 22:00:40,802 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:00:40,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:00:40,837 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:00:40,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-13 22:00:40,972 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:00:40,972 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 85 treesize of output 88 [2025-04-13 22:00:40,988 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2025-04-13 22:00:40,995 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:00:40,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:00:41,126 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:00:41,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772490318] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:41,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 15] total 41 [2025-04-13 22:00:41,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724583151] [2025-04-13 22:00:41,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:41,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 22:00:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:41,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 22:00:41,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:00:41,127 INFO L87 Difference]: Start difference. First operand 349 states and 957 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:42,519 INFO L93 Difference]: Finished difference Result 416 states and 1068 transitions. [2025-04-13 22:00:42,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:00:42,520 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:42,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:42,521 INFO L225 Difference]: With dead ends: 416 [2025-04-13 22:00:42,522 INFO L226 Difference]: Without dead ends: 396 [2025-04-13 22:00:42,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=444, Invalid=2636, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:00:42,522 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:42,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 98 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:00:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-04-13 22:00:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 345. [2025-04-13 22:00:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 2.7005813953488373) internal successors, (929), 344 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 929 transitions. [2025-04-13 22:00:42,721 INFO L79 Accepts]: Start accepts. Automaton has 345 states and 929 transitions. Word has length 29 [2025-04-13 22:00:42,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:42,721 INFO L485 AbstractCegarLoop]: Abstraction has 345 states and 929 transitions. [2025-04-13 22:00:42,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:42,722 INFO L278 IsEmpty]: Start isEmpty. Operand 345 states and 929 transitions. [2025-04-13 22:00:42,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:42,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:42,722 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:42,728 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:00:42,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 22:00:42,923 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:00:42,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1487996391, now seen corresponding path program 52 times [2025-04-13 22:00:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:42,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111143417] [2025-04-13 22:00:42,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:42,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:42,935 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:42,935 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:42,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:00:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:43,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111143417] [2025-04-13 22:00:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111143417] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:43,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274277861] [2025-04-13 22:00:43,100 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:43,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:43,102 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:00:43,103 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:00:43,201 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:43,232 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:43,232 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:43,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:43,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:00:43,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:43,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:43,409 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:00:43,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:00:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:00:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274277861] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:43,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 20 [2025-04-13 22:00:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680093951] [2025-04-13 22:00:43,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:43,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:00:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:43,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:00:43,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:00:43,486 INFO L87 Difference]: Start difference. First operand 345 states and 929 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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:00:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:44,492 INFO L93 Difference]: Finished difference Result 489 states and 1239 transitions. [2025-04-13 22:00:44,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:00:44,492 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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 29 [2025-04-13 22:00:44,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:44,494 INFO L225 Difference]: With dead ends: 489 [2025-04-13 22:00:44,494 INFO L226 Difference]: Without dead ends: 480 [2025-04-13 22:00:44,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:00:44,494 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:44,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 68 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-04-13 22:00:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 343. [2025-04-13 22:00:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 342 states have (on average 2.7017543859649122) internal successors, (924), 342 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 924 transitions. [2025-04-13 22:00:44,692 INFO L79 Accepts]: Start accepts. Automaton has 343 states and 924 transitions. Word has length 29 [2025-04-13 22:00:44,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:44,692 INFO L485 AbstractCegarLoop]: Abstraction has 343 states and 924 transitions. [2025-04-13 22:00:44,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 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:00:44,692 INFO L278 IsEmpty]: Start isEmpty. Operand 343 states and 924 transitions. [2025-04-13 22:00:44,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:44,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:44,693 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:44,699 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:00:44,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:44,894 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:00:44,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash 519538328, now seen corresponding path program 53 times [2025-04-13 22:00:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:44,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142160061] [2025-04-13 22:00:44,894 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:44,900 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:44,905 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:44,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:45,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142160061] [2025-04-13 22:00:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142160061] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:45,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505163546] [2025-04-13 22:00:45,288 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:00:45,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:45,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:45,291 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:00:45,291 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:00:45,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:45,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:45,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 22:00:45,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:45,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:00:45,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:45,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:45,705 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:00:45,706 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:00:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505163546] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:45,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:45,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 26 [2025-04-13 22:00:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500395185] [2025-04-13 22:00:45,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:45,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:00:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:45,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:00:45,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:00:45,799 INFO L87 Difference]: Start difference. First operand 343 states and 924 transitions. Second operand has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:47,211 INFO L93 Difference]: Finished difference Result 479 states and 1235 transitions. [2025-04-13 22:00:47,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:00:47,211 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:47,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:47,213 INFO L225 Difference]: With dead ends: 479 [2025-04-13 22:00:47,213 INFO L226 Difference]: Without dead ends: 471 [2025-04-13 22:00:47,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1795, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:00:47,214 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 104 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:47,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 119 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:00:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-04-13 22:00:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 333. [2025-04-13 22:00:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.677710843373494) internal successors, (889), 332 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 889 transitions. [2025-04-13 22:00:47,410 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 889 transitions. Word has length 29 [2025-04-13 22:00:47,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:47,410 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 889 transitions. [2025-04-13 22:00:47,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 26 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:47,411 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 889 transitions. [2025-04-13 22:00:47,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:47,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:47,411 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:47,418 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:00:47,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:47,612 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:00:47,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1287666061, now seen corresponding path program 54 times [2025-04-13 22:00:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:47,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368846806] [2025-04-13 22:00:47,612 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:47,618 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:47,626 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:47,626 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:47,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:47,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:47,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368846806] [2025-04-13 22:00:47,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368846806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:47,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489639340] [2025-04-13 22:00:47,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:00:47,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:47,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:47,861 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:00:47,862 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:00:47,961 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:47,981 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:47,981 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:00:47,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:47,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:00:47,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:48,315 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:48,416 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:00:48,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:00:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:48,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489639340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:48,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:48,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 13] total 37 [2025-04-13 22:00:48,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895606708] [2025-04-13 22:00:48,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:48,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:00:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:48,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:00:48,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:00:48,666 INFO L87 Difference]: Start difference. First operand 333 states and 889 transitions. Second operand has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:49,638 INFO L93 Difference]: Finished difference Result 392 states and 987 transitions. [2025-04-13 22:00:49,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:00:49,638 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:49,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:49,640 INFO L225 Difference]: With dead ends: 392 [2025-04-13 22:00:49,640 INFO L226 Difference]: Without dead ends: 367 [2025-04-13 22:00:49,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=2033, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:00:49,640 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 88 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:49,641 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:00:49,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-13 22:00:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 333. [2025-04-13 22:00:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.647590361445783) internal successors, (879), 332 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 879 transitions. [2025-04-13 22:00:49,840 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 879 transitions. Word has length 29 [2025-04-13 22:00:49,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:49,840 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 879 transitions. [2025-04-13 22:00:49,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.763157894736842) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:49,840 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 879 transitions. [2025-04-13 22:00:49,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:49,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:49,841 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:49,848 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:00:50,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:50,042 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:00:50,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:50,042 INFO L85 PathProgramCache]: Analyzing trace with hash 334721275, now seen corresponding path program 55 times [2025-04-13 22:00:50,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:50,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619337971] [2025-04-13 22:00:50,042 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:50,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:50,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:00:50,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:50,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:50,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:50,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:50,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619337971] [2025-04-13 22:00:50,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619337971] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:50,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069248744] [2025-04-13 22:00:50,587 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:00:50,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:50,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:50,589 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:00:50,589 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:00:50,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:00:50,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:50,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:00:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:00:50,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:51,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:51,200 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:00:51,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:00:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069248744] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:51,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:51,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 22:00:51,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528224867] [2025-04-13 22:00:51,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:51,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:00:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:51,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:00:51,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2545, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:00:51,735 INFO L87 Difference]: Start difference. First operand 333 states and 879 transitions. Second operand has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:52,704 INFO L93 Difference]: Finished difference Result 378 states and 986 transitions. [2025-04-13 22:00:52,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:00:52,705 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:00:52,705 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:52,706 INFO L225 Difference]: With dead ends: 378 [2025-04-13 22:00:52,707 INFO L226 Difference]: Without dead ends: 371 [2025-04-13 22:00:52,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=453, Invalid=3837, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:00:52,707 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 60 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:52,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 89 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:52,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-04-13 22:00:52,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 339. [2025-04-13 22:00:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.6449704142011834) internal successors, (894), 338 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 894 transitions. [2025-04-13 22:00:52,931 INFO L79 Accepts]: Start accepts. Automaton has 339 states and 894 transitions. Word has length 29 [2025-04-13 22:00:52,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:52,932 INFO L485 AbstractCegarLoop]: Abstraction has 339 states and 894 transitions. [2025-04-13 22:00:52,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:52,932 INFO L278 IsEmpty]: Start isEmpty. Operand 339 states and 894 transitions. [2025-04-13 22:00:52,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:52,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:52,932 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:52,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2025-04-13 22:00:53,133 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,SelfDestructingSolverStorable62 [2025-04-13 22:00:53,133 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:00:53,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1860292942, now seen corresponding path program 56 times [2025-04-13 22:00:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:53,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12890767] [2025-04-13 22:00:53,134 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:53,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:53,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:53,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:53,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:53,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12890767] [2025-04-13 22:00:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12890767] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:53,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019947097] [2025-04-13 22:00:53,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:00:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:53,597 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:00:53,598 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:00:53,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:53,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:53,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:00:53,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:53,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:00:53,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:54,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:54,291 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:00:54,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:00:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019947097] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:54,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:54,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 52 [2025-04-13 22:00:54,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613109285] [2025-04-13 22:00:54,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:54,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 22:00:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:54,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 22:00:54,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2456, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:00:54,798 INFO L87 Difference]: Start difference. First operand 339 states and 894 transitions. Second operand has 53 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:55,620 INFO L93 Difference]: Finished difference Result 355 states and 921 transitions. [2025-04-13 22:00:55,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:00:55,620 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 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 29 [2025-04-13 22:00:55,620 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:55,622 INFO L225 Difference]: With dead ends: 355 [2025-04-13 22:00:55,622 INFO L226 Difference]: Without dead ends: 341 [2025-04-13 22:00:55,622 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=3369, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:00:55,622 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:55,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 80 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-04-13 22:00:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2025-04-13 22:00:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 2.6398809523809526) internal successors, (887), 336 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 887 transitions. [2025-04-13 22:00:55,841 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 887 transitions. Word has length 29 [2025-04-13 22:00:55,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:55,841 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 887 transitions. [2025-04-13 22:00:55,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:55,841 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 887 transitions. [2025-04-13 22:00:55,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:55,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:55,841 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:55,848 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:00:56,042 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,SelfDestructingSolverStorable63 [2025-04-13 22:00:56,042 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:00:56,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1745389356, now seen corresponding path program 57 times [2025-04-13 22:00:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:56,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617135137] [2025-04-13 22:00:56,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:56,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:56,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:56,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:56,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:00:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:56,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617135137] [2025-04-13 22:00:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617135137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:56,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404710035] [2025-04-13 22:00:56,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:00:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:56,653 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:00:56,654 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:00:56,756 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:00:56,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:56,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:00:56,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:56,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:00:56,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:00:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:57,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:00:57,393 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:00:57,393 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:00:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:00:57,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404710035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:00:57,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:00:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 13] total 46 [2025-04-13 22:00:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429992198] [2025-04-13 22:00:57,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:00:57,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 22:00:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:00:57,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 22:00:57,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1948, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:00:57,686 INFO L87 Difference]: Start difference. First operand 337 states and 887 transitions. Second operand has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:00:59,075 INFO L93 Difference]: Finished difference Result 455 states and 1182 transitions. [2025-04-13 22:00:59,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:00:59,075 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 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 29 [2025-04-13 22:00:59,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:00:59,077 INFO L225 Difference]: With dead ends: 455 [2025-04-13 22:00:59,077 INFO L226 Difference]: Without dead ends: 427 [2025-04-13 22:00:59,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=335, Invalid=3325, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:00:59,078 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 159 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:00:59,078 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 106 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:00:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-04-13 22:00:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 355. [2025-04-13 22:00:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 2.6610169491525424) internal successors, (942), 354 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 942 transitions. [2025-04-13 22:00:59,307 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 942 transitions. Word has length 29 [2025-04-13 22:00:59,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:00:59,307 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 942 transitions. [2025-04-13 22:00:59,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 46 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:00:59,307 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 942 transitions. [2025-04-13 22:00:59,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:00:59,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:00:59,308 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:00:59,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2025-04-13 22:00:59,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:59,508 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:00:59,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:00:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1934150567, now seen corresponding path program 58 times [2025-04-13 22:00:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:00:59,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752359865] [2025-04-13 22:00:59,509 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:00:59,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:59,521 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:59,521 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:59,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:00:59,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:00:59,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752359865] [2025-04-13 22:00:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752359865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:00:59,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186995177] [2025-04-13 22:00:59,760 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:00:59,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:00:59,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:00:59,762 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:00:59,763 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:00:59,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:00:59,891 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:00:59,891 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:00:59,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:00:59,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:00:59,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:00,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:00,245 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:01:00,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:01:00,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186995177] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:00,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2025-04-13 22:01:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657744110] [2025-04-13 22:01:00,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:00,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:01:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:00,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:01:00,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:01:00,333 INFO L87 Difference]: Start difference. First operand 355 states and 942 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:01,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:01,467 INFO L93 Difference]: Finished difference Result 412 states and 1032 transitions. [2025-04-13 22:01:01,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:01:01,467 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:01,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:01,469 INFO L225 Difference]: With dead ends: 412 [2025-04-13 22:01:01,469 INFO L226 Difference]: Without dead ends: 381 [2025-04-13 22:01:01,469 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1710, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:01:01,469 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 94 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 110 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.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:01,469 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 110 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:01:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-04-13 22:01:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 357. [2025-04-13 22:01:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 2.603932584269663) internal successors, (927), 356 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 927 transitions. [2025-04-13 22:01:01,700 INFO L79 Accepts]: Start accepts. Automaton has 357 states and 927 transitions. Word has length 29 [2025-04-13 22:01:01,700 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:01,700 INFO L485 AbstractCegarLoop]: Abstraction has 357 states and 927 transitions. [2025-04-13 22:01:01,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:01,700 INFO L278 IsEmpty]: Start isEmpty. Operand 357 states and 927 transitions. [2025-04-13 22:01:01,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:01,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:01,701 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:01,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-13 22:01:01,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:01,901 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:01:01,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1189211126, now seen corresponding path program 59 times [2025-04-13 22:01:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:01,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336667361] [2025-04-13 22:01:01,902 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:01,916 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:01,923 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:01,924 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:01:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:02,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:02,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336667361] [2025-04-13 22:01:02,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336667361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:02,253 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567469962] [2025-04-13 22:01:02,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:02,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:02,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:02,255 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:01:02,256 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:01:02,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:02,410 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:02,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:01:02,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:02,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:01:02,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:02,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:03,004 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:01:03,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:01:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:03,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567469962] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:03,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:03,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 18] total 45 [2025-04-13 22:01:03,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038431318] [2025-04-13 22:01:03,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:03,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 22:01:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:03,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 22:01:03,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1853, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:01:03,415 INFO L87 Difference]: Start difference. First operand 357 states and 927 transitions. Second operand has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:04,600 INFO L93 Difference]: Finished difference Result 433 states and 1123 transitions. [2025-04-13 22:01:04,600 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:01:04,600 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:04,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:04,602 INFO L225 Difference]: With dead ends: 433 [2025-04-13 22:01:04,602 INFO L226 Difference]: Without dead ends: 419 [2025-04-13 22:01:04,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=338, Invalid=3202, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:01:04,603 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:04,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 121 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:01:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-04-13 22:01:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2025-04-13 22:01:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 2.6033519553072626) internal successors, (932), 358 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 932 transitions. [2025-04-13 22:01:04,837 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 932 transitions. Word has length 29 [2025-04-13 22:01:04,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:04,837 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 932 transitions. [2025-04-13 22:01:04,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.608695652173913) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:04,838 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 932 transitions. [2025-04-13 22:01:04,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:04,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:04,838 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:04,845 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:01:05,038 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,SelfDestructingSolverStorable66 [2025-04-13 22:01:05,039 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:01:05,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:05,039 INFO L85 PathProgramCache]: Analyzing trace with hash -517239660, now seen corresponding path program 60 times [2025-04-13 22:01:05,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:05,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290864015] [2025-04-13 22:01:05,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:05,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:05,046 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:05,056 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:05,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:01:05,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:05,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:05,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290864015] [2025-04-13 22:01:05,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290864015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:05,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6210336] [2025-04-13 22:01:05,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:05,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:05,253 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:01:05,253 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:01:05,366 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:05,390 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:05,390 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:01:05,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:05,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 22:01:05,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:05,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:01:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:05,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:06,259 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:06,260 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 85 treesize of output 88 [2025-04-13 22:01:06,275 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2025-04-13 22:01:06,281 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:01:06,282 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:01:06,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:06,288 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 85 treesize of output 88 [2025-04-13 22:01:06,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:01:06,311 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:06,311 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 168 treesize of output 164 [2025-04-13 22:01:06,320 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:01:06,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:01:06,377 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:01:06,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 22:01:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:01:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6210336] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:06,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:06,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 15] total 43 [2025-04-13 22:01:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350705166] [2025-04-13 22:01:06,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:06,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-13 22:01:06,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:06,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-13 22:01:06,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1688, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:01:06,660 INFO L87 Difference]: Start difference. First operand 359 states and 932 transitions. Second operand has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:08,108 INFO L93 Difference]: Finished difference Result 463 states and 1236 transitions. [2025-04-13 22:01:08,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:01:08,109 INFO L79 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 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 29 [2025-04-13 22:01:08,109 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:08,111 INFO L225 Difference]: With dead ends: 463 [2025-04-13 22:01:08,111 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 22:01:08,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=420, Invalid=3740, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:01:08,111 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 97 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:08,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 105 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:01:08,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 22:01:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 363. [2025-04-13 22:01:08,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.6022099447513813) internal successors, (942), 362 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 942 transitions. [2025-04-13 22:01:08,342 INFO L79 Accepts]: Start accepts. Automaton has 363 states and 942 transitions. Word has length 29 [2025-04-13 22:01:08,342 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:08,342 INFO L485 AbstractCegarLoop]: Abstraction has 363 states and 942 transitions. [2025-04-13 22:01:08,342 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:08,342 INFO L278 IsEmpty]: Start isEmpty. Operand 363 states and 942 transitions. [2025-04-13 22:01:08,343 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:08,343 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:08,343 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:08,349 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:01:08,543 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,SelfDestructingSolverStorable67 [2025-04-13 22:01:08,543 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:01:08,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1090281526, now seen corresponding path program 61 times [2025-04-13 22:01:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:08,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434749751] [2025-04-13 22:01:08,544 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:08,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:01:08,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:08,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:08,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:09,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434749751] [2025-04-13 22:01:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434749751] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:09,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309437591] [2025-04-13 22:01:09,045 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:09,046 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:01:09,048 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:01:09,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:01:09,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:09,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:09,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:09,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:01:09,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:09,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:09,659 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:01:09,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:01:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309437591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:10,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 22:01:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723269774] [2025-04-13 22:01:10,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:10,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:01:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:10,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:01:10,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2547, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:01:10,175 INFO L87 Difference]: Start difference. First operand 363 states and 942 transitions. Second operand has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 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:01:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:11,185 INFO L93 Difference]: Finished difference Result 403 states and 1048 transitions. [2025-04-13 22:01:11,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:01:11,185 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 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) Word has length 29 [2025-04-13 22:01:11,185 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:11,186 INFO L225 Difference]: With dead ends: 403 [2025-04-13 22:01:11,186 INFO L226 Difference]: Without dead ends: 393 [2025-04-13 22:01:11,187 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=453, Invalid=3837, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:01:11,187 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:11,187 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 107 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-13 22:01:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2025-04-13 22:01:11,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.601092896174863) internal successors, (952), 366 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 952 transitions. [2025-04-13 22:01:11,420 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 952 transitions. Word has length 29 [2025-04-13 22:01:11,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:11,421 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 952 transitions. [2025-04-13 22:01:11,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.5) internal successors, (81), 53 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:01:11,421 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 952 transitions. [2025-04-13 22:01:11,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:11,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:11,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:11,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 22:01:11,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:11,622 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:01:11,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1004394073, now seen corresponding path program 62 times [2025-04-13 22:01:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:11,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131820345] [2025-04-13 22:01:11,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:11,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:11,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:11,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:01:11,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:12,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:12,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131820345] [2025-04-13 22:01:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131820345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:12,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946158761] [2025-04-13 22:01:12,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:12,075 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:01:12,075 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:01:12,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:12,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:12,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:01:12,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:12,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 22:01:12,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:12,426 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:01:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:12,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:13,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:13,161 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 168 treesize of output 164 [2025-04-13 22:01:13,171 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:01:13,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:01:13,241 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:01:13,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 22:01:13,409 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:13,409 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 85 treesize of output 88 [2025-04-13 22:01:13,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:01:13,437 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:13,437 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 85 treesize of output 88 [2025-04-13 22:01:13,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:01:13,465 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:01:13,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:01:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:13,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946158761] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:13,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:13,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 49 [2025-04-13 22:01:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453159455] [2025-04-13 22:01:13,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:13,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-13 22:01:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:13,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-13 22:01:13,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2187, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:01:13,796 INFO L87 Difference]: Start difference. First operand 367 states and 952 transitions. Second operand has 50 states, 50 states have (on average 1.38) internal successors, (69), 49 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:01:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:14,835 INFO L93 Difference]: Finished difference Result 403 states and 1038 transitions. [2025-04-13 22:01:14,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:01:14,836 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.38) internal successors, (69), 49 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) Word has length 29 [2025-04-13 22:01:14,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:14,838 INFO L225 Difference]: With dead ends: 403 [2025-04-13 22:01:14,838 INFO L226 Difference]: Without dead ends: 396 [2025-04-13 22:01:14,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=363, Invalid=2943, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:01:14,838 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 40 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:14,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 109 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:01:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-04-13 22:01:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 367. [2025-04-13 22:01:15,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.601092896174863) internal successors, (952), 366 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 952 transitions. [2025-04-13 22:01:15,080 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 952 transitions. Word has length 29 [2025-04-13 22:01:15,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:15,080 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 952 transitions. [2025-04-13 22:01:15,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.38) internal successors, (69), 49 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:01:15,080 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 952 transitions. [2025-04-13 22:01:15,081 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:15,081 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:15,081 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:15,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 22:01:15,281 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,SelfDestructingSolverStorable69 [2025-04-13 22:01:15,281 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:01:15,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash 466538495, now seen corresponding path program 63 times [2025-04-13 22:01:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:15,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837975092] [2025-04-13 22:01:15,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:01:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:15,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-04-13 22:01:15,301 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:15,301 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:01:15,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:15,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837975092] [2025-04-13 22:01:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837975092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:15,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030709511] [2025-04-13 22:01:15,786 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:01:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:15,789 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:01:15,789 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:01:15,903 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 5 equivalence classes. [2025-04-13 22:01:15,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:15,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:01:15,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:15,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-13 22:01:15,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:15,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 22:01:16,053 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:01:16,084 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:01:16,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 22:01:16,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:01:16,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:01:16,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:01:16,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:01:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:16,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:17,164 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 22:01:17,165 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 22:01:17,210 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 22:01:17,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 22:01:17,233 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 22:01:17,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 22:01:18,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,145 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 22:01:18,148 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 46 treesize of output 37 [2025-04-13 22:01:18,152 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,152 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2025-04-13 22:01:18,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,163 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 22:01:18,165 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 32 treesize of output 26 [2025-04-13 22:01:18,170 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-13 22:01:18,181 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,181 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 22:01:18,188 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:01:18,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 125 treesize of output 101 [2025-04-13 22:01:18,192 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:01:18,240 INFO L325 Elim1Store]: treesize reduction 8, result has 91.9 percent of original size [2025-04-13 22:01:18,240 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 98 treesize of output 139 [2025-04-13 22:01:18,360 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,360 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-04-13 22:01:18,366 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:01:18,366 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 111 treesize of output 92 [2025-04-13 22:01:18,370 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:01:18,394 INFO L325 Elim1Store]: treesize reduction 10, result has 80.8 percent of original size [2025-04-13 22:01:18,394 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 90 [2025-04-13 22:01:18,438 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,438 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-04-13 22:01:18,444 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:01:18,444 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 76 treesize of output 66 [2025-04-13 22:01:18,447 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:01:18,470 INFO L325 Elim1Store]: treesize reduction 10, result has 80.8 percent of original size [2025-04-13 22:01:18,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 75 [2025-04-13 22:01:18,511 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,511 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-04-13 22:01:18,517 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:01:18,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 90 treesize of output 75 [2025-04-13 22:01:18,521 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:01:18,546 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-13 22:01:18,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 78 [2025-04-13 22:01:18,583 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,583 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 22:01:18,585 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 32 treesize of output 26 [2025-04-13 22:01:18,590 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-13 22:01:18,602 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,602 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 22:01:18,604 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 46 treesize of output 37 [2025-04-13 22:01:18,609 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:18,609 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2025-04-13 22:01:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 35 refuted. 4 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:01:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030709511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:19,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 17] total 53 [2025-04-13 22:01:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518202224] [2025-04-13 22:01:19,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:19,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:01:19,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:19,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:01:19,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2523, Unknown=31, NotChecked=0, Total=2862 [2025-04-13 22:01:19,326 INFO L87 Difference]: Start difference. First operand 367 states and 952 transitions. Second operand has 54 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:21,397 INFO L93 Difference]: Finished difference Result 509 states and 1307 transitions. [2025-04-13 22:01:21,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:01:21,397 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:21,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:21,399 INFO L225 Difference]: With dead ends: 509 [2025-04-13 22:01:21,399 INFO L226 Difference]: Without dead ends: 502 [2025-04-13 22:01:21,400 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=609, Invalid=5678, Unknown=33, NotChecked=0, Total=6320 [2025-04-13 22:01:21,400 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 112 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:21,400 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 130 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:01:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-04-13 22:01:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 371. [2025-04-13 22:01:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 2.6) internal successors, (962), 370 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 962 transitions. [2025-04-13 22:01:21,651 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 962 transitions. Word has length 29 [2025-04-13 22:01:21,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:21,651 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 962 transitions. [2025-04-13 22:01:21,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:21,651 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 962 transitions. [2025-04-13 22:01:21,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:21,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:21,651 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:21,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 22:01:21,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:21,852 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:01:21,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:21,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1767568999, now seen corresponding path program 64 times [2025-04-13 22:01:21,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:21,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046652917] [2025-04-13 22:01:21,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:21,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:21,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:21,864 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:21,864 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:21,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-04-13 22:01:22,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:22,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046652917] [2025-04-13 22:01:22,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046652917] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:22,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119155835] [2025-04-13 22:01:22,014 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:22,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:22,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:22,016 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:01:22,016 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:01:22,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:22,159 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:22,160 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:22,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:22,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:01:22,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:22,223 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:01:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:22,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:22,759 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:22,759 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 85 treesize of output 88 [2025-04-13 22:01:22,781 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:01:22,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:01:22,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:22,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 168 treesize of output 164 [2025-04-13 22:01:22,827 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:01:22,827 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:01:22,864 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:01:22,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-13 22:01:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:01:23,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119155835] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:23,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:23,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 11] total 28 [2025-04-13 22:01:23,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333495509] [2025-04-13 22:01:23,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:23,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:01:23,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:23,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:01:23,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:01:23,058 INFO L87 Difference]: Start difference. First operand 371 states and 962 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:23,924 INFO L93 Difference]: Finished difference Result 434 states and 1135 transitions. [2025-04-13 22:01:23,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:01:23,925 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:23,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:23,926 INFO L225 Difference]: With dead ends: 434 [2025-04-13 22:01:23,926 INFO L226 Difference]: Without dead ends: 427 [2025-04-13 22:01:23,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=1390, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:01:23,927 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:23,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 66 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-04-13 22:01:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 363. [2025-04-13 22:01:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.6022099447513813) internal successors, (942), 362 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 942 transitions. [2025-04-13 22:01:24,173 INFO L79 Accepts]: Start accepts. Automaton has 363 states and 942 transitions. Word has length 29 [2025-04-13 22:01:24,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:24,173 INFO L485 AbstractCegarLoop]: Abstraction has 363 states and 942 transitions. [2025-04-13 22:01:24,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:24,173 INFO L278 IsEmpty]: Start isEmpty. Operand 363 states and 942 transitions. [2025-04-13 22:01:24,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:24,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:24,174 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:24,180 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:01:24,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:24,374 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:01:24,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash -38521665, now seen corresponding path program 65 times [2025-04-13 22:01:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:24,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708917741] [2025-04-13 22:01:24,375 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:24,381 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 5 equivalence classes. [2025-04-13 22:01:24,387 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:24,387 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 22:01:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:24,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708917741] [2025-04-13 22:01:24,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708917741] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:24,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228400557] [2025-04-13 22:01:24,763 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:24,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:24,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:24,765 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:01:24,766 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:01:24,880 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 5 equivalence classes. [2025-04-13 22:01:24,931 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:24,931 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 22:01:24,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:24,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:01:24,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:25,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:25,185 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:01:25,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:01:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-13 22:01:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228400557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:25,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 6] total 31 [2025-04-13 22:01:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4321664] [2025-04-13 22:01:25,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:25,279 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:01:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:25,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:01:25,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:01:25,280 INFO L87 Difference]: Start difference. First operand 363 states and 942 transitions. Second operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:26,405 INFO L93 Difference]: Finished difference Result 450 states and 1137 transitions. [2025-04-13 22:01:26,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:01:26,405 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:26,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:26,407 INFO L225 Difference]: With dead ends: 450 [2025-04-13 22:01:26,407 INFO L226 Difference]: Without dead ends: 443 [2025-04-13 22:01:26,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=2387, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:01:26,408 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 71 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:26,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:26,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-04-13 22:01:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 355. [2025-04-13 22:01:26,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 2.593220338983051) internal successors, (918), 354 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:26,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 918 transitions. [2025-04-13 22:01:26,649 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 918 transitions. Word has length 29 [2025-04-13 22:01:26,650 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:26,650 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 918 transitions. [2025-04-13 22:01:26,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 31 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:26,650 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 918 transitions. [2025-04-13 22:01:26,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:26,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:26,650 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:26,657 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:01:26,850 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,SelfDestructingSolverStorable72 [2025-04-13 22:01:26,851 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:01:26,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1679822041, now seen corresponding path program 66 times [2025-04-13 22:01:26,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:26,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513241571] [2025-04-13 22:01:26,851 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:26,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:26,857 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 5 equivalence classes. [2025-04-13 22:01:26,867 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:26,867 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 22:01:26,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:27,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513241571] [2025-04-13 22:01:27,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513241571] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:27,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943959704] [2025-04-13 22:01:27,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:27,180 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:01:27,181 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:01:27,299 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 5 equivalence classes. [2025-04-13 22:01:27,322 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:27,322 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-13 22:01:27,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:27,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 22:01:27,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:27,555 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:01:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:27,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:28,320 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:28,320 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 168 treesize of output 164 [2025-04-13 22:01:28,329 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:01:28,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:01:28,391 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:01:28,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 22:01:28,540 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:28,540 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 85 treesize of output 88 [2025-04-13 22:01:28,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:01:28,571 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:01:28,572 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 85 treesize of output 88 [2025-04-13 22:01:28,589 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 36 [2025-04-13 22:01:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943959704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:28,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 51 [2025-04-13 22:01:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454966898] [2025-04-13 22:01:28,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:28,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 22:01:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:28,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 22:01:28,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2388, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:01:28,911 INFO L87 Difference]: Start difference. First operand 355 states and 918 transitions. Second operand has 52 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 51 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:30,233 INFO L93 Difference]: Finished difference Result 418 states and 1074 transitions. [2025-04-13 22:01:30,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:01:30,233 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 51 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:30,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:30,235 INFO L225 Difference]: With dead ends: 418 [2025-04-13 22:01:30,236 INFO L226 Difference]: Without dead ends: 411 [2025-04-13 22:01:30,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=343, Invalid=3197, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:01:30,236 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:30,236 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 125 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:01:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-04-13 22:01:30,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 361. [2025-04-13 22:01:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.5972222222222223) internal successors, (935), 360 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 935 transitions. [2025-04-13 22:01:30,496 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 935 transitions. Word has length 29 [2025-04-13 22:01:30,496 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:30,496 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 935 transitions. [2025-04-13 22:01:30,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 51 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:30,497 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 935 transitions. [2025-04-13 22:01:30,497 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:30,497 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:30,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:30,503 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:01:30,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:30,698 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:01:30,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1728475722, now seen corresponding path program 67 times [2025-04-13 22:01:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:30,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644636309] [2025-04-13 22:01:30,698 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:30,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:30,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:01:30,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:30,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:30,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:31,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644636309] [2025-04-13 22:01:31,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644636309] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:31,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862897269] [2025-04-13 22:01:31,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:31,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:31,183 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:01:31,184 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:01:31,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:01:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:31,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:01:31,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:31,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:31,826 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:01:31,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:01:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:32,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862897269] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:32,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:32,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 53 [2025-04-13 22:01:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610339929] [2025-04-13 22:01:32,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:32,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-13 22:01:32,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:32,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-13 22:01:32,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2552, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:01:32,357 INFO L87 Difference]: Start difference. First operand 361 states and 935 transitions. Second operand has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:33,300 INFO L93 Difference]: Finished difference Result 377 states and 962 transitions. [2025-04-13 22:01:33,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:01:33,301 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:33,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:33,302 INFO L225 Difference]: With dead ends: 377 [2025-04-13 22:01:33,302 INFO L226 Difference]: Without dead ends: 363 [2025-04-13 22:01:33,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=431, Invalid=3601, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:01:33,303 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:33,303 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-04-13 22:01:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2025-04-13 22:01:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.591666666666667) internal successors, (933), 360 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:33,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 933 transitions. [2025-04-13 22:01:33,547 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 933 transitions. Word has length 29 [2025-04-13 22:01:33,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:33,547 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 933 transitions. [2025-04-13 22:01:33,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.462962962962963) internal successors, (79), 53 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:33,548 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 933 transitions. [2025-04-13 22:01:33,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:33,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:33,548 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:33,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 22:01:33,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:33,749 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:01:33,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1222129456, now seen corresponding path program 68 times [2025-04-13 22:01:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:33,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468313428] [2025-04-13 22:01:33,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:33,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:33,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:33,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:01:33,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:34,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:34,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468313428] [2025-04-13 22:01:34,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468313428] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:34,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781249902] [2025-04-13 22:01:34,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:34,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:34,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:34,218 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:01:34,218 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:01:34,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:34,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:34,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:01:34,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:34,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:01:34,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:34,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:34,921 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:01:34,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:01:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:01:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781249902] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:35,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:35,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 51 [2025-04-13 22:01:35,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853153482] [2025-04-13 22:01:35,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:35,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-04-13 22:01:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:35,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-04-13 22:01:35,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=2358, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:01:35,421 INFO L87 Difference]: Start difference. First operand 361 states and 933 transitions. Second operand has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:36,331 INFO L93 Difference]: Finished difference Result 383 states and 977 transitions. [2025-04-13 22:01:36,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:01:36,331 INFO L79 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:36,331 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:36,333 INFO L225 Difference]: With dead ends: 383 [2025-04-13 22:01:36,333 INFO L226 Difference]: Without dead ends: 369 [2025-04-13 22:01:36,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 843 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=407, Invalid=3253, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:01:36,333 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:36,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 86 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-04-13 22:01:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2025-04-13 22:01:36,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.5901639344262297) internal successors, (948), 366 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 948 transitions. [2025-04-13 22:01:36,581 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 948 transitions. Word has length 29 [2025-04-13 22:01:36,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:36,581 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 948 transitions. [2025-04-13 22:01:36,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:36,581 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 948 transitions. [2025-04-13 22:01:36,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:36,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:36,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:36,588 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:01:36,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:36,782 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:01:36,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1759985034, now seen corresponding path program 69 times [2025-04-13 22:01:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:36,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491104459] [2025-04-13 22:01:36,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:01:36,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:36,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:36,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:36,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:01:36,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:37,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491104459] [2025-04-13 22:01:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491104459] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:37,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810474119] [2025-04-13 22:01:37,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:01:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:37,203 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:01:37,204 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:01:37,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:37,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:37,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:01:37,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:37,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:01:37,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:37,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:37,758 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:01:37,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:01:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810474119] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:38,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:38,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 38 [2025-04-13 22:01:38,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065944759] [2025-04-13 22:01:38,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:38,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:01:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:38,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:01:38,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:01:38,038 INFO L87 Difference]: Start difference. First operand 367 states and 948 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:38,784 INFO L93 Difference]: Finished difference Result 389 states and 992 transitions. [2025-04-13 22:01:38,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:01:38,784 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:38,784 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:38,786 INFO L225 Difference]: With dead ends: 389 [2025-04-13 22:01:38,786 INFO L226 Difference]: Without dead ends: 375 [2025-04-13 22:01:38,786 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=233, Invalid=1659, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:01:38,787 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:38,787 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 69 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-04-13 22:01:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-04-13 22:01:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 2.5891891891891894) internal successors, (958), 370 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 958 transitions. [2025-04-13 22:01:39,039 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 958 transitions. Word has length 29 [2025-04-13 22:01:39,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:39,039 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 958 transitions. [2025-04-13 22:01:39,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:39,039 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 958 transitions. [2025-04-13 22:01:39,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:39,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:39,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:39,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 22:01:39,240 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,SelfDestructingSolverStorable76 [2025-04-13 22:01:39,240 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:01:39,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2076716278, now seen corresponding path program 70 times [2025-04-13 22:01:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:39,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630604733] [2025-04-13 22:01:39,241 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:39,247 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:39,253 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:39,253 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:39,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-13 22:01:39,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:39,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630604733] [2025-04-13 22:01:39,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630604733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:39,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430385278] [2025-04-13 22:01:39,425 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:39,427 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:01:39,428 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:01:39,552 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:01:39,571 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:39,571 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:39,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:39,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:01:39,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:39,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:39,780 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:01:39,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:01:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-04-13 22:01:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430385278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:39,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 21 [2025-04-13 22:01:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454547502] [2025-04-13 22:01:39,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:39,859 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:01:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:39,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:01:39,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:01:39,859 INFO L87 Difference]: Start difference. First operand 371 states and 958 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:40,882 INFO L93 Difference]: Finished difference Result 493 states and 1200 transitions. [2025-04-13 22:01:40,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:01:40,882 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:40,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:40,884 INFO L225 Difference]: With dead ends: 493 [2025-04-13 22:01:40,884 INFO L226 Difference]: Without dead ends: 485 [2025-04-13 22:01:40,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:01:40,885 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:40,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-04-13 22:01:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 365. [2025-04-13 22:01:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 2.57967032967033) internal successors, (939), 364 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 939 transitions. [2025-04-13 22:01:41,135 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 939 transitions. Word has length 29 [2025-04-13 22:01:41,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:41,135 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 939 transitions. [2025-04-13 22:01:41,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:41,135 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 939 transitions. [2025-04-13 22:01:41,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:41,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:41,135 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:41,142 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:01:41,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:41,336 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:01:41,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 300874768, now seen corresponding path program 71 times [2025-04-13 22:01:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:41,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497235213] [2025-04-13 22:01:41,336 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:41,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:41,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:41,353 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:41,353 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:01:41,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:41,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:41,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497235213] [2025-04-13 22:01:41,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497235213] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:41,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604604570] [2025-04-13 22:01:41,705 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:41,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:41,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:41,707 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:01:41,707 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:01:41,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:01:41,873 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:41,873 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:01:41,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:41,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:01:41,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:01:42,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:42,234 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:01:42,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:01:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 22:01:42,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604604570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:42,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:42,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 7] total 31 [2025-04-13 22:01:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844158242] [2025-04-13 22:01:42,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:42,348 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:01:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:42,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:01:42,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=902, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:01:42,348 INFO L87 Difference]: Start difference. First operand 365 states and 939 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:44,001 INFO L93 Difference]: Finished difference Result 450 states and 1085 transitions. [2025-04-13 22:01:44,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:01:44,002 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:44,002 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:44,003 INFO L225 Difference]: With dead ends: 450 [2025-04-13 22:01:44,003 INFO L226 Difference]: Without dead ends: 424 [2025-04-13 22:01:44,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=232, Invalid=2630, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:01:44,004 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 91 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:44,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 127 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:01:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-04-13 22:01:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 358. [2025-04-13 22:01:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.546218487394958) internal successors, (909), 357 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 909 transitions. [2025-04-13 22:01:44,250 INFO L79 Accepts]: Start accepts. Automaton has 358 states and 909 transitions. Word has length 29 [2025-04-13 22:01:44,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:44,250 INFO L485 AbstractCegarLoop]: Abstraction has 358 states and 909 transitions. [2025-04-13 22:01:44,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:44,250 INFO L278 IsEmpty]: Start isEmpty. Operand 358 states and 909 transitions. [2025-04-13 22:01:44,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:01:44,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:44,251 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:44,258 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:01:44,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:44,451 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:01:44,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1409738540, now seen corresponding path program 72 times [2025-04-13 22:01:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:44,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872588949] [2025-04-13 22:01:44,452 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:44,458 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:01:44,464 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:44,465 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:01:44,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:44,802 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:44,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:44,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872588949] [2025-04-13 22:01:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872588949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:44,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10470592] [2025-04-13 22:01:44,802 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:44,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:44,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:44,804 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:01:44,804 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:01:44,933 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 3 equivalence classes. [2025-04-13 22:01:44,952 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:01:44,952 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:01:44,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:44,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:01:44,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:45,290 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:45,411 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:01:45,411 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:01:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10470592] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:45,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 13] total 38 [2025-04-13 22:01:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889332119] [2025-04-13 22:01:45,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:45,683 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:01:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:45,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:01:45,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:01:45,683 INFO L87 Difference]: Start difference. First operand 358 states and 909 transitions. Second operand has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:46,514 INFO L93 Difference]: Finished difference Result 379 states and 948 transitions. [2025-04-13 22:01:46,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:01:46,514 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 22:01:46,514 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:46,516 INFO L225 Difference]: With dead ends: 379 [2025-04-13 22:01:46,516 INFO L226 Difference]: Without dead ends: 362 [2025-04-13 22:01:46,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=209, Invalid=1861, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:01:46,516 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 35 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:46,516 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 89 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:01:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-13 22:01:46,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-04-13 22:01:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.5457063711911356) internal successors, (919), 361 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 919 transitions. [2025-04-13 22:01:46,766 INFO L79 Accepts]: Start accepts. Automaton has 362 states and 919 transitions. Word has length 29 [2025-04-13 22:01:46,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:46,766 INFO L485 AbstractCegarLoop]: Abstraction has 362 states and 919 transitions. [2025-04-13 22:01:46,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.564102564102564) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:46,766 INFO L278 IsEmpty]: Start isEmpty. Operand 362 states and 919 transitions. [2025-04-13 22:01:46,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:01:46,767 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:46,767 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:46,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2025-04-13 22:01:46,967 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,SelfDestructingSolverStorable79 [2025-04-13 22:01:46,967 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:01:46,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1955356045, now seen corresponding path program 73 times [2025-04-13 22:01:46,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:46,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385914407] [2025-04-13 22:01:46,968 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:46,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:46,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:01:46,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:46,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:46,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:47,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:47,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385914407] [2025-04-13 22:01:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385914407] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:47,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552645636] [2025-04-13 22:01:47,039 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:01:47,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:47,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:47,041 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:01:47,042 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:01:47,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:01:47,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:47,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:01:47,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:47,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:01:47,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:47,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552645636] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:47,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 14 [2025-04-13 22:01:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547025045] [2025-04-13 22:01:47,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:47,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:47,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:47,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:47,314 INFO L87 Difference]: Start difference. First operand 362 states and 919 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:01:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:48,132 INFO L93 Difference]: Finished difference Result 517 states and 1299 transitions. [2025-04-13 22:01:48,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:01:48,132 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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 30 [2025-04-13 22:01:48,132 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:48,134 INFO L225 Difference]: With dead ends: 517 [2025-04-13 22:01:48,134 INFO L226 Difference]: Without dead ends: 508 [2025-04-13 22:01:48,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:48,135 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:48,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 50 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:01:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-04-13 22:01:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 424. [2025-04-13 22:01:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 2.6973995271867612) internal successors, (1141), 423 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:01:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1141 transitions. [2025-04-13 22:01:48,443 INFO L79 Accepts]: Start accepts. Automaton has 424 states and 1141 transitions. Word has length 30 [2025-04-13 22:01:48,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:48,443 INFO L485 AbstractCegarLoop]: Abstraction has 424 states and 1141 transitions. [2025-04-13 22:01:48,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:01:48,443 INFO L278 IsEmpty]: Start isEmpty. Operand 424 states and 1141 transitions. [2025-04-13 22:01:48,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:01:48,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:48,443 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:48,450 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:01:48,644 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:48,644 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:01:48,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1189557201, now seen corresponding path program 74 times [2025-04-13 22:01:48,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:48,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987273444] [2025-04-13 22:01:48,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:48,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:48,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:01:48,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:48,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:01:48,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:48,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987273444] [2025-04-13 22:01:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987273444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:48,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324708365] [2025-04-13 22:01:48,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:01:48,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:48,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:48,719 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:01:48,720 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:01:48,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:01:48,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:48,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:01:48,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:48,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:01:48,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:48,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324708365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:48,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:48,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 5] total 14 [2025-04-13 22:01:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622658553] [2025-04-13 22:01:48,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:48,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:48,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:48,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:48,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:48,996 INFO L87 Difference]: Start difference. First operand 424 states and 1141 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:01:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:49,838 INFO L93 Difference]: Finished difference Result 544 states and 1405 transitions. [2025-04-13 22:01:49,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:01:49,840 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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 30 [2025-04-13 22:01:49,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:49,842 INFO L225 Difference]: With dead ends: 544 [2025-04-13 22:01:49,842 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 22:01:49,842 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:49,842 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 50 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:49,842 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 48 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:01:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 22:01:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 450. [2025-04-13 22:01:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 2.752783964365256) internal successors, (1236), 449 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1236 transitions. [2025-04-13 22:01:50,170 INFO L79 Accepts]: Start accepts. Automaton has 450 states and 1236 transitions. Word has length 30 [2025-04-13 22:01:50,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:50,170 INFO L485 AbstractCegarLoop]: Abstraction has 450 states and 1236 transitions. [2025-04-13 22:01:50,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 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:01:50,170 INFO L278 IsEmpty]: Start isEmpty. Operand 450 states and 1236 transitions. [2025-04-13 22:01:50,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:01:50,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:50,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:50,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2025-04-13 22:01:50,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:50,371 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:01:50,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1075370483, now seen corresponding path program 75 times [2025-04-13 22:01:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:50,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513027462] [2025-04-13 22:01:50,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:01:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:50,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:01:50,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:50,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:01:50,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:01:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:50,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513027462] [2025-04-13 22:01:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513027462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:50,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291485866] [2025-04-13 22:01:50,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:01:50,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:50,627 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:01:50,628 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:01:50,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 3 equivalence classes. [2025-04-13 22:01:50,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:50,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:01:50,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:50,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:01:50,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:50,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:51,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291485866] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:51,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:51,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 5] total 28 [2025-04-13 22:01:51,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920190403] [2025-04-13 22:01:51,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:51,034 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:01:51,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:51,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:01:51,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:01:51,035 INFO L87 Difference]: Start difference. First operand 450 states and 1236 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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:01:53,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:53,800 INFO L93 Difference]: Finished difference Result 1277 states and 3435 transitions. [2025-04-13 22:01:53,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:01:53,801 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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) Word has length 30 [2025-04-13 22:01:53,801 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:53,803 INFO L225 Difference]: With dead ends: 1277 [2025-04-13 22:01:53,803 INFO L226 Difference]: Without dead ends: 755 [2025-04-13 22:01:53,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=2464, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:01:53,804 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 120 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 3002 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:53,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 161 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 22:01:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-04-13 22:01:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 575. [2025-04-13 22:01:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 2.6602787456445993) internal successors, (1527), 574 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1527 transitions. [2025-04-13 22:01:54,240 INFO L79 Accepts]: Start accepts. Automaton has 575 states and 1527 transitions. Word has length 30 [2025-04-13 22:01:54,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:54,240 INFO L485 AbstractCegarLoop]: Abstraction has 575 states and 1527 transitions. [2025-04-13 22:01:54,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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:01:54,240 INFO L278 IsEmpty]: Start isEmpty. Operand 575 states and 1527 transitions. [2025-04-13 22:01:54,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:01:54,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:54,241 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:54,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2025-04-13 22:01:54,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:54,441 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:01:54,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1726315345, now seen corresponding path program 76 times [2025-04-13 22:01:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:54,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221475253] [2025-04-13 22:01:54,442 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:54,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:01:54,452 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:54,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:54,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:54,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221475253] [2025-04-13 22:01:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221475253] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:54,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055535245] [2025-04-13 22:01:54,508 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:01:54,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:54,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:54,510 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:01:54,510 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:01:54,644 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:01:54,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:54,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:01:54,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:54,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:01:54,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:54,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-04-13 22:01:54,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055535245] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:54,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 5] total 14 [2025-04-13 22:01:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875819040] [2025-04-13 22:01:54,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:54,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:01:54,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:54,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:01:54,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:54,804 INFO L87 Difference]: Start difference. First operand 575 states and 1527 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:01:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:55,913 INFO L93 Difference]: Finished difference Result 702 states and 1815 transitions. [2025-04-13 22:01:55,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:01:55,913 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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 30 [2025-04-13 22:01:55,913 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:55,916 INFO L225 Difference]: With dead ends: 702 [2025-04-13 22:01:55,916 INFO L226 Difference]: Without dead ends: 693 [2025-04-13 22:01:55,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:01:55,916 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:55,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 65 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:01:55,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-04-13 22:01:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 619. [2025-04-13 22:01:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 2.7006472491909386) internal successors, (1669), 618 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1669 transitions. [2025-04-13 22:01:56,401 INFO L79 Accepts]: Start accepts. Automaton has 619 states and 1669 transitions. Word has length 30 [2025-04-13 22:01:56,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:56,401 INFO L485 AbstractCegarLoop]: Abstraction has 619 states and 1669 transitions. [2025-04-13 22:01:56,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 15 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:01:56,401 INFO L278 IsEmpty]: Start isEmpty. Operand 619 states and 1669 transitions. [2025-04-13 22:01:56,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:01:56,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:56,402 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:56,410 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:01:56,602 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,SelfDestructingSolverStorable83 [2025-04-13 22:01:56,602 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:01:56,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash -980957998, now seen corresponding path program 77 times [2025-04-13 22:01:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:56,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624053833] [2025-04-13 22:01:56,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:56,609 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 5 equivalence classes. [2025-04-13 22:01:56,613 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:56,614 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 22:01:56,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:01:56,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:56,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624053833] [2025-04-13 22:01:56,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624053833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:56,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041889217] [2025-04-13 22:01:56,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:01:56,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:56,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:56,694 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:01:56,695 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:01:56,833 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 5 equivalence classes. [2025-04-13 22:01:56,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:01:56,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 22:01:56,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:01:56,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:01:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:01:57,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:01:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:01:57,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041889217] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:01:57,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:01:57,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 22:01:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084266845] [2025-04-13 22:01:57,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:01:57,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:01:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:01:57,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:01:57,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=491, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:01:57,105 INFO L87 Difference]: Start difference. First operand 619 states and 1669 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 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:01:58,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:01:58,780 INFO L93 Difference]: Finished difference Result 1303 states and 3600 transitions. [2025-04-13 22:01:58,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:01:58,780 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 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 30 [2025-04-13 22:01:58,781 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:01:58,784 INFO L225 Difference]: With dead ends: 1303 [2025-04-13 22:01:58,784 INFO L226 Difference]: Without dead ends: 768 [2025-04-13 22:01:58,784 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:01:58,785 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:01:58,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 44 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:01:58,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-04-13 22:01:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 643. [2025-04-13 22:01:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 2.6931464174454827) internal successors, (1729), 642 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:01:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1729 transitions. [2025-04-13 22:01:59,340 INFO L79 Accepts]: Start accepts. Automaton has 643 states and 1729 transitions. Word has length 30 [2025-04-13 22:01:59,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:01:59,340 INFO L485 AbstractCegarLoop]: Abstraction has 643 states and 1729 transitions. [2025-04-13 22:01:59,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 26 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:01:59,340 INFO L278 IsEmpty]: Start isEmpty. Operand 643 states and 1729 transitions. [2025-04-13 22:01:59,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:01:59,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:01:59,341 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:01:59,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-04-13 22:01:59,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:59,541 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:01:59,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:01:59,542 INFO L85 PathProgramCache]: Analyzing trace with hash 934898629, now seen corresponding path program 78 times [2025-04-13 22:01:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:01:59,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037487172] [2025-04-13 22:01:59,542 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:01:59,548 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:01:59,555 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:01:59,555 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:01:59,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:01:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:01:59,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037487172] [2025-04-13 22:01:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037487172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:01:59,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493719627] [2025-04-13 22:01:59,732 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:01:59,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:01:59,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:01:59,734 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:01:59,734 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:01:59,870 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:01:59,916 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:01:59,916 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:01:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:01:59,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:01:59,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:02:00,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:02:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493719627] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:00,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 5] total 28 [2025-04-13 22:02:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414113558] [2025-04-13 22:02:00,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:00,145 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:02:00,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:00,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:02:00,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:02:00,145 INFO L87 Difference]: Start difference. First operand 643 states and 1729 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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:02:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:03,802 INFO L93 Difference]: Finished difference Result 2053 states and 5494 transitions. [2025-04-13 22:02:03,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 22:02:03,802 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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) Word has length 31 [2025-04-13 22:02:03,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:03,807 INFO L225 Difference]: With dead ends: 2053 [2025-04-13 22:02:03,807 INFO L226 Difference]: Without dead ends: 1265 [2025-04-13 22:02:03,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=2856, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:02:03,808 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 179 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:03,808 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 113 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:02:03,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2025-04-13 22:02:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 851. [2025-04-13 22:02:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 2.6494117647058824) internal successors, (2252), 850 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 2252 transitions. [2025-04-13 22:02:04,526 INFO L79 Accepts]: Start accepts. Automaton has 851 states and 2252 transitions. Word has length 31 [2025-04-13 22:02:04,526 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:04,526 INFO L485 AbstractCegarLoop]: Abstraction has 851 states and 2252 transitions. [2025-04-13 22:02:04,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 29 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:02:04,526 INFO L278 IsEmpty]: Start isEmpty. Operand 851 states and 2252 transitions. [2025-04-13 22:02:04,527 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:02:04,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:04,528 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:04,534 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:02:04,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:04,728 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:02:04,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 14943351, now seen corresponding path program 79 times [2025-04-13 22:02:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:04,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179885879] [2025-04-13 22:02:04,728 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:02:04,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:04,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:02:04,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:02:04,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:02:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:02:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:04,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179885879] [2025-04-13 22:02:04,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179885879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:04,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471395923] [2025-04-13 22:02:04,830 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:02:04,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:04,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:04,832 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:02:04,832 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:02:04,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:02:04,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:02:04,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:02:04,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:04,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:02:04,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:05,134 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:02:05,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:02:05,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471395923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:05,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 32 [2025-04-13 22:02:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396727085] [2025-04-13 22:02:05,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:05,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:02:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:05,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:02:05,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=843, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:02:05,267 INFO L87 Difference]: Start difference. First operand 851 states and 2252 transitions. Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:06,786 INFO L93 Difference]: Finished difference Result 978 states and 2494 transitions. [2025-04-13 22:02:06,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:02:06,786 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:02:06,786 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:06,789 INFO L225 Difference]: With dead ends: 978 [2025-04-13 22:02:06,789 INFO L226 Difference]: Without dead ends: 501 [2025-04-13 22:02:06,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=493, Invalid=2263, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:02:06,790 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:06,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 90 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:02:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-04-13 22:02:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-04-13 22:02:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 500 states have (on average 2.926) internal successors, (1463), 500 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1463 transitions. [2025-04-13 22:02:07,244 INFO L79 Accepts]: Start accepts. Automaton has 501 states and 1463 transitions. Word has length 31 [2025-04-13 22:02:07,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:07,244 INFO L485 AbstractCegarLoop]: Abstraction has 501 states and 1463 transitions. [2025-04-13 22:02:07,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:07,244 INFO L278 IsEmpty]: Start isEmpty. Operand 501 states and 1463 transitions. [2025-04-13 22:02:07,245 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:02:07,245 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:07,245 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:07,251 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:02:07,445 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,SelfDestructingSolverStorable86 [2025-04-13 22:02:07,445 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:02:07,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1849203570, now seen corresponding path program 80 times [2025-04-13 22:02:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:07,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38883099] [2025-04-13 22:02:07,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:07,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 22:02:07,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:02:07,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:02:07,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:02:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:07,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38883099] [2025-04-13 22:02:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38883099] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:07,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728006974] [2025-04-13 22:02:07,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:07,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:07,991 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:02:07,991 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:02:08,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 22:02:08,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:02:08,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:02:08,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:08,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:02:08,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:02:08,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:08,779 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:02:08,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:02:09,340 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:02:09,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728006974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:09,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:09,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 57 [2025-04-13 22:02:09,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439407188] [2025-04-13 22:02:09,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:09,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-13 22:02:09,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:09,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-13 22:02:09,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=2873, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:02:09,341 INFO L87 Difference]: Start difference. First operand 501 states and 1463 transitions. Second operand has 58 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:11,722 INFO L93 Difference]: Finished difference Result 770 states and 2144 transitions. [2025-04-13 22:02:11,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:02:11,722 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:02:11,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:11,726 INFO L225 Difference]: With dead ends: 770 [2025-04-13 22:02:11,726 INFO L226 Difference]: Without dead ends: 758 [2025-04-13 22:02:11,726 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1901 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=713, Invalid=5767, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 22:02:11,726 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 103 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:11,726 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 116 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:02:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-04-13 22:02:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 515. [2025-04-13 22:02:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 2.9182879377431905) internal successors, (1500), 514 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1500 transitions. [2025-04-13 22:02:12,186 INFO L79 Accepts]: Start accepts. Automaton has 515 states and 1500 transitions. Word has length 32 [2025-04-13 22:02:12,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:12,186 INFO L485 AbstractCegarLoop]: Abstraction has 515 states and 1500 transitions. [2025-04-13 22:02:12,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 57 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:12,187 INFO L278 IsEmpty]: Start isEmpty. Operand 515 states and 1500 transitions. [2025-04-13 22:02:12,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:02:12,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:12,187 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:12,194 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:02:12,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:12,388 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:02:12,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -384903924, now seen corresponding path program 81 times [2025-04-13 22:02:12,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:12,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066736720] [2025-04-13 22:02:12,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:12,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:12,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-04-13 22:02:12,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:02:12,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:02:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:02:12,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:12,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066736720] [2025-04-13 22:02:12,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066736720] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:12,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292750986] [2025-04-13 22:02:12,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:12,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:12,950 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:02:12,951 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:02:13,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-04-13 22:02:13,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:02:13,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:02:13,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:13,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 22:02:13,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:13,618 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:02:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:02:13,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:14,353 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:14,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 85 treesize of output 88 [2025-04-13 22:02:14,370 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:14,371 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 22:02:14,384 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:14,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 85 treesize of output 88 [2025-04-13 22:02:14,416 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:14,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 22:02:14,428 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:14,428 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 168 treesize of output 164 [2025-04-13 22:02:14,460 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:02:14,461 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:02:14,505 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:02:14,506 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-13 22:02:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:02:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292750986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:15,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 58 [2025-04-13 22:02:15,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957332918] [2025-04-13 22:02:15,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:15,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-13 22:02:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:15,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-13 22:02:15,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=2996, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:02:15,060 INFO L87 Difference]: Start difference. First operand 515 states and 1500 transitions. Second operand has 59 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 58 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:17,933 INFO L93 Difference]: Finished difference Result 810 states and 2240 transitions. [2025-04-13 22:02:17,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 22:02:17,933 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 58 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:02:17,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:17,936 INFO L225 Difference]: With dead ends: 810 [2025-04-13 22:02:17,936 INFO L226 Difference]: Without dead ends: 801 [2025-04-13 22:02:17,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1570 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=630, Invalid=4920, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 22:02:17,937 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 107 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:17,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 155 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:02:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2025-04-13 22:02:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 521. [2025-04-13 22:02:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.925) internal successors, (1521), 520 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1521 transitions. [2025-04-13 22:02:18,402 INFO L79 Accepts]: Start accepts. Automaton has 521 states and 1521 transitions. Word has length 32 [2025-04-13 22:02:18,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:18,402 INFO L485 AbstractCegarLoop]: Abstraction has 521 states and 1521 transitions. [2025-04-13 22:02:18,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 58 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:18,402 INFO L278 IsEmpty]: Start isEmpty. Operand 521 states and 1521 transitions. [2025-04-13 22:02:18,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:02:18,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:18,403 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:18,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-04-13 22:02:18,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:18,604 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:02:18,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1242835288, now seen corresponding path program 82 times [2025-04-13 22:02:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:18,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200860193] [2025-04-13 22:02:18,604 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:02:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:18,611 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:02:18,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:18,617 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:02:18,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:02:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:18,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200860193] [2025-04-13 22:02:18,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200860193] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:18,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10432224] [2025-04-13 22:02:18,896 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:02:18,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:18,898 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:02:18,899 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:02:19,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:02:19,068 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:19,069 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:02:19,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:19,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:02:19,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:02:19,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:19,499 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:02:19,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:02:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:02:19,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10432224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:19,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:19,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-04-13 22:02:19,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853047117] [2025-04-13 22:02:19,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:19,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:02:19,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:19,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:02:19,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:02:19,628 INFO L87 Difference]: Start difference. First operand 521 states and 1521 transitions. Second operand has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:21,713 INFO L93 Difference]: Finished difference Result 698 states and 1912 transitions. [2025-04-13 22:02:21,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:02:21,713 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:02:21,713 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:21,716 INFO L225 Difference]: With dead ends: 698 [2025-04-13 22:02:21,716 INFO L226 Difference]: Without dead ends: 691 [2025-04-13 22:02:21,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=2466, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:02:21,716 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 544 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:21,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 114 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:02:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-04-13 22:02:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 486. [2025-04-13 22:02:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.9278350515463916) internal successors, (1420), 485 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1420 transitions. [2025-04-13 22:02:22,159 INFO L79 Accepts]: Start accepts. Automaton has 486 states and 1420 transitions. Word has length 33 [2025-04-13 22:02:22,159 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:22,160 INFO L485 AbstractCegarLoop]: Abstraction has 486 states and 1420 transitions. [2025-04-13 22:02:22,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.088235294117647) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:22,160 INFO L278 IsEmpty]: Start isEmpty. Operand 486 states and 1420 transitions. [2025-04-13 22:02:22,160 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:02:22,160 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:22,160 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:22,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2025-04-13 22:02:22,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-13 22:02:22,361 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:02:22,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 994806535, now seen corresponding path program 83 times [2025-04-13 22:02:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:22,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557007352] [2025-04-13 22:02:22,361 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:02:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:22,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:02:22,377 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:22,377 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:02:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:02:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:22,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557007352] [2025-04-13 22:02:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557007352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:22,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720675658] [2025-04-13 22:02:22,802 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:02:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:22,804 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:02:22,805 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:02:22,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:02:23,006 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:23,006 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:02:23,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:23,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:02:23,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:02:23,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:23,676 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:02:23,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:02:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:02:23,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720675658] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:23,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:23,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 11] total 41 [2025-04-13 22:02:23,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883806727] [2025-04-13 22:02:23,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:23,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 22:02:23,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:23,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 22:02:23,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1607, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:02:23,839 INFO L87 Difference]: Start difference. First operand 486 states and 1420 transitions. Second operand has 42 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:25,845 INFO L93 Difference]: Finished difference Result 535 states and 1504 transitions. [2025-04-13 22:02:25,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:02:25,846 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:02:25,846 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:25,848 INFO L225 Difference]: With dead ends: 535 [2025-04-13 22:02:25,848 INFO L226 Difference]: Without dead ends: 488 [2025-04-13 22:02:25,849 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=4147, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:02:25,849 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 120 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:25,849 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 176 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:02:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-04-13 22:02:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 486. [2025-04-13 22:02:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 2.894845360824742) internal successors, (1404), 485 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1404 transitions. [2025-04-13 22:02:26,291 INFO L79 Accepts]: Start accepts. Automaton has 486 states and 1404 transitions. Word has length 33 [2025-04-13 22:02:26,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:26,291 INFO L485 AbstractCegarLoop]: Abstraction has 486 states and 1404 transitions. [2025-04-13 22:02:26,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:26,291 INFO L278 IsEmpty]: Start isEmpty. Operand 486 states and 1404 transitions. [2025-04-13 22:02:26,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:02:26,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:26,292 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:26,300 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:02:26,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:26,493 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:02:26,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1233135047, now seen corresponding path program 84 times [2025-04-13 22:02:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:26,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001692279] [2025-04-13 22:02:26,493 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:02:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:26,500 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:02:26,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:26,514 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:02:26,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:27,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:27,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001692279] [2025-04-13 22:02:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001692279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:27,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629494971] [2025-04-13 22:02:27,778 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:02:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:27,780 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:02:27,780 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:02:27,929 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:02:27,955 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:27,955 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:02:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:27,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:02:27,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:28,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:29,000 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:02:29,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:02:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:29,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629494971] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:29,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:29,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 66 [2025-04-13 22:02:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224000571] [2025-04-13 22:02:29,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:29,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-04-13 22:02:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:29,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-04-13 22:02:29,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=4117, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:02:29,948 INFO L87 Difference]: Start difference. First operand 486 states and 1404 transitions. Second operand has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 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:02:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:36,214 INFO L93 Difference]: Finished difference Result 1482 states and 4061 transitions. [2025-04-13 22:02:36,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 22:02:36,214 INFO L79 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 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) Word has length 33 [2025-04-13 22:02:36,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:36,218 INFO L225 Difference]: With dead ends: 1482 [2025-04-13 22:02:36,218 INFO L226 Difference]: Without dead ends: 1474 [2025-04-13 22:02:36,219 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2967 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=850, Invalid=13192, Unknown=0, NotChecked=0, Total=14042 [2025-04-13 22:02:36,219 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 204 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 4374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:36,219 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 254 Invalid, 4374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 22:02:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-04-13 22:02:36,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 786. [2025-04-13 22:02:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.078980891719745) internal successors, (2417), 785 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2417 transitions. [2025-04-13 22:02:36,825 INFO L79 Accepts]: Start accepts. Automaton has 786 states and 2417 transitions. Word has length 33 [2025-04-13 22:02:36,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:36,825 INFO L485 AbstractCegarLoop]: Abstraction has 786 states and 2417 transitions. [2025-04-13 22:02:36,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 66 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:02:36,825 INFO L278 IsEmpty]: Start isEmpty. Operand 786 states and 2417 transitions. [2025-04-13 22:02:36,826 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:02:36,826 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:36,826 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:36,833 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:02:37,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:37,027 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:02:37,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:37,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1547981395, now seen corresponding path program 85 times [2025-04-13 22:02:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:37,027 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635151766] [2025-04-13 22:02:37,027 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:02:37,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:37,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:02:37,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:37,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:02:37,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:37,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:37,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635151766] [2025-04-13 22:02:37,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635151766] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:37,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510887118] [2025-04-13 22:02:37,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:02:37,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:37,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:37,644 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:02:37,645 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:02:37,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:02:37,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:37,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:02:37,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:37,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:02:37,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:38,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:38,561 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:02:38,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:02:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 30 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510887118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:39,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:39,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 22:02:39,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75806109] [2025-04-13 22:02:39,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:39,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 22:02:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:39,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 22:02:39,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=3874, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:02:39,321 INFO L87 Difference]: Start difference. First operand 786 states and 2417 transitions. Second operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 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:02:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:41,350 INFO L93 Difference]: Finished difference Result 890 states and 2709 transitions. [2025-04-13 22:02:41,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:02:41,351 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 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) Word has length 33 [2025-04-13 22:02:41,351 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:41,354 INFO L225 Difference]: With dead ends: 890 [2025-04-13 22:02:41,354 INFO L226 Difference]: Without dead ends: 882 [2025-04-13 22:02:41,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=612, Invalid=6194, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 22:02:41,354 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 90 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:41,354 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 133 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:02:41,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-04-13 22:02:41,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 786. [2025-04-13 22:02:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.078980891719745) internal successors, (2417), 785 states have internal predecessors, (2417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:41,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2417 transitions. [2025-04-13 22:02:41,967 INFO L79 Accepts]: Start accepts. Automaton has 786 states and 2417 transitions. Word has length 33 [2025-04-13 22:02:41,967 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:41,967 INFO L485 AbstractCegarLoop]: Abstraction has 786 states and 2417 transitions. [2025-04-13 22:02:41,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 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:02:41,967 INFO L278 IsEmpty]: Start isEmpty. Operand 786 states and 2417 transitions. [2025-04-13 22:02:41,968 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:02:41,968 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:41,969 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:41,975 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:02:42,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:42,169 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:02:42,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:42,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1973998824, now seen corresponding path program 86 times [2025-04-13 22:02:42,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:42,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781588383] [2025-04-13 22:02:42,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:42,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:42,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:02:42,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:42,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:02:42,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:42,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781588383] [2025-04-13 22:02:42,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781588383] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:42,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935286342] [2025-04-13 22:02:42,736 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:02:42,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:42,738 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:02:42,739 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:02:42,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:02:42,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:42,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:02:42,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:42,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:02:42,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:43,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:43,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:43,667 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:02:43,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:02:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:44,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935286342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:44,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:44,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 64 [2025-04-13 22:02:44,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943720383] [2025-04-13 22:02:44,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:44,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-04-13 22:02:44,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:44,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-04-13 22:02:44,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=3738, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:02:44,341 INFO L87 Difference]: Start difference. First operand 786 states and 2417 transitions. Second operand has 65 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:02:45,858 INFO L93 Difference]: Finished difference Result 797 states and 2432 transitions. [2025-04-13 22:02:45,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:02:45,858 INFO L79 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:02:45,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:02:45,861 INFO L225 Difference]: With dead ends: 797 [2025-04-13 22:02:45,861 INFO L226 Difference]: Without dead ends: 786 [2025-04-13 22:02:45,862 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1622 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=549, Invalid=4563, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 22:02:45,862 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:02:45,862 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 126 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:02:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-04-13 22:02:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2025-04-13 22:02:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.0738853503184713) internal successors, (2413), 785 states have internal predecessors, (2413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2413 transitions. [2025-04-13 22:02:46,457 INFO L79 Accepts]: Start accepts. Automaton has 786 states and 2413 transitions. Word has length 33 [2025-04-13 22:02:46,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:02:46,457 INFO L485 AbstractCegarLoop]: Abstraction has 786 states and 2413 transitions. [2025-04-13 22:02:46,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:02:46,457 INFO L278 IsEmpty]: Start isEmpty. Operand 786 states and 2413 transitions. [2025-04-13 22:02:46,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:02:46,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:02:46,458 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:02:46,465 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:02:46,658 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,SelfDestructingSolverStorable93 [2025-04-13 22:02:46,659 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:02:46,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:02:46,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1139464715, now seen corresponding path program 87 times [2025-04-13 22:02:46,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:02:46,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777826800] [2025-04-13 22:02:46,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:02:46,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:02:46,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:46,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:02:46,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:47,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:02:47,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777826800] [2025-04-13 22:02:47,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777826800] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:02:47,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447768441] [2025-04-13 22:02:47,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:02:47,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:02:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:02:47,261 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:02:47,261 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:02:47,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:02:47,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:02:47,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:02:47,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:02:47,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 22:02:47,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:02:47,834 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:02:48,295 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:48,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:02:49,660 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:49,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 163 treesize of output 159 [2025-04-13 22:02:49,693 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:02:49,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2025-04-13 22:02:49,731 INFO L325 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2025-04-13 22:02:49,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 194 [2025-04-13 22:02:49,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:02:49,895 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 80 treesize of output 83 [2025-04-13 22:02:49,914 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 30 [2025-04-13 22:02:49,921 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 22:02:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 16 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:02:50,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447768441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:02:50,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:02:50,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2025-04-13 22:02:50,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284016010] [2025-04-13 22:02:50,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:02:50,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-13 22:02:50,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:02:50,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-13 22:02:50,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=4141, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 22:02:50,658 INFO L87 Difference]: Start difference. First operand 786 states and 2413 transitions. Second operand has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 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:02:59,153 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:10,044 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:14,604 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:19,294 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:21,547 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:28,453 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:33,205 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:45,500 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:54,070 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:56,915 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:03:57,968 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:00,529 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:01,686 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:05,875 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:09,927 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:13,940 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:16,470 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:21,249 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:24,635 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:27,957 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:32,212 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:38,343 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:42,353 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:43,968 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:48,122 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:04:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:04:48,195 INFO L93 Difference]: Finished difference Result 5241 states and 14956 transitions. [2025-04-13 22:04:48,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-04-13 22:04:48,203 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 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) Word has length 33 [2025-04-13 22:04:48,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:04:48,214 INFO L225 Difference]: With dead ends: 5241 [2025-04-13 22:04:48,214 INFO L226 Difference]: Without dead ends: 5136 [2025-04-13 22:04:48,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8123 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=3296, Invalid=27152, Unknown=2, NotChecked=0, Total=30450 [2025-04-13 22:04:48,216 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 633 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 4957 mSolverCounterSat, 227 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 5203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 4957 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 83.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:04:48,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 322 Invalid, 5203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 4957 Invalid, 19 Unknown, 0 Unchecked, 83.0s Time] [2025-04-13 22:04:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2025-04-13 22:04:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 2586. [2025-04-13 22:04:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2586 states, 2585 states have (on average 3.4177949709864603) internal successors, (8835), 2585 states have internal predecessors, (8835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 8835 transitions. [2025-04-13 22:04:50,344 INFO L79 Accepts]: Start accepts. Automaton has 2586 states and 8835 transitions. Word has length 33 [2025-04-13 22:04:50,344 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:04:50,344 INFO L485 AbstractCegarLoop]: Abstraction has 2586 states and 8835 transitions. [2025-04-13 22:04:50,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 67 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:04:50,345 INFO L278 IsEmpty]: Start isEmpty. Operand 2586 states and 8835 transitions. [2025-04-13 22:04:50,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:04:50,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:04:50,349 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:50,356 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:04:50,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:04:50,549 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:04:50,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:04:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1114529648, now seen corresponding path program 88 times [2025-04-13 22:04:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:04:50,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297274846] [2025-04-13 22:04:50,550 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:04:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:04:50,557 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:04:50,563 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:04:50,563 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:04:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:04:50,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:04:50,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297274846] [2025-04-13 22:04:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297274846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:04:50,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921763897] [2025-04-13 22:04:50,779 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:04:50,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:04:50,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:04:50,781 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:04:50,781 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:04:50,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:04:50,960 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:04:50,961 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:04:50,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:50,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:04:50,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:04:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:04:51,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:04:51,239 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:04:51,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:04:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:04:51,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921763897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:04:51,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:04:51,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 25 [2025-04-13 22:04:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641500583] [2025-04-13 22:04:51,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:04:51,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:04:51,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:04:51,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:04:51,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:04:51,349 INFO L87 Difference]: Start difference. First operand 2586 states and 8835 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:55,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:04:55,284 INFO L93 Difference]: Finished difference Result 2671 states and 8973 transitions. [2025-04-13 22:04:55,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:04:55,285 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:04:55,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:04:55,292 INFO L225 Difference]: With dead ends: 2671 [2025-04-13 22:04:55,292 INFO L226 Difference]: Without dead ends: 2636 [2025-04-13 22:04:55,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1488, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:04:55,292 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 99 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:04:55,292 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 85 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:04:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-04-13 22:04:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2580. [2025-04-13 22:04:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2580 states, 2579 states have (on average 3.3575029081039163) internal successors, (8659), 2579 states have internal predecessors, (8659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:57,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2580 states to 2580 states and 8659 transitions. [2025-04-13 22:04:57,280 INFO L79 Accepts]: Start accepts. Automaton has 2580 states and 8659 transitions. Word has length 33 [2025-04-13 22:04:57,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:04:57,281 INFO L485 AbstractCegarLoop]: Abstraction has 2580 states and 8659 transitions. [2025-04-13 22:04:57,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 25 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:04:57,281 INFO L278 IsEmpty]: Start isEmpty. Operand 2580 states and 8659 transitions. [2025-04-13 22:04:57,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:04:57,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:04:57,284 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:04:57,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-04-13 22:04:57,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:04:57,485 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:04:57,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:04:57,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1225352168, now seen corresponding path program 89 times [2025-04-13 22:04:57,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:04:57,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792556806] [2025-04-13 22:04:57,485 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:04:57,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:04:57,492 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:04:57,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:04:57,503 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:04:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:04:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:04:58,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792556806] [2025-04-13 22:04:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792556806] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:04:58,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801699454] [2025-04-13 22:04:58,075 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:04:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:04:58,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:04:58,076 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:04:58,077 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:04:58,251 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:04:58,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:04:58,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:04:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:04:58,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:04:58,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:04:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:04:58,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:04:58,797 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:04:58,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:04:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:04:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801699454] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:04:58,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:04:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 7] total 42 [2025-04-13 22:04:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248022281] [2025-04-13 22:04:58,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:04:58,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 22:04:58,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:04:58,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 22:04:58,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1669, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:04:58,961 INFO L87 Difference]: Start difference. First operand 2580 states and 8659 transitions. Second operand has 43 states, 43 states have (on average 1.813953488372093) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:05:03,624 INFO L93 Difference]: Finished difference Result 2834 states and 9264 transitions. [2025-04-13 22:05:03,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 22:05:03,625 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.813953488372093) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:05:03,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:05:03,632 INFO L225 Difference]: With dead ends: 2834 [2025-04-13 22:05:03,632 INFO L226 Difference]: Without dead ends: 2819 [2025-04-13 22:05:03,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=342, Invalid=4488, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:05:03,633 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 141 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:05:03,633 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 117 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:05:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2025-04-13 22:05:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2576. [2025-04-13 22:05:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2575 states have (on average 3.344854368932039) internal successors, (8613), 2575 states have internal predecessors, (8613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 8613 transitions. [2025-04-13 22:05:05,647 INFO L79 Accepts]: Start accepts. Automaton has 2576 states and 8613 transitions. Word has length 33 [2025-04-13 22:05:05,647 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:05:05,647 INFO L485 AbstractCegarLoop]: Abstraction has 2576 states and 8613 transitions. [2025-04-13 22:05:05,647 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.813953488372093) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:05,647 INFO L278 IsEmpty]: Start isEmpty. Operand 2576 states and 8613 transitions. [2025-04-13 22:05:05,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:05:05,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:05:05,651 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:05:05,658 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:05:05,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:05,851 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:05:05,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:05:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1863245177, now seen corresponding path program 90 times [2025-04-13 22:05:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:05:05,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838551953] [2025-04-13 22:05:05,852 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:05:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:05:05,859 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:05:05,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:05,871 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:05:05,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:06,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:05:06,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838551953] [2025-04-13 22:05:06,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838551953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:05:06,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721570503] [2025-04-13 22:05:06,688 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:05:06,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:06,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:05:06,690 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:05:06,690 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:05:06,851 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:05:06,911 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:06,911 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:05:06,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:06,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-04-13 22:05:06,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:05:07,265 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:05:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:07,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:05:08,519 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:05:08,520 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 168 treesize of output 164 [2025-04-13 22:05:08,535 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:05:08,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:05:08,591 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:05:08,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 22:05:08,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:05:08,805 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 85 treesize of output 88 [2025-04-13 22:05:08,826 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:05:08,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-13 22:05:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:05:09,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721570503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:05:09,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:05:09,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 18] total 63 [2025-04-13 22:05:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064818612] [2025-04-13 22:05:09,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:05:09,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-13 22:05:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:05:09,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-13 22:05:09,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3718, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:05:09,140 INFO L87 Difference]: Start difference. First operand 2576 states and 8613 transitions. Second operand has 64 states, 64 states have (on average 1.453125) internal successors, (93), 63 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:05:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:05:21,358 INFO L93 Difference]: Finished difference Result 4659 states and 15505 transitions. [2025-04-13 22:05:21,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 22:05:21,358 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.453125) internal successors, (93), 63 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) Word has length 33 [2025-04-13 22:05:21,358 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:05:21,370 INFO L225 Difference]: With dead ends: 4659 [2025-04-13 22:05:21,370 INFO L226 Difference]: Without dead ends: 4425 [2025-04-13 22:05:21,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4370 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1255, Invalid=15257, Unknown=0, NotChecked=0, Total=16512 [2025-04-13 22:05:21,372 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 305 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 4099 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:05:21,372 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 322 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4099 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 22:05:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2025-04-13 22:05:23,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 2529. [2025-04-13 22:05:23,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2528 states have (on average 3.2250791139240507) internal successors, (8153), 2528 states have internal predecessors, (8153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 8153 transitions. [2025-04-13 22:05:23,827 INFO L79 Accepts]: Start accepts. Automaton has 2529 states and 8153 transitions. Word has length 33 [2025-04-13 22:05:23,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:05:23,827 INFO L485 AbstractCegarLoop]: Abstraction has 2529 states and 8153 transitions. [2025-04-13 22:05:23,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.453125) internal successors, (93), 63 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:05:23,827 INFO L278 IsEmpty]: Start isEmpty. Operand 2529 states and 8153 transitions. [2025-04-13 22:05:23,831 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:05:23,831 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:05:23,831 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:05:23,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2025-04-13 22:05:24,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:24,032 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:05:24,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:05:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 56040788, now seen corresponding path program 91 times [2025-04-13 22:05:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:05:24,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37591434] [2025-04-13 22:05:24,032 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:05:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:05:24,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:05:24,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:24,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:05:24,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:05:24,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37591434] [2025-04-13 22:05:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37591434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:05:24,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908446347] [2025-04-13 22:05:24,668 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:05:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:05:24,670 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:05:24,671 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:05:24,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:05:24,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:24,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:05:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:24,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:05:24,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:05:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:25,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:05:25,605 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:05:25,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:05:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 33 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:26,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908446347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:05:26,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:05:26,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 22:05:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013029268] [2025-04-13 22:05:26,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:05:26,380 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 22:05:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:05:26,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 22:05:26,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=3878, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:05:26,380 INFO L87 Difference]: Start difference. First operand 2529 states and 8153 transitions. Second operand has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:05:30,925 INFO L93 Difference]: Finished difference Result 2544 states and 8176 transitions. [2025-04-13 22:05:30,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:05:30,925 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:05:30,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:05:30,932 INFO L225 Difference]: With dead ends: 2544 [2025-04-13 22:05:30,932 INFO L226 Difference]: Without dead ends: 2531 [2025-04-13 22:05:30,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1375 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=591, Invalid=5889, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 22:05:30,933 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 44 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:05:30,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 161 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:05:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2025-04-13 22:05:33,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2529. [2025-04-13 22:05:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2529 states, 2528 states have (on average 3.2234968354430378) internal successors, (8149), 2528 states have internal predecessors, (8149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2529 states to 2529 states and 8149 transitions. [2025-04-13 22:05:33,483 INFO L79 Accepts]: Start accepts. Automaton has 2529 states and 8149 transitions. Word has length 33 [2025-04-13 22:05:33,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:05:33,483 INFO L485 AbstractCegarLoop]: Abstraction has 2529 states and 8149 transitions. [2025-04-13 22:05:33,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:33,483 INFO L278 IsEmpty]: Start isEmpty. Operand 2529 states and 8149 transitions. [2025-04-13 22:05:33,487 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:05:33,487 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:05:33,487 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:05:33,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2025-04-13 22:05:33,687 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,SelfDestructingSolverStorable98 [2025-04-13 22:05:33,687 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:05:33,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:05:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 156794391, now seen corresponding path program 92 times [2025-04-13 22:05:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:05:33,688 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158020962] [2025-04-13 22:05:33,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:05:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:05:33,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:05:33,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:33,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:05:33,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:05:34,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158020962] [2025-04-13 22:05:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158020962] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:05:34,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172623372] [2025-04-13 22:05:34,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:05:34,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:34,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:05:34,295 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:05:34,296 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:05:34,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:05:34,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:34,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:05:34,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:34,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:05:34,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:05:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:35,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:05:35,275 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:05:35,276 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:05:35,973 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172623372] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:05:35,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:05:35,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 64 [2025-04-13 22:05:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487890607] [2025-04-13 22:05:35,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:05:35,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-04-13 22:05:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:05:35,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-04-13 22:05:35,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=3736, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:05:35,975 INFO L87 Difference]: Start difference. First operand 2529 states and 8149 transitions. Second operand has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:05:40,923 INFO L93 Difference]: Finished difference Result 2704 states and 8627 transitions. [2025-04-13 22:05:40,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:05:40,924 INFO L79 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:05:40,924 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:05:40,931 INFO L225 Difference]: With dead ends: 2704 [2025-04-13 22:05:40,931 INFO L226 Difference]: Without dead ends: 2687 [2025-04-13 22:05:40,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=585, Invalid=5267, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 22:05:40,932 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:05:40,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 145 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:05:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-04-13 22:05:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2535. [2025-04-13 22:05:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2534 states have (on average 3.224151539068666) internal successors, (8170), 2534 states have internal predecessors, (8170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 8170 transitions. [2025-04-13 22:05:43,351 INFO L79 Accepts]: Start accepts. Automaton has 2535 states and 8170 transitions. Word has length 33 [2025-04-13 22:05:43,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:05:43,351 INFO L485 AbstractCegarLoop]: Abstraction has 2535 states and 8170 transitions. [2025-04-13 22:05:43,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:05:43,351 INFO L278 IsEmpty]: Start isEmpty. Operand 2535 states and 8170 transitions. [2025-04-13 22:05:43,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:05:43,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:05:43,355 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:05:43,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2025-04-13 22:05:43,555 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,SelfDestructingSolverStorable99 [2025-04-13 22:05:43,555 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:05:43,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:05:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash 929781468, now seen corresponding path program 93 times [2025-04-13 22:05:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:05:43,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18209738] [2025-04-13 22:05:43,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:05:43,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:05:43,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:05:43,586 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:43,587 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:05:43,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:05:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:05:44,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18209738] [2025-04-13 22:05:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18209738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:05:44,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476694201] [2025-04-13 22:05:44,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:05:44,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:05:44,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:05:44,140 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:05:44,140 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:05:44,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:05:44,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:05:44,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:05:44,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:05:44,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-04-13 22:05:44,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:05:44,695 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:05:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:05:45,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:05:46,399 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:05:46,400 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 168 treesize of output 164 [2025-04-13 22:05:46,437 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:05:46,437 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2025-04-13 22:05:46,495 INFO L325 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2025-04-13 22:05:46,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 200 [2025-04-13 22:05:46,764 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:05:46,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 85 treesize of output 88 [2025-04-13 22:05:46,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2025-04-13 22:05:46,791 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:05:46,791 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:05:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:05:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476694201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:05:47,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:05:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 19] total 60 [2025-04-13 22:05:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273274459] [2025-04-13 22:05:47,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:05:47,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-13 22:05:47,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:05:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-13 22:05:47,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3361, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:05:47,271 INFO L87 Difference]: Start difference. First operand 2535 states and 8170 transitions. Second operand has 61 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 60 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:27,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:27,213 INFO L93 Difference]: Finished difference Result 7423 states and 22324 transitions. [2025-04-13 22:06:27,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2025-04-13 22:06:27,214 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 60 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:06:27,214 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:27,227 INFO L225 Difference]: With dead ends: 7423 [2025-04-13 22:06:27,228 INFO L226 Difference]: Without dead ends: 5644 [2025-04-13 22:06:27,231 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12088 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=4112, Invalid=38530, Unknown=0, NotChecked=0, Total=42642 [2025-04-13 22:06:27,232 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 724 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 8105 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 8105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:27,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 461 Invalid, 8331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 8105 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-04-13 22:06:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2025-04-13 22:06:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 3382. [2025-04-13 22:06:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3382 states, 3381 states have (on average 3.1875184856551315) internal successors, (10777), 3381 states have internal predecessors, (10777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 10777 transitions. [2025-04-13 22:06:30,759 INFO L79 Accepts]: Start accepts. Automaton has 3382 states and 10777 transitions. Word has length 33 [2025-04-13 22:06:30,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:30,759 INFO L485 AbstractCegarLoop]: Abstraction has 3382 states and 10777 transitions. [2025-04-13 22:06:30,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 60 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:30,759 INFO L278 IsEmpty]: Start isEmpty. Operand 3382 states and 10777 transitions. [2025-04-13 22:06:30,764 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:30,764 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:30,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:30,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2025-04-13 22:06:30,964 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,SelfDestructingSolverStorable100 [2025-04-13 22:06:30,964 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:06:30,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1764315577, now seen corresponding path program 94 times [2025-04-13 22:06:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:30,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259936573] [2025-04-13 22:06:30,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:06:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:30,972 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:06:30,977 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:30,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:06:30,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 22:06:31,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:31,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259936573] [2025-04-13 22:06:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259936573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:31,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609057090] [2025-04-13 22:06:31,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:06:31,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:31,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:31,185 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:06:31,186 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:06:31,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:06:31,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:31,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:06:31,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:31,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:06:31,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:06:31,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:31,722 INFO L325 Elim1Store]: treesize reduction 24, result has 68.8 percent of original size [2025-04-13 22:06:31,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 71 [2025-04-13 22:06:31,812 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 22:06:31,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609057090] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:31,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:31,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 7] total 27 [2025-04-13 22:06:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825425819] [2025-04-13 22:06:31,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:31,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:06:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:31,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:06:31,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:06:31,813 INFO L87 Difference]: Start difference. First operand 3382 states and 10777 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 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:06:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:39,903 INFO L93 Difference]: Finished difference Result 3823 states and 11794 transitions. [2025-04-13 22:06:39,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:06:39,903 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 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) Word has length 33 [2025-04-13 22:06:39,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:39,914 INFO L225 Difference]: With dead ends: 3823 [2025-04-13 22:06:39,914 INFO L226 Difference]: Without dead ends: 3776 [2025-04-13 22:06:39,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:06:39,915 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 109 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:39,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 94 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:06:39,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2025-04-13 22:06:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3356. [2025-04-13 22:06:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3355 states have (on average 3.1725782414307004) internal successors, (10644), 3355 states have internal predecessors, (10644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 10644 transitions. [2025-04-13 22:06:43,395 INFO L79 Accepts]: Start accepts. Automaton has 3356 states and 10644 transitions. Word has length 33 [2025-04-13 22:06:43,396 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:43,396 INFO L485 AbstractCegarLoop]: Abstraction has 3356 states and 10644 transitions. [2025-04-13 22:06:43,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 27 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:06:43,396 INFO L278 IsEmpty]: Start isEmpty. Operand 3356 states and 10644 transitions. [2025-04-13 22:06:43,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:43,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:43,402 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:43,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2025-04-13 22:06:43,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:43,602 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:06:43,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1678428124, now seen corresponding path program 95 times [2025-04-13 22:06:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:43,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114925815] [2025-04-13 22:06:43,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:06:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:43,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 22:06:43,620 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:43,620 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 22:06:43,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:44,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:44,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114925815] [2025-04-13 22:06:44,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114925815] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:44,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499768567] [2025-04-13 22:06:44,190 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:06:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:44,192 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:06:44,193 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:06:44,364 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 5 equivalence classes. [2025-04-13 22:06:44,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:44,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-13 22:06:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:44,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 22:06:44,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:45,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:45,304 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:06:45,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:06:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:45,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499768567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:45,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:45,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 22] total 54 [2025-04-13 22:06:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148680072] [2025-04-13 22:06:45,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:45,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 22:06:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:45,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 22:06:45,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2650, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:06:45,729 INFO L87 Difference]: Start difference. First operand 3356 states and 10644 transitions. Second operand has 55 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 54 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:06:51,973 INFO L93 Difference]: Finished difference Result 3528 states and 11076 transitions. [2025-04-13 22:06:51,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:06:51,973 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 54 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:06:51,973 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:06:51,983 INFO L225 Difference]: With dead ends: 3528 [2025-04-13 22:06:51,983 INFO L226 Difference]: Without dead ends: 3519 [2025-04-13 22:06:51,984 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=448, Invalid=3334, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:06:51,984 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:06:51,984 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 120 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:06:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2025-04-13 22:06:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3366. [2025-04-13 22:06:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3366 states, 3365 states have (on average 3.1723625557206536) internal successors, (10675), 3365 states have internal predecessors, (10675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 10675 transitions. [2025-04-13 22:06:55,502 INFO L79 Accepts]: Start accepts. Automaton has 3366 states and 10675 transitions. Word has length 33 [2025-04-13 22:06:55,502 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:06:55,502 INFO L485 AbstractCegarLoop]: Abstraction has 3366 states and 10675 transitions. [2025-04-13 22:06:55,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 54 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:06:55,502 INFO L278 IsEmpty]: Start isEmpty. Operand 3366 states and 10675 transitions. [2025-04-13 22:06:55,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:06:55,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:06:55,507 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:06:55,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2025-04-13 22:06:55,707 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,SelfDestructingSolverStorable102 [2025-04-13 22:06:55,707 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:06:55,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:06:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2077313103, now seen corresponding path program 96 times [2025-04-13 22:06:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:06:55,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716542418] [2025-04-13 22:06:55,708 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:06:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:06:55,715 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:06:55,730 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:55,730 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:06:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:06:56,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:06:56,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716542418] [2025-04-13 22:06:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716542418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:06:56,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025023050] [2025-04-13 22:06:56,270 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:06:56,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:06:56,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:06:56,272 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:06:56,273 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:06:56,450 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:06:56,509 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:06:56,509 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:06:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:06:56,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-04-13 22:06:56,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:06:56,850 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:06:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:57,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:06:58,126 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:06:58,127 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 168 treesize of output 164 [2025-04-13 22:06:58,162 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:06:58,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:06:58,206 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:06:58,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 194 [2025-04-13 22:06:58,409 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 22:06:58,416 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:06:58,416 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 85 treesize of output 88 [2025-04-13 22:06:58,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2025-04-13 22:06:58,445 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:06:58,446 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 22 [2025-04-13 22:06:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:06:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025023050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:06:59,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:06:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 23] total 62 [2025-04-13 22:06:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137335426] [2025-04-13 22:06:59,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:06:59,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-04-13 22:06:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:06:59,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-04-13 22:06:59,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=3455, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:06:59,008 INFO L87 Difference]: Start difference. First operand 3366 states and 10675 transitions. Second operand has 63 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:26,885 INFO L93 Difference]: Finished difference Result 5054 states and 14889 transitions. [2025-04-13 22:07:26,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2025-04-13 22:07:26,885 INFO L79 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 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 33 [2025-04-13 22:07:26,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:26,897 INFO L225 Difference]: With dead ends: 5054 [2025-04-13 22:07:26,897 INFO L226 Difference]: Without dead ends: 4833 [2025-04-13 22:07:26,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10194 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=3141, Invalid=32015, Unknown=0, NotChecked=0, Total=35156 [2025-04-13 22:07:26,900 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 531 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 5510 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 5510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:26,900 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 272 Invalid, 5804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 5510 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 22:07:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-04-13 22:07:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 3630. [2025-04-13 22:07:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 3.181317167263709) internal successors, (11545), 3629 states have internal predecessors, (11545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 11545 transitions. [2025-04-13 22:07:30,791 INFO L79 Accepts]: Start accepts. Automaton has 3630 states and 11545 transitions. Word has length 33 [2025-04-13 22:07:30,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:30,792 INFO L485 AbstractCegarLoop]: Abstraction has 3630 states and 11545 transitions. [2025-04-13 22:07:30,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 62 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:30,792 INFO L278 IsEmpty]: Start isEmpty. Operand 3630 states and 11545 transitions. [2025-04-13 22:07:30,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:30,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:30,797 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:30,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2025-04-13 22:07:30,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 22:07:30,998 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:07:30,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1403255626, now seen corresponding path program 97 times [2025-04-13 22:07:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:30,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678401554] [2025-04-13 22:07:30,998 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:07:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:31,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:07:31,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:31,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:07:31,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 6 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:31,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678401554] [2025-04-13 22:07:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678401554] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:31,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082875179] [2025-04-13 22:07:31,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:07:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:31,660 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:07:31,660 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:07:31,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:07:31,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:31,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:07:31,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:31,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:07:31,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 20 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:32,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:07:32,578 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:07:32,579 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:07:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082875179] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:07:33,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:07:33,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 22:07:33,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416646172] [2025-04-13 22:07:33,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:07:33,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 22:07:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:33,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 22:07:33,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=429, Invalid=3861, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:07:33,354 INFO L87 Difference]: Start difference. First operand 3630 states and 11545 transitions. Second operand has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:40,623 INFO L93 Difference]: Finished difference Result 3864 states and 12170 transitions. [2025-04-13 22:07:40,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:07:40,623 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:07:40,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:40,634 INFO L225 Difference]: With dead ends: 3864 [2025-04-13 22:07:40,634 INFO L226 Difference]: Without dead ends: 3845 [2025-04-13 22:07:40,635 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1566 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=643, Invalid=6163, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 22:07:40,635 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 100 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:40,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 120 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:07:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2025-04-13 22:07:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3622. [2025-04-13 22:07:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3621 states have (on average 3.1811654239160454) internal successors, (11519), 3621 states have internal predecessors, (11519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 11519 transitions. [2025-04-13 22:07:44,497 INFO L79 Accepts]: Start accepts. Automaton has 3622 states and 11519 transitions. Word has length 33 [2025-04-13 22:07:44,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:44,498 INFO L485 AbstractCegarLoop]: Abstraction has 3622 states and 11519 transitions. [2025-04-13 22:07:44,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:44,498 INFO L278 IsEmpty]: Start isEmpty. Operand 3622 states and 11519 transitions. [2025-04-13 22:07:44,502 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:44,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:44,503 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:44,509 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:07:44,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:44,703 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:07:44,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1679798615, now seen corresponding path program 98 times [2025-04-13 22:07:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:44,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837728689] [2025-04-13 22:07:44,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:44,711 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:44,717 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:44,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:44,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:45,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837728689] [2025-04-13 22:07:45,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837728689] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:45,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810585271] [2025-04-13 22:07:45,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:07:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:45,319 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:07:45,320 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:07:45,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:07:45,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:45,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:07:45,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:45,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:07:45,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:46,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:07:46,311 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:07:46,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:07:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 30 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810585271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:07:46,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:07:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 64 [2025-04-13 22:07:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608349525] [2025-04-13 22:07:46,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:07:46,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-04-13 22:07:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:07:46,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-04-13 22:07:46,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=3722, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:07:46,988 INFO L87 Difference]: Start difference. First operand 3622 states and 11519 transitions. Second operand has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:07:54,132 INFO L93 Difference]: Finished difference Result 3776 states and 11900 transitions. [2025-04-13 22:07:54,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:07:54,133 INFO L79 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:07:54,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:07:54,143 INFO L225 Difference]: With dead ends: 3776 [2025-04-13 22:07:54,143 INFO L226 Difference]: Without dead ends: 3760 [2025-04-13 22:07:54,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=583, Invalid=4819, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 22:07:54,145 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:07:54,145 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 122 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:07:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2025-04-13 22:07:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3626. [2025-04-13 22:07:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3625 states have (on average 3.177655172413793) internal successors, (11519), 3625 states have internal predecessors, (11519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 11519 transitions. [2025-04-13 22:07:58,062 INFO L79 Accepts]: Start accepts. Automaton has 3626 states and 11519 transitions. Word has length 33 [2025-04-13 22:07:58,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:07:58,062 INFO L485 AbstractCegarLoop]: Abstraction has 3626 states and 11519 transitions. [2025-04-13 22:07:58,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 64 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:07:58,063 INFO L278 IsEmpty]: Start isEmpty. Operand 3626 states and 11519 transitions. [2025-04-13 22:07:58,068 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:07:58,068 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:07:58,068 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:07:58,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2025-04-13 22:07:58,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:58,268 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:07:58,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:07:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash -2108822415, now seen corresponding path program 99 times [2025-04-13 22:07:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:07:58,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701818862] [2025-04-13 22:07:58,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:07:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:07:58,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:07:58,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:58,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:07:58,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 26 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:07:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:07:59,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701818862] [2025-04-13 22:07:59,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701818862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:07:59,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127790972] [2025-04-13 22:07:59,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:07:59,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:07:59,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:07:59,119 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:07:59,120 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:07:59,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:07:59,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:07:59,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:07:59,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:07:59,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-13 22:07:59,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:07:59,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 22:07:59,610 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:07:59,655 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:07:59,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 22:07:59,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:07:59,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:07:59,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:07:59,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 22:07:59,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:08:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:00,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:08:00,978 INFO L325 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2025-04-13 22:08:00,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2025-04-13 22:08:01,007 INFO L325 Elim1Store]: treesize reduction 42, result has 53.3 percent of original size [2025-04-13 22:08:01,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 137 [2025-04-13 22:08:01,989 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:01,989 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2025-04-13 22:08:01,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 32 treesize of output 26 [2025-04-13 22:08:01,999 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,000 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-04-13 22:08:02,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,015 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-04-13 22:08:02,017 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 46 treesize of output 37 [2025-04-13 22:08:02,022 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 27 [2025-04-13 22:08:02,034 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,034 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2025-04-13 22:08:02,040 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:08:02,040 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 111 treesize of output 92 [2025-04-13 22:08:02,043 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:08:02,067 INFO L325 Elim1Store]: treesize reduction 10, result has 80.8 percent of original size [2025-04-13 22:08:02,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 90 [2025-04-13 22:08:02,126 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,126 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-04-13 22:08:02,132 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:08:02,133 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 76 treesize of output 66 [2025-04-13 22:08:02,135 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:08:02,160 INFO L325 Elim1Store]: treesize reduction 10, result has 80.8 percent of original size [2025-04-13 22:08:02,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 75 [2025-04-13 22:08:02,215 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,215 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2025-04-13 22:08:02,222 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:08:02,222 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 101 [2025-04-13 22:08:02,226 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:08:02,226 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:08:02,278 INFO L325 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2025-04-13 22:08:02,278 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 98 treesize of output 129 [2025-04-13 22:08:02,388 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2025-04-13 22:08:02,393 INFO L325 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-04-13 22:08:02,393 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 76 treesize of output 61 [2025-04-13 22:08:02,396 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:08:02,421 INFO L325 Elim1Store]: treesize reduction 10, result has 80.8 percent of original size [2025-04-13 22:08:02,421 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 61 treesize of output 75 [2025-04-13 22:08:02,460 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:08:02,460 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2025-04-13 22:08:02,467 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:08:02,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 90 treesize of output 75 [2025-04-13 22:08:02,472 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 22:08:02,497 INFO L325 Elim1Store]: treesize reduction 8, result has 84.9 percent of original size [2025-04-13 22:08:02,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 78 [2025-04-13 22:08:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:08:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127790972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:08:03,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:08:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 20] total 65 [2025-04-13 22:08:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20111267] [2025-04-13 22:08:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:08:03,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 22:08:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:08:03,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 22:08:03,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=639, Invalid=3642, Unknown=9, NotChecked=0, Total=4290 [2025-04-13 22:08:03,501 INFO L87 Difference]: Start difference. First operand 3626 states and 11519 transitions. Second operand has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:08:18,819 INFO L93 Difference]: Finished difference Result 4874 states and 14975 transitions. [2025-04-13 22:08:18,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 22:08:18,820 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:08:18,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:08:18,832 INFO L225 Difference]: With dead ends: 4874 [2025-04-13 22:08:18,832 INFO L226 Difference]: Without dead ends: 4613 [2025-04-13 22:08:18,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3786 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2184, Invalid=11379, Unknown=9, NotChecked=0, Total=13572 [2025-04-13 22:08:18,833 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 390 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 2832 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:08:18,834 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 265 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2832 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:08:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states. [2025-04-13 22:08:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4613 to 2778. [2025-04-13 22:08:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2778 states, 2777 states have (on average 3.001080302484696) internal successors, (8334), 2777 states have internal predecessors, (8334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2778 states to 2778 states and 8334 transitions. [2025-04-13 22:08:22,268 INFO L79 Accepts]: Start accepts. Automaton has 2778 states and 8334 transitions. Word has length 33 [2025-04-13 22:08:22,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:08:22,268 INFO L485 AbstractCegarLoop]: Abstraction has 2778 states and 8334 transitions. [2025-04-13 22:08:22,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:22,268 INFO L278 IsEmpty]: Start isEmpty. Operand 2778 states and 8334 transitions. [2025-04-13 22:08:22,271 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:08:22,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:08:22,272 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:08:22,279 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:08:22,472 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,SelfDestructingSolverStorable106 [2025-04-13 22:08:22,472 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:08:22,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:08:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1248479469, now seen corresponding path program 100 times [2025-04-13 22:08:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:08:22,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200483060] [2025-04-13 22:08:22,473 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:08:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:08:22,480 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:08:22,487 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:08:22,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:08:22,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:08:22,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:08:22,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200483060] [2025-04-13 22:08:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200483060] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:08:22,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56518081] [2025-04-13 22:08:22,749 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:08:22,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:22,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:08:22,751 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:08:22,751 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:08:22,952 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:08:22,991 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:08:22,991 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:08:22,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:22,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:08:22,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:08:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:08:23,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:08:23,269 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:08:23,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:08:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:08:23,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56518081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:08:23,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:08:23,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 27 [2025-04-13 22:08:23,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646722995] [2025-04-13 22:08:23,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:08:23,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:08:23,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:08:23,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:08:23,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:08:23,376 INFO L87 Difference]: Start difference. First operand 2778 states and 8334 transitions. Second operand has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:08:33,658 INFO L93 Difference]: Finished difference Result 3513 states and 10422 transitions. [2025-04-13 22:08:33,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:08:33,658 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:08:33,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:08:33,668 INFO L225 Difference]: With dead ends: 3513 [2025-04-13 22:08:33,668 INFO L226 Difference]: Without dead ends: 3346 [2025-04-13 22:08:33,668 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=1708, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:08:33,669 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 159 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:08:33,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 107 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:08:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2025-04-13 22:08:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2536. [2025-04-13 22:08:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 2535 states have (on average 2.9502958579881655) internal successors, (7479), 2535 states have internal predecessors, (7479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 7479 transitions. [2025-04-13 22:08:37,024 INFO L79 Accepts]: Start accepts. Automaton has 2536 states and 7479 transitions. Word has length 33 [2025-04-13 22:08:37,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:08:37,024 INFO L485 AbstractCegarLoop]: Abstraction has 2536 states and 7479 transitions. [2025-04-13 22:08:37,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:37,024 INFO L278 IsEmpty]: Start isEmpty. Operand 2536 states and 7479 transitions. [2025-04-13 22:08:37,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:08:37,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:08:37,027 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:08:37,035 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:08:37,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:37,228 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:08:37,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:08:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1437240680, now seen corresponding path program 101 times [2025-04-13 22:08:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:08:37,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079192629] [2025-04-13 22:08:37,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:08:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:08:37,236 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:08:37,244 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:08:37,244 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:08:37,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 14 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:08:37,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079192629] [2025-04-13 22:08:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079192629] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:08:37,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907520170] [2025-04-13 22:08:37,804 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:08:37,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:37,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:08:37,806 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:08:37,807 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:08:37,998 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:08:38,056 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:08:38,056 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:08:38,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:38,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 22:08:38,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:08:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:08:38,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:08:38,966 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:08:38,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:08:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:08:39,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907520170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:08:39,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:08:39,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 17] total 58 [2025-04-13 22:08:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391011826] [2025-04-13 22:08:39,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:08:39,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-04-13 22:08:39,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:08:39,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-04-13 22:08:39,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:08:39,505 INFO L87 Difference]: Start difference. First operand 2536 states and 7479 transitions. Second operand has 59 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 58 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:08:45,773 INFO L93 Difference]: Finished difference Result 2557 states and 7519 transitions. [2025-04-13 22:08:45,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:08:45,774 INFO L79 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 58 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:08:45,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:08:45,783 INFO L225 Difference]: With dead ends: 2557 [2025-04-13 22:08:45,783 INFO L226 Difference]: Without dead ends: 2542 [2025-04-13 22:08:45,784 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=432, Invalid=6048, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 22:08:45,784 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 55 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:08:45,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 148 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:08:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2025-04-13 22:08:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2025-04-13 22:08:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 2541 states have (on average 2.9484454939000395) internal successors, (7492), 2541 states have internal predecessors, (7492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 7492 transitions. [2025-04-13 22:08:49,168 INFO L79 Accepts]: Start accepts. Automaton has 2542 states and 7492 transitions. Word has length 33 [2025-04-13 22:08:49,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:08:49,168 INFO L485 AbstractCegarLoop]: Abstraction has 2542 states and 7492 transitions. [2025-04-13 22:08:49,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 58 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:49,168 INFO L278 IsEmpty]: Start isEmpty. Operand 2542 states and 7492 transitions. [2025-04-13 22:08:49,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:08:49,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:08:49,171 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:08:49,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2025-04-13 22:08:49,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:49,372 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:08:49,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:08:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash -121083376, now seen corresponding path program 102 times [2025-04-13 22:08:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:08:49,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502759853] [2025-04-13 22:08:49,372 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:08:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:08:49,379 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:08:49,389 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:08:49,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:08:49,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:08:49,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502759853] [2025-04-13 22:08:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502759853] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:08:49,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002903254] [2025-04-13 22:08:49,949 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:08:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:08:49,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:08:49,951 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:08:49,952 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:08:50,137 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:08:50,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:08:50,258 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:08:50,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:08:50,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 22:08:50,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:08:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 13 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:50,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:08:51,024 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:08:51,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:08:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:08:51,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002903254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:08:51,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:08:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 63 [2025-04-13 22:08:51,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195699619] [2025-04-13 22:08:51,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:08:51,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-13 22:08:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:08:51,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-13 22:08:51,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=3637, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:08:51,722 INFO L87 Difference]: Start difference. First operand 2542 states and 7492 transitions. Second operand has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:08:57,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:08:57,322 INFO L93 Difference]: Finished difference Result 2559 states and 7524 transitions. [2025-04-13 22:08:57,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:08:57,322 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:08:57,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:08:57,329 INFO L225 Difference]: With dead ends: 2559 [2025-04-13 22:08:57,330 INFO L226 Difference]: Without dead ends: 2546 [2025-04-13 22:08:57,330 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=473, Invalid=4357, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:08:57,330 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:08:57,330 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 136 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:08:57,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2025-04-13 22:09:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2025-04-13 22:09:00,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 2.9469548133595285) internal successors, (7500), 2545 states have internal predecessors, (7500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 7500 transitions. [2025-04-13 22:09:00,768 INFO L79 Accepts]: Start accepts. Automaton has 2546 states and 7500 transitions. Word has length 33 [2025-04-13 22:09:00,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:09:00,768 INFO L485 AbstractCegarLoop]: Abstraction has 2546 states and 7500 transitions. [2025-04-13 22:09:00,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.328125) internal successors, (85), 63 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:00,769 INFO L278 IsEmpty]: Start isEmpty. Operand 2546 states and 7500 transitions. [2025-04-13 22:09:00,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:09:00,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:09:00,772 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:09:00,780 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:09:00,972 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,SelfDestructingSolverStorable109 [2025-04-13 22:09:00,972 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:09:00,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:09:00,973 INFO L85 PathProgramCache]: Analyzing trace with hash 752657304, now seen corresponding path program 103 times [2025-04-13 22:09:00,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:09:00,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232478400] [2025-04-13 22:09:00,973 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:09:00,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:09:00,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:09:00,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:00,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:09:00,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 8 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:09:01,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232478400] [2025-04-13 22:09:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232478400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:09:01,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814451881] [2025-04-13 22:09:01,605 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:09:01,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:01,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:09:01,607 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:09:01,608 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:09:01,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:09:01,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:01,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:09:01,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:01,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:09:01,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:09:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:02,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:09:02,513 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:09:02,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:09:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:03,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814451881] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:09:03,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:09:03,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 22:09:03,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115600176] [2025-04-13 22:09:03,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:09:03,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 22:09:03,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:09:03,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 22:09:03,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=3874, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:09:03,295 INFO L87 Difference]: Start difference. First operand 2546 states and 7500 transitions. Second operand has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:09:09,020 INFO L93 Difference]: Finished difference Result 2565 states and 7539 transitions. [2025-04-13 22:09:09,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:09:09,020 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:09:09,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:09:09,028 INFO L225 Difference]: With dead ends: 2565 [2025-04-13 22:09:09,028 INFO L226 Difference]: Without dead ends: 2554 [2025-04-13 22:09:09,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=596, Invalid=5884, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 22:09:09,029 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:09:09,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 124 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:09:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2025-04-13 22:09:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2550. [2025-04-13 22:09:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2549 states have (on average 2.9462534327187133) internal successors, (7510), 2549 states have internal predecessors, (7510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 7510 transitions. [2025-04-13 22:09:12,433 INFO L79 Accepts]: Start accepts. Automaton has 2550 states and 7510 transitions. Word has length 33 [2025-04-13 22:09:12,434 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:09:12,434 INFO L485 AbstractCegarLoop]: Abstraction has 2550 states and 7510 transitions. [2025-04-13 22:09:12,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:12,434 INFO L278 IsEmpty]: Start isEmpty. Operand 2550 states and 7510 transitions. [2025-04-13 22:09:12,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:09:12,437 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:09:12,437 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:09:12,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-04-13 22:09:12,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:12,638 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:09:12,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:09:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1612126480, now seen corresponding path program 104 times [2025-04-13 22:09:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:09:12,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240570903] [2025-04-13 22:09:12,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:09:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:09:12,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:09:12,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:12,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:09:12,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:09:13,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240570903] [2025-04-13 22:09:13,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240570903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:09:13,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692713012] [2025-04-13 22:09:13,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:09:13,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:13,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:09:13,249 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:09:13,250 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:09:13,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:09:13,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:13,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:09:13,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:13,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:09:13,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:09:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:14,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:09:14,269 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:09:14,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:09:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:14,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692713012] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:09:14,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:09:14,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 64 [2025-04-13 22:09:14,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921709167] [2025-04-13 22:09:14,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:09:14,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-04-13 22:09:14,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:09:14,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-04-13 22:09:14,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3728, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:09:14,959 INFO L87 Difference]: Start difference. First operand 2550 states and 7510 transitions. Second operand has 65 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:09:20,564 INFO L93 Difference]: Finished difference Result 2592 states and 7607 transitions. [2025-04-13 22:09:20,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:09:20,564 INFO L79 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:09:20,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:09:20,572 INFO L225 Difference]: With dead ends: 2592 [2025-04-13 22:09:20,572 INFO L226 Difference]: Without dead ends: 2562 [2025-04-13 22:09:20,573 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1704 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=575, Invalid=4537, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 22:09:20,573 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:09:20,573 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 144 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:09:20,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-04-13 22:09:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2554. [2025-04-13 22:09:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 2.945554249902076) internal successors, (7520), 2553 states have internal predecessors, (7520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 7520 transitions. [2025-04-13 22:09:24,009 INFO L79 Accepts]: Start accepts. Automaton has 2554 states and 7520 transitions. Word has length 33 [2025-04-13 22:09:24,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:09:24,009 INFO L485 AbstractCegarLoop]: Abstraction has 2554 states and 7520 transitions. [2025-04-13 22:09:24,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 64 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:24,010 INFO L278 IsEmpty]: Start isEmpty. Operand 2554 states and 7520 transitions. [2025-04-13 22:09:24,012 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:09:24,012 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:09:24,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:09:24,020 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:09:24,213 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,SelfDestructingSolverStorable111 [2025-04-13 22:09:24,213 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:09:24,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:09:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1501303960, now seen corresponding path program 105 times [2025-04-13 22:09:24,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:09:24,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068044917] [2025-04-13 22:09:24,213 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:09:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:09:24,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-04-13 22:09:24,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:24,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:09:24,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 3 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:09:25,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:09:25,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068044917] [2025-04-13 22:09:25,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068044917] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:09:25,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095535231] [2025-04-13 22:09:25,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:09:25,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:25,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:09:25,042 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:09:25,043 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:09:25,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 5 equivalence classes. [2025-04-13 22:09:25,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:25,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-04-13 22:09:25,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:25,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-04-13 22:09:25,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:09:25,918 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:09:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:09:26,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:09:27,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:09:27,080 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 168 treesize of output 164 [2025-04-13 22:09:27,087 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-13 22:09:27,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2025-04-13 22:09:27,143 INFO L325 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-04-13 22:09:27,143 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 185 [2025-04-13 22:09:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:09:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095535231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:09:27,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:09:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 13] total 56 [2025-04-13 22:09:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805872240] [2025-04-13 22:09:27,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:09:27,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 22:09:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:09:27,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 22:09:27,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2960, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:09:27,378 INFO L87 Difference]: Start difference. First operand 2554 states and 7520 transitions. Second operand has 57 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 56 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:09:42,802 INFO L93 Difference]: Finished difference Result 3843 states and 10780 transitions. [2025-04-13 22:09:42,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-13 22:09:42,803 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 56 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:09:42,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:09:42,812 INFO L225 Difference]: With dead ends: 3843 [2025-04-13 22:09:42,812 INFO L226 Difference]: Without dead ends: 3737 [2025-04-13 22:09:42,813 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=761, Invalid=11229, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 22:09:42,813 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 274 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4721 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:09:42,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 197 Invalid, 4763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4721 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 22:09:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2025-04-13 22:09:46,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3016. [2025-04-13 22:09:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3016 states, 3015 states have (on average 2.979436152570481) internal successors, (8983), 3015 states have internal predecessors, (8983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 8983 transitions. [2025-04-13 22:09:46,947 INFO L79 Accepts]: Start accepts. Automaton has 3016 states and 8983 transitions. Word has length 33 [2025-04-13 22:09:46,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:09:46,947 INFO L485 AbstractCegarLoop]: Abstraction has 3016 states and 8983 transitions. [2025-04-13 22:09:46,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 56 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:46,947 INFO L278 IsEmpty]: Start isEmpty. Operand 3016 states and 8983 transitions. [2025-04-13 22:09:46,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:09:46,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:09:46,951 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:09:46,959 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:09:47,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:47,151 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:09:47,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:09:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2118235368, now seen corresponding path program 106 times [2025-04-13 22:09:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:09:47,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390327337] [2025-04-13 22:09:47,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:09:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:09:47,160 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:09:47,165 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:47,165 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:09:47,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 22:09:47,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:09:47,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390327337] [2025-04-13 22:09:47,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390327337] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:09:47,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745973887] [2025-04-13 22:09:47,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:09:47,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:09:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:09:47,377 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:09:47,377 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:09:47,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:09:47,618 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:09:47,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:09:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:09:47,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:09:47,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:09:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:09:47,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:09:47,881 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:09:47,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:09:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 22:09:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745973887] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:09:47,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:09:47,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 25 [2025-04-13 22:09:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645350601] [2025-04-13 22:09:47,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:09:47,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:09:47,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:09:47,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:09:47,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:09:47,978 INFO L87 Difference]: Start difference. First operand 3016 states and 8983 transitions. Second operand has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:09:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:09:56,311 INFO L93 Difference]: Finished difference Result 3504 states and 10249 transitions. [2025-04-13 22:09:56,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:09:56,311 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:09:56,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:09:56,324 INFO L225 Difference]: With dead ends: 3504 [2025-04-13 22:09:56,324 INFO L226 Difference]: Without dead ends: 3487 [2025-04-13 22:09:56,325 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:09:56,325 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 75 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:09:56,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 101 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:09:56,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-04-13 22:10:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3012. [2025-04-13 22:10:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 2.975423447359681) internal successors, (8959), 3011 states have internal predecessors, (8959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 8959 transitions. [2025-04-13 22:10:00,472 INFO L79 Accepts]: Start accepts. Automaton has 3012 states and 8959 transitions. Word has length 33 [2025-04-13 22:10:00,472 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:10:00,472 INFO L485 AbstractCegarLoop]: Abstraction has 3012 states and 8959 transitions. [2025-04-13 22:10:00,472 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:00,472 INFO L278 IsEmpty]: Start isEmpty. Operand 3012 states and 8959 transitions. [2025-04-13 22:10:00,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:10:00,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:10:00,475 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:10:00,482 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:10:00,675 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,SelfDestructingSolverStorable113 [2025-04-13 22:10:00,676 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:10:00,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:10:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1231565835, now seen corresponding path program 107 times [2025-04-13 22:10:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:10:00,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138896233] [2025-04-13 22:10:00,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:10:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:10:00,684 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:10:00,691 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:00,692 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:10:00,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:10:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:10:01,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138896233] [2025-04-13 22:10:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138896233] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:10:01,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402740413] [2025-04-13 22:10:01,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:10:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:10:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:10:01,115 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:10:01,116 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:10:01,314 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:10:01,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:01,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:10:01,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:01,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:10:01,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:10:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:10:01,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:10:01,884 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:10:01,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:10:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-13 22:10:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402740413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:10:02,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:10:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 7] total 37 [2025-04-13 22:10:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720261968] [2025-04-13 22:10:02,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:10:02,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:10:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:10:02,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:10:02,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:10:02,014 INFO L87 Difference]: Start difference. First operand 3012 states and 8959 transitions. Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:10:09,145 INFO L93 Difference]: Finished difference Result 3067 states and 9066 transitions. [2025-04-13 22:10:09,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:10:09,145 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:10:09,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:10:09,156 INFO L225 Difference]: With dead ends: 3067 [2025-04-13 22:10:09,156 INFO L226 Difference]: Without dead ends: 3012 [2025-04-13 22:10:09,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=273, Invalid=3267, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:10:09,157 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:10:09,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 129 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:10:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-04-13 22:10:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2998. [2025-04-13 22:10:13,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2997 states have (on average 2.9743076409743074) internal successors, (8914), 2997 states have internal predecessors, (8914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 8914 transitions. [2025-04-13 22:10:13,263 INFO L79 Accepts]: Start accepts. Automaton has 2998 states and 8914 transitions. Word has length 33 [2025-04-13 22:10:13,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:10:13,263 INFO L485 AbstractCegarLoop]: Abstraction has 2998 states and 8914 transitions. [2025-04-13 22:10:13,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:13,263 INFO L278 IsEmpty]: Start isEmpty. Operand 2998 states and 8914 transitions. [2025-04-13 22:10:13,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:10:13,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:10:13,267 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:10:13,277 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:10:13,468 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,SelfDestructingSolverStorable114 [2025-04-13 22:10:13,468 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:10:13,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:10:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1072304313, now seen corresponding path program 108 times [2025-04-13 22:10:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:10:13,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578789442] [2025-04-13 22:10:13,468 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:10:13,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:10:13,476 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:10:13,487 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:13,487 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:10:13,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:14,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:10:14,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578789442] [2025-04-13 22:10:14,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578789442] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:10:14,240 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684041914] [2025-04-13 22:10:14,240 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:10:14,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:10:14,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:10:14,242 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:10:14,242 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:10:14,443 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:10:14,501 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:14,501 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:10:14,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:14,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:10:14,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:10:15,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:10:15,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:10:15,421 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:10:15,422 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:10:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:10:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684041914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:10:15,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:10:15,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 16] total 54 [2025-04-13 22:10:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905201811] [2025-04-13 22:10:15,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:10:15,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-04-13 22:10:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:10:15,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-04-13 22:10:15,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2791, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:10:15,863 INFO L87 Difference]: Start difference. First operand 2998 states and 8914 transitions. Second operand has 55 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 54 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:10:25,057 INFO L93 Difference]: Finished difference Result 3233 states and 9515 transitions. [2025-04-13 22:10:25,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:10:25,058 INFO L79 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 54 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:10:25,058 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:10:25,066 INFO L225 Difference]: With dead ends: 3233 [2025-04-13 22:10:25,067 INFO L226 Difference]: Without dead ends: 3202 [2025-04-13 22:10:25,067 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=481, Invalid=6325, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 22:10:25,067 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 240 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:10:25,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 230 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:10:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2025-04-13 22:10:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3002. [2025-04-13 22:10:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 3001 states have (on average 2.9743418860379873) internal successors, (8926), 3001 states have internal predecessors, (8926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 8926 transitions. [2025-04-13 22:10:29,178 INFO L79 Accepts]: Start accepts. Automaton has 3002 states and 8926 transitions. Word has length 33 [2025-04-13 22:10:29,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:10:29,178 INFO L485 AbstractCegarLoop]: Abstraction has 3002 states and 8926 transitions. [2025-04-13 22:10:29,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 54 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:29,178 INFO L278 IsEmpty]: Start isEmpty. Operand 3002 states and 8926 transitions. [2025-04-13 22:10:29,182 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:10:29,182 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:10:29,182 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:10:29,189 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:10:29,382 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,SelfDestructingSolverStorable115 [2025-04-13 22:10:29,382 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:10:29,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:10:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash -484325932, now seen corresponding path program 109 times [2025-04-13 22:10:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:10:29,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665371507] [2025-04-13 22:10:29,383 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:10:29,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:10:29,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:10:29,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:29,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:10:29,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:10:30,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665371507] [2025-04-13 22:10:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665371507] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:10:30,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858849071] [2025-04-13 22:10:30,003 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:10:30,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:10:30,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:10:30,005 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:10:30,006 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:10:30,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:10:30,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:30,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:10:30,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:30,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:10:30,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:10:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 25 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:30,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:10:31,042 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:10:31,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:10:31,707 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:31,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858849071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:10:31,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:10:31,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2025-04-13 22:10:31,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748047393] [2025-04-13 22:10:31,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:10:31,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-04-13 22:10:31,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:10:31,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-04-13 22:10:31,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=3882, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:10:31,708 INFO L87 Difference]: Start difference. First operand 3002 states and 8926 transitions. Second operand has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:10:38,517 INFO L93 Difference]: Finished difference Result 3021 states and 8953 transitions. [2025-04-13 22:10:38,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:10:38,518 INFO L79 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:10:38,518 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:10:38,526 INFO L225 Difference]: With dead ends: 3021 [2025-04-13 22:10:38,526 INFO L226 Difference]: Without dead ends: 3002 [2025-04-13 22:10:38,527 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=561, Invalid=5291, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 22:10:38,527 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:10:38,527 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 164 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:10:38,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2025-04-13 22:10:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2025-04-13 22:10:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 3001 states have (on average 2.971676107964012) internal successors, (8918), 3001 states have internal predecessors, (8918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 8918 transitions. [2025-04-13 22:10:42,631 INFO L79 Accepts]: Start accepts. Automaton has 3002 states and 8918 transitions. Word has length 33 [2025-04-13 22:10:42,631 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:10:42,631 INFO L485 AbstractCegarLoop]: Abstraction has 3002 states and 8918 transitions. [2025-04-13 22:10:42,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.378787878787879) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:42,631 INFO L278 IsEmpty]: Start isEmpty. Operand 3002 states and 8918 transitions. [2025-04-13 22:10:42,634 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:10:42,634 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:10:42,635 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:10:42,642 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:10:42,835 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,SelfDestructingSolverStorable116 [2025-04-13 22:10:42,835 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:10:42,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:10:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1850606039, now seen corresponding path program 110 times [2025-04-13 22:10:42,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:10:42,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586240656] [2025-04-13 22:10:42,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:10:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:10:42,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:10:42,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:42,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:10:42,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:43,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:10:43,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586240656] [2025-04-13 22:10:43,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586240656] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:10:43,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469612332] [2025-04-13 22:10:43,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:10:43,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:10:43,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:10:43,473 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:10:43,474 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:10:43,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:10:43,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:43,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:10:43,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:43,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:10:43,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:10:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 20 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:44,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:10:44,471 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:10:44,471 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 90 [2025-04-13 22:10:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:10:45,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469612332] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:10:45,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:10:45,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 60 [2025-04-13 22:10:45,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437526195] [2025-04-13 22:10:45,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:10:45,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-04-13 22:10:45,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:10:45,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-04-13 22:10:45,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=3263, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:10:45,105 INFO L87 Difference]: Start difference. First operand 3002 states and 8918 transitions. Second operand has 61 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 60 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:54,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:10:54,128 INFO L93 Difference]: Finished difference Result 3263 states and 9612 transitions. [2025-04-13 22:10:54,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:10:54,129 INFO L79 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 60 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:10:54,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:10:54,138 INFO L225 Difference]: With dead ends: 3263 [2025-04-13 22:10:54,138 INFO L226 Difference]: Without dead ends: 3232 [2025-04-13 22:10:54,138 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=558, Invalid=4844, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 22:10:54,138 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 89 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:10:54,139 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 130 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:10:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-04-13 22:10:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2996. [2025-04-13 22:10:58,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 2.9712854757929885) internal successors, (8899), 2995 states have internal predecessors, (8899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 8899 transitions. [2025-04-13 22:10:58,390 INFO L79 Accepts]: Start accepts. Automaton has 2996 states and 8899 transitions. Word has length 33 [2025-04-13 22:10:58,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:10:58,390 INFO L485 AbstractCegarLoop]: Abstraction has 2996 states and 8899 transitions. [2025-04-13 22:10:58,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 60 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:10:58,390 INFO L278 IsEmpty]: Start isEmpty. Operand 2996 states and 8899 transitions. [2025-04-13 22:10:58,395 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:10:58,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:10:58,395 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:10:58,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2025-04-13 22:10:58,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:10:58,596 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:10:58,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:10:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1661844828, now seen corresponding path program 111 times [2025-04-13 22:10:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:10:58,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006004132] [2025-04-13 22:10:58,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:10:58,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:10:58,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:10:58,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:58,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:10:58,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:10:58,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:10:58,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006004132] [2025-04-13 22:10:58,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006004132] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:10:58,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456763371] [2025-04-13 22:10:58,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:10:58,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:10:58,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:10:58,925 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:10:58,926 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:10:59,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 4 equivalence classes. [2025-04-13 22:10:59,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:10:59,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:10:59,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:10:59,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:10:59,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:10:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:10:59,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:10:59,509 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:10:59,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:10:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:10:59,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456763371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:10:59,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:10:59,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 27 [2025-04-13 22:10:59,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034751182] [2025-04-13 22:10:59,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:10:59,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:10:59,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:10:59,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:10:59,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:10:59,618 INFO L87 Difference]: Start difference. First operand 2996 states and 8899 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 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:11:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:11:08,687 INFO L93 Difference]: Finished difference Result 3232 states and 9366 transitions. [2025-04-13 22:11:08,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:11:08,688 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 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 33 [2025-04-13 22:11:08,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:11:08,698 INFO L225 Difference]: With dead ends: 3232 [2025-04-13 22:11:08,698 INFO L226 Difference]: Without dead ends: 3185 [2025-04-13 22:11:08,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1721, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:11:08,699 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 86 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:11:08,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 103 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:11:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2025-04-13 22:11:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 2992. [2025-04-13 22:11:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2992 states, 2991 states have (on average 2.9518555667001003) internal successors, (8829), 2991 states have internal predecessors, (8829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:11:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2992 states to 2992 states and 8829 transitions. [2025-04-13 22:11:12,869 INFO L79 Accepts]: Start accepts. Automaton has 2992 states and 8829 transitions. Word has length 33 [2025-04-13 22:11:12,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:11:12,869 INFO L485 AbstractCegarLoop]: Abstraction has 2992 states and 8829 transitions. [2025-04-13 22:11:12,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 27 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:11:12,869 INFO L278 IsEmpty]: Start isEmpty. Operand 2992 states and 8829 transitions. [2025-04-13 22:11:12,872 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:11:12,872 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:11:12,872 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:11:12,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2025-04-13 22:11:13,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:11:13,072 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:11:13,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:11:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash 490239225, now seen corresponding path program 112 times [2025-04-13 22:11:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:11:13,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945406676] [2025-04-13 22:11:13,073 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:11:13,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:11:13,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:11:13,087 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:11:13,087 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:11:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:11:13,342 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 22:11:13,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:11:13,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945406676] [2025-04-13 22:11:13,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945406676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:11:13,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072600035] [2025-04-13 22:11:13,342 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:11:13,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:11:13,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:11:13,344 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:11:13,345 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:11:13,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:11:13,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:11:13,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:11:13,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:11:13,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:11:13,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:11:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:11:13,902 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:11:14,008 INFO L325 Elim1Store]: treesize reduction 26, result has 68.7 percent of original size [2025-04-13 22:11:14,008 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 75 [2025-04-13 22:11:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-04-13 22:11:14,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072600035] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:11:14,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:11:14,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-13 22:11:14,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519550150] [2025-04-13 22:11:14,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:11:14,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:11:14,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:11:14,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:11:14,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:11:14,110 INFO L87 Difference]: Start difference. First operand 2992 states and 8829 transitions. Second operand has 32 states, 32 states have (on average 2.15625) 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:11:29,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:11:29,039 INFO L93 Difference]: Finished difference Result 4024 states and 11628 transitions. [2025-04-13 22:11:29,039 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 22:11:29,039 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) 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) Word has length 33 [2025-04-13 22:11:29,040 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:11:29,051 INFO L225 Difference]: With dead ends: 4024 [2025-04-13 22:11:29,052 INFO L226 Difference]: Without dead ends: 3907 [2025-04-13 22:11:29,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=685, Invalid=6287, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 22:11:29,053 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 358 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:11:29,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 75 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:11:29,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2025-04-13 22:11:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3026. [2025-04-13 22:11:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3026 states, 3025 states have (on average 2.9441322314049585) internal successors, (8906), 3025 states have internal predecessors, (8906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:11:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3026 states to 3026 states and 8906 transitions. [2025-04-13 22:11:33,236 INFO L79 Accepts]: Start accepts. Automaton has 3026 states and 8906 transitions. Word has length 33 [2025-04-13 22:11:33,236 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:11:33,236 INFO L485 AbstractCegarLoop]: Abstraction has 3026 states and 8906 transitions. [2025-04-13 22:11:33,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) 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:11:33,236 INFO L278 IsEmpty]: Start isEmpty. Operand 3026 states and 8906 transitions. [2025-04-13 22:11:33,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:11:33,239 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:11:33,239 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:11:33,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2025-04-13 22:11:33,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:11:33,440 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:11:33,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:11:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 305422172, now seen corresponding path program 113 times [2025-04-13 22:11:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:11:33,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763527913] [2025-04-13 22:11:33,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:11:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:11:33,449 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-04-13 22:11:33,458 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:11:33,458 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 22:11:33,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:11:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:11:33,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:11:33,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763527913] [2025-04-13 22:11:33,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763527913] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:11:33,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703270002] [2025-04-13 22:11:33,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:11:33,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:11:33,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:11:33,950 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:11:33,951 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:11:34,160 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 6 equivalence classes. [2025-04-13 22:11:34,233 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:11:34,233 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 22:11:34,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:11:34,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:11:34,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:11:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 10 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:11:34,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:11:34,864 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:11:34,864 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 84 [2025-04-13 22:11:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:11:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703270002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:11:35,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:11:35,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 16] total 56 [2025-04-13 22:11:35,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889656040] [2025-04-13 22:11:35,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:11:35,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-13 22:11:35,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:11:35,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-13 22:11:35,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2949, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:11:35,365 INFO L87 Difference]: Start difference. First operand 3026 states and 8906 transitions. Second operand has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:11:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:11:42,541 INFO L93 Difference]: Finished difference Result 3096 states and 9084 transitions. [2025-04-13 22:11:42,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:11:42,542 INFO L79 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 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 33 [2025-04-13 22:11:42,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:11:42,550 INFO L225 Difference]: With dead ends: 3096 [2025-04-13 22:11:42,551 INFO L226 Difference]: Without dead ends: 3089 [2025-04-13 22:11:42,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=5977, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 22:11:42,551 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 63 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:11:42,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 146 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:11:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2025-04-13 22:11:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 3032. [2025-04-13 22:11:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 3031 states have (on average 2.9432530517980866) internal successors, (8921), 3031 states have internal predecessors, (8921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:11:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 8921 transitions. [2025-04-13 22:11:46,756 INFO L79 Accepts]: Start accepts. Automaton has 3032 states and 8921 transitions. Word has length 33 [2025-04-13 22:11:46,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:11:46,756 INFO L485 AbstractCegarLoop]: Abstraction has 3032 states and 8921 transitions. [2025-04-13 22:11:46,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 56 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:11:46,756 INFO L278 IsEmpty]: Start isEmpty. Operand 3032 states and 8921 transitions. [2025-04-13 22:11:46,760 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:11:46,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:11:46,760 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:11:46,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2025-04-13 22:11:46,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:11:46,961 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:11:46,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:11:46,961 INFO L85 PathProgramCache]: Analyzing trace with hash 811768438, now seen corresponding path program 114 times [2025-04-13 22:11:46,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:11:46,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189805994] [2025-04-13 22:11:46,961 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:11:46,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:11:46,969 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 6 equivalence classes. [2025-04-13 22:11:46,986 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:11:46,986 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-13 22:11:46,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:11:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:11:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:11:47,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189805994] [2025-04-13 22:11:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189805994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:11:47,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477577249] [2025-04-13 22:11:47,461 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:11:47,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:11:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:11:47,463 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:11:47,464 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:11:47,682 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 6 equivalence classes. [2025-04-13 22:11:47,810 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:11:47,810 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-04-13 22:11:47,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:11:47,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 22:11:47,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:11:48,002 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:11:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:11:48,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:11:49,406 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:11:49,406 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 168 treesize of output 164 [2025-04-13 22:11:49,441 INFO L325 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2025-04-13 22:11:49,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2025-04-13 22:11:49,484 INFO L325 Elim1Store]: treesize reduction 15, result has 78.9 percent of original size [2025-04-13 22:11:49,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 201 treesize of output 200 [2025-04-13 22:11:49,665 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-13 22:11:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:11:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477577249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:11:50,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:11:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2025-04-13 22:11:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63080612] [2025-04-13 22:11:50,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:11:50,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-13 22:11:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:11:50,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-13 22:11:50,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2497, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:11:50,204 INFO L87 Difference]: Start difference. First operand 3032 states and 8921 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:12:13,171 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:12:17,497 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:12:19,869 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:12:22,033 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:12:47,710 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 22:12:49,755 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-04-13 22:12:54,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-13 22:12:54,574 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3092 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=1738, Invalid=13021, Unknown=3, NotChecked=0, Total=14762 [2025-04-13 22:12:54,574 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 396 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 3980 mSolverCounterSat, 159 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 3980 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:12:54,574 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 232 Invalid, 4143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 3980 Invalid, 4 Unknown, 0 Unchecked, 20.5s Time] [2025-04-13 22:12:54,575 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:12:54,583 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:12:54,587 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:12:54,593 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:12:54,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:12:54,775 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (3032states) and FLOYD_HOARE automaton (currently 105 states, 53 states before enhancement),while ReachableStatesComputation was computing reachable states (4711 states constructed, input type IntersectNwa). [2025-04-13 22:12:54,777 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:12:54,777 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:12:54,780 INFO L422 BasicCegarLoop]: Path program histogram: [114, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 22:12:54,782 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:12:54,783 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:12:54,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:12:54 BasicIcfg [2025-04-13 22:12:54,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:12:54,784 INFO L158 Benchmark]: Toolchain (without parser) took 851013.64ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 108.6MB in the beginning and 1.1GB in the end (delta: -944.9MB). Peak memory consumption was 920.2MB. Max. memory is 8.0GB. [2025-04-13 22:12:54,784 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 155.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:12:54,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.96ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 94.2MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:12:54,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.50ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:12:54,784 INFO L158 Benchmark]: Boogie Preprocessor took 45.06ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 89.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:12:54,784 INFO L158 Benchmark]: IcfgBuilder took 558.31ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 41.4MB in the end (delta: 48.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 22:12:54,784 INFO L158 Benchmark]: TraceAbstraction took 850151.17ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 40.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 853.1MB. Max. memory is 8.0GB. [2025-04-13 22:12:54,785 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.25ms. Allocated memory is still 155.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 222.96ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 94.2MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.50ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.5MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.06ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 89.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 558.31ms. Allocated memory is still 155.2MB. Free memory was 89.9MB in the beginning and 41.4MB in the end (delta: 48.5MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 850151.17ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 40.5MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 853.1MB. 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: 85]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (3032states) and FLOYD_HOARE automaton (currently 105 states, 53 states before enhancement),while ReachableStatesComputation was computing reachable states (4711 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3032states) and FLOYD_HOARE automaton (currently 105 states, 53 states before enhancement),while ReachableStatesComputation was computing reachable states (4711 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (3032states) and FLOYD_HOARE automaton (currently 105 states, 53 states before enhancement),while ReachableStatesComputation was computing reachable states (4711 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 31 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 850.1s, OverallIterations: 122, TraceHistogramMax: 5, PathProgramHistogramMax: 114, EmptinessCheckTime: 0.2s, AutomataDifference: 554.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 12738 SdHoareTripleChecker+Valid, 172.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12738 mSDsluCounter, 11620 SdHoareTripleChecker+Invalid, 164.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 756 IncrementalHoareTripleChecker+Unchecked, 10978 mSDsCounter, 2161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141376 IncrementalHoareTripleChecker+Invalid, 144320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2161 mSolverCounterUnsat, 642 mSDtfsCounter, 141376 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10034 GetRequests, 3926 SyntacticMatches, 28 SemanticMatches, 6080 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 109582 ImplicationChecksByTransitivity, 195.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3630occurred in iteration=104, InterpolantAutomatonStates: 3348, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 111.9s AutomataMinimizationTime, 121 MinimizatonAttempts, 21837 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 139.8s InterpolantComputationTime, 6614 NumberOfCodeBlocks, 6614 NumberOfCodeBlocksAsserted, 609 NumberOfCheckSat, 9527 ConstructedInterpolants, 236 QuantifiedInterpolants, 145294 SizeOfPredicates, 926 NumberOfNonLiveVariables, 29106 ConjunctsInSsa, 3969 ConjunctsInUnsatCore, 356 InterpolantComputations, 6 PerfectInterpolantSequences, 5259/12591 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