/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:05:44,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:05:44,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:05:44,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:05:44,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:05:44,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:05:44,404 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:05:44,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:05:44,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:05:44,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:05:44,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:05:44,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:05:44,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:05:44,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:05:44,417 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:05:44,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:05:44,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:05:44,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:05:44,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:05:44,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:05:44,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:05:44,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:05:44,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:05:44,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:05:44,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:05:44,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:05:44,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:05:44,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:05:44,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:05:44,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:05:44,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:05:44,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:05:44,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:05:44,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:05:44,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:05:44,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:05:44,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:05:44,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:05:44,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:05:44,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:05:44,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:05:44,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2022-03-15 22:05:44,465 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:05:44,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:05:44,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:05:44,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:05:44,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:05:44,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:05:44,467 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:05:44,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:05:44,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:05:44,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:05:44,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:05:44,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:05:44,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:05:44,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:05:44,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:05:44,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:05:44,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:05:44,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:05:44,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:05:44,471 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:05:44,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:05:44,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:05:44,472 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:05:44,472 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:05:44,472 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:05:44,472 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-03-15 22:05:44,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:05:44,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:05:44,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:05:44,685 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:05:44,685 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:05:44,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl [2022-03-15 22:05:44,686 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-array.wvr.bpl' [2022-03-15 22:05:44,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:05:44,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:05:44,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:05:44,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:05:44,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:05:44,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,730 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:05:44,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:05:44,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:05:44,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:05:44,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:05:44,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:05:44,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:05:44,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:05:44,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:05:44,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/1) ... [2022-03-15 22:05:44,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:05:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:44,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-15 22:05:44,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-15 22:05:44,842 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:05:44,842 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:05:44,842 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:05:44,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:05:44,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:05:44,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:05:44,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:05:44,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:05:44,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:05:44,843 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:05:44,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:05:44,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:05:44,844 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-15 22:05:44,882 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:05:44,883 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:05:44,976 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:05:44,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:05:44,988 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:05:44,990 INFO L202 PluginConnector]: Adding new model min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:05:44 BoogieIcfgContainer [2022-03-15 22:05:44,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:05:44,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:05:44,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:05:44,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:05:44,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:05:44" (1/2) ... [2022-03-15 22:05:45,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775b5023 and model type min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:05:45, skipping insertion in model container [2022-03-15 22:05:45,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:05:44" (2/2) ... [2022-03-15 22:05:45,003 INFO L111 eAbstractionObserver]: Analyzing ICFG min-array.wvr.bpl [2022-03-15 22:05:45,008 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:05:45,008 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:05:45,008 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:05:45,009 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:05:45,054 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:05:45,090 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:05:45,096 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=MCR, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=true, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-03-15 22:05:45,096 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:05:45,106 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:05:45,115 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:05:45,117 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:05:45,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:05:45,145 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:05:45,145 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:05:45,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:05:45,149 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:05:45,422 INFO L131 LiptonReduction]: Checked pairs total: 106 [2022-03-15 22:05:45,423 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:05:45,429 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:05:45,441 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 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) [2022-03-15 22:05:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 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) [2022-03-15 22:05:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:05:45,448 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:45,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:45,449 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:45,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:45,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1022751962, now seen corresponding path program 1 times [2022-03-15 22:05:45,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:45,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387308745] [2022-03-15 22:05:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:45,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:45,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:45,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387308745] [2022-03-15 22:05:45,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387308745] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:05:45,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:05:45,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:05:45,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137882557] [2022-03-15 22:05:45,582 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:45,586 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:45,602 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:05:45,602 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:45,899 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:05:45,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:05:45,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:45,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:05:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:05:45,928 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 2.608695652173913) internal successors, (60), 23 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) Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:45,978 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:05:45,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:05:45,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-03-15 22:05:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:45,991 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:05:45,991 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:05:45,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:05:45,997 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 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 [2022-03-15 22:05:45,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:05:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:05:46,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:05:46,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 2.7) internal successors, (108), 40 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:05:46,030 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:05:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:46,031 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:05:46,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:05:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:05:46,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:46,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:46,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:05:46,033 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1617420820, now seen corresponding path program 1 times [2022-03-15 22:05:46,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:46,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759166574] [2022-03-15 22:05:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:46,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:46,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759166574] [2022-03-15 22:05:46,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759166574] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:05:46,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:05:46,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:05:46,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1765192887] [2022-03-15 22:05:46,070 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:46,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:46,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:05:46,076 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:46,316 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:05:46,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:05:46,327 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:46,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:05:46,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:05:46,329 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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) [2022-03-15 22:05:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:46,367 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:05:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:05:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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 12 [2022-03-15 22:05:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:46,369 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:05:46,369 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:05:46,369 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:05:46,370 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:46,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:05:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:05:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:05:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:05:46,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:05:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:46,384 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:05:46,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 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) [2022-03-15 22:05:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:05:46,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:05:46,388 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:46,388 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:46,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:05:46,389 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1327324498, now seen corresponding path program 1 times [2022-03-15 22:05:46,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:46,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995274404] [2022-03-15 22:05:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:46,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:46,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995274404] [2022-03-15 22:05:46,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995274404] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:05:46,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:05:46,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:05:46,448 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [405427080] [2022-03-15 22:05:46,448 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:46,449 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:46,452 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:05:46,452 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:46,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:05:46,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:05:46,604 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:46,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:05:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:05:46,606 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:46,646 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:05:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:05:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:05:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:46,648 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:05:46,649 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:05:46,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:05:46,650 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:46,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:05:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:05:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:05:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:05:46,670 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:05:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:46,670 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:05:46,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:05:46,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:05:46,671 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:46,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:46,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:05:46,671 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1745317284, now seen corresponding path program 1 times [2022-03-15 22:05:46,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:46,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875078478] [2022-03-15 22:05:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:46,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:46,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875078478] [2022-03-15 22:05:46,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875078478] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:46,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13538324] [2022-03-15 22:05:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:46,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:46,895 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) [2022-03-15 22:05:46,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-15 22:05:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:46,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:05:46,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:47,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 33 [2022-03-15 22:05:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:47,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:47,373 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:05:47,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 43 [2022-03-15 22:05:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:47,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13538324] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:47,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:47,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:05:47,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205274419] [2022-03-15 22:05:47,506 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:47,507 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:47,511 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:05:47,511 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:48,446 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [543#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< j M) (= k 0))), 545#(and (or (< j M) (= min1 min2) (< (select A i) min1)) (or (<= min1 (select A i)) (< j M) (= (select A i) min2))), 544#(and (or (<= min1 (select A i)) (= (select A i) min2)) (or (= min1 min2) (< (select A i) min1))), 546#(and (or (< j M) (= k i)) (or (< j M) (= i min2)) (or (< j M) (= min1 min2)) (or (< j M) (= k 0))), 542#(or (< j M) (= min1 min2))] [2022-03-15 22:05:48,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:05:48,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:05:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:05:48,448 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 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) [2022-03-15 22:05:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:48,708 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:05:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:05:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 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 13 [2022-03-15 22:05:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:48,709 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:05:48,709 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:05:48,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:05:48,711 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:48,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:05:48,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:05:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:05:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:05:48,717 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:05:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:48,717 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:05:48,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 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) [2022-03-15 22:05:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:05:48,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:05:48,718 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:48,718 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:48,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:05:48,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:48,933 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1818191762, now seen corresponding path program 2 times [2022-03-15 22:05:48,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:48,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649611700] [2022-03-15 22:05:48,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:48,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:48,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649611700] [2022-03-15 22:05:48,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649611700] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:48,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976946945] [2022-03-15 22:05:48,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:05:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:48,987 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) [2022-03-15 22:05:48,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-15 22:05:49,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:05:49,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:49,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:05:49,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:49,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:49,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:49,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976946945] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:49,126 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:49,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:05:49,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1999269764] [2022-03-15 22:05:49,127 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:49,128 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:49,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:05:49,133 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:49,858 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [851#(or (<= N i) (< (+ i 1) N)), 843#(or (<= k i) (< j M)), 865#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 862#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 852#(or (<= N (+ i 1)) (< (+ 2 i) N)), 864#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 860#(or (< j M) (< k N) (< i N)), 850#(< i N), 853#(< j M), 861#(or (<= N i) (< (+ i 1) N) (< k N)), 855#(or (<= N i) (< (+ i 1) N) (< j M)), 859#(or (< k N) (< i N)), 863#(or (< j M) (<= (+ k 1) i)), 856#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 854#(or (< j M) (< i N)), 857#(or (<= (+ k 1) N) (< j M)), 858#(or (<= (+ 2 k) N) (< j M))] [2022-03-15 22:05:49,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:05:49,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:05:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:05:49,859 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 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) [2022-03-15 22:05:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:50,947 INFO L93 Difference]: Finished difference Result 171 states and 489 transitions. [2022-03-15 22:05:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:05:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 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 14 [2022-03-15 22:05:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:50,949 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:05:50,949 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 22:05:50,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:05:50,951 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:50,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:05:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 22:05:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2022-03-15 22:05:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.2989690721649483) internal successors, (320), 97 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 320 transitions. [2022-03-15 22:05:50,961 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 320 transitions. Word has length 14 [2022-03-15 22:05:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:50,961 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 320 transitions. [2022-03-15 22:05:50,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 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) [2022-03-15 22:05:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 320 transitions. [2022-03-15 22:05:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:05:50,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:50,962 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:50,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-15 22:05:51,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:51,176 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1729849712, now seen corresponding path program 3 times [2022-03-15 22:05:51,177 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:51,177 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573518219] [2022-03-15 22:05:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:51,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:51,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:51,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573518219] [2022-03-15 22:05:51,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573518219] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:51,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685194971] [2022-03-15 22:05:51,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:05:51,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:51,225 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) [2022-03-15 22:05:51,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-15 22:05:51,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:05:51,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:51,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:05:51,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:51,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:51,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685194971] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:51,380 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:51,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:05:51,380 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [403660023] [2022-03-15 22:05:51,380 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:51,381 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:51,385 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:05:51,385 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:51,701 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1389#(or (<= N k) (< i N)), 1391#(or (<= N i) (< (+ i 1) N) (<= N k)), 1388#(< i N), 1390#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:05:51,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:05:51,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:51,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:05:51,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:05:51,702 INFO L87 Difference]: Start difference. First operand 98 states and 320 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:52,060 INFO L93 Difference]: Finished difference Result 216 states and 644 transitions. [2022-03-15 22:05:52,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:05:52,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:05:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:52,062 INFO L225 Difference]: With dead ends: 216 [2022-03-15 22:05:52,062 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 22:05:52,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:05:52,063 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:52,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:05:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 22:05:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2022-03-15 22:05:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.335570469798658) internal successors, (497), 149 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:05:52,073 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:05:52,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:52,073 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:05:52,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:05:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:05:52,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:52,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:52,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:05:52,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:52,297 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:52,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1144577720, now seen corresponding path program 1 times [2022-03-15 22:05:52,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:52,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122125886] [2022-03-15 22:05:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:52,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:52,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122125886] [2022-03-15 22:05:52,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122125886] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:52,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276863906] [2022-03-15 22:05:52,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:52,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:52,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:52,341 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) [2022-03-15 22:05:52,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-15 22:05:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:52,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:05:52,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:52,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:05:52,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276863906] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:52,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:52,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:05:52,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [10572069] [2022-03-15 22:05:52,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:52,470 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:52,473 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:05:52,473 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:52,779 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2034#(or (<= N i) (< (+ i 1) N) (< j M)), 2031#(or (<= N i) (<= (+ 2 i) N)), 2030#(or (< (+ j 1) M) (<= M j)), 2029#(< j M), 2033#(or (< (+ j 1) M) (< i N) (<= M j)), 2032#(or (< j M) (< i N))] [2022-03-15 22:05:52,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:05:52,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:05:52,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:05:52,780 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 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) [2022-03-15 22:05:52,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:52,961 INFO L93 Difference]: Finished difference Result 214 states and 714 transitions. [2022-03-15 22:05:52,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:05:52,962 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 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 14 [2022-03-15 22:05:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:52,964 INFO L225 Difference]: With dead ends: 214 [2022-03-15 22:05:52,964 INFO L226 Difference]: Without dead ends: 214 [2022-03-15 22:05:52,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:05:52,965 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:52,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:05:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-03-15 22:05:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2022-03-15 22:05:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.3333333333333335) internal successors, (550), 165 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:05:52,973 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:05:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:52,973 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:05:52,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 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) [2022-03-15 22:05:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:05:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:05:52,974 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:52,974 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:52,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:05:53,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:53,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:05:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 529259106, now seen corresponding path program 4 times [2022-03-15 22:05:53,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:53,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990038613] [2022-03-15 22:05:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:53,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:53,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990038613] [2022-03-15 22:05:53,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990038613] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:53,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318049180] [2022-03-15 22:05:53,468 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:05:53,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:53,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:53,472 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) [2022-03-15 22:05:53,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-15 22:05:53,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:05:53,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:53,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:05:53,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:53,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:05:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:54,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:54,441 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:05:54,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 211 treesize of output 149 [2022-03-15 22:05:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:55,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318049180] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:55,010 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:55,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:05:55,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824067403] [2022-03-15 22:05:55,010 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:55,011 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:55,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:05:55,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:00,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2713#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 2697#(or (= min1 min2) (< k N) (< i N)), 2710#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 2699#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 2708#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 2716#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1))), 2715#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 2702#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 2703#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 2696#(or (= min1 min2) (< i N)), 2700#(or (< j M) (= min1 min2)), 2698#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 2712#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< j M) (= k 0)) (or (< j M) (<= (+ k 1) i))), 2705#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 2718#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 2711#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N)))) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (< j M) (= k 0)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N))))), 2704#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 2709#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 2714#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 2719#(and (or (< j M) (= k i)) (or (< j M) (= i min2)) (or (< j M) (= min1 min2)) (or (< j M) (= k 0))), 2701#(or (< j M) (= min1 min2) (< i N)), 2717#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2))), 2706#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)))), 2707#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)))] [2022-03-15 22:06:00,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:06:00,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:06:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:06:00,424 INFO L87 Difference]: Start difference. First operand 166 states and 550 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:08,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:08,840 INFO L93 Difference]: Finished difference Result 440 states and 1352 transitions. [2022-03-15 22:06:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 22:06:08,841 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:06:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:08,843 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:06:08,844 INFO L226 Difference]: Without dead ends: 423 [2022-03-15 22:06:08,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3219 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1746, Invalid=8966, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 22:06:08,847 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 499 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:08,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 0 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:06:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-03-15 22:06:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 211. [2022-03-15 22:06:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.4571428571428573) internal successors, (726), 210 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 726 transitions. [2022-03-15 22:06:08,859 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 726 transitions. Word has length 15 [2022-03-15 22:06:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:08,859 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 726 transitions. [2022-03-15 22:06:08,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 726 transitions. [2022-03-15 22:06:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:06:08,860 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:08,860 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:08,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:09,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:09,083 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:09,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 689522916, now seen corresponding path program 5 times [2022-03-15 22:06:09,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:09,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37734296] [2022-03-15 22:06:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:09,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:09,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37734296] [2022-03-15 22:06:09,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37734296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:09,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024138980] [2022-03-15 22:06:09,132 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:06:09,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:09,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:09,133 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) [2022-03-15 22:06:09,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-15 22:06:09,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:06:09,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:09,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:06:09,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:09,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:09,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:09,269 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024138980] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:09,269 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:09,269 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:06:09,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1124407781] [2022-03-15 22:06:09,269 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:09,270 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:09,275 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:06:09,275 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:09,946 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [3811#(or (< j M) (<= N k) (< (+ k 1) N)), 3808#(or (<= N i) (< k N)), 3806#(or (<= (+ N 1) i) (< k N)), 3810#(or (<= N k) (< (+ k 1) N)), 3802#(or (<= N i) (< j M)), 3800#(< j M), 3816#(or (<= k i) (< j M)), 3807#(or (< j M) (<= (+ N 1) i) (< k N)), 3805#(or (< j M) (< k N)), 3793#(or (< j M) (<= k (+ i 1))), 3815#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 3809#(or (<= N i) (< j M) (< k N)), 3813#(or (<= N i) (<= N k) (< (+ k 1) N)), 3814#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 3812#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 3801#(or (< j M) (<= (+ N 1) i)), 3804#(< k N), 3803#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:06:09,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:06:09,946 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:06:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:06:09,947 INFO L87 Difference]: Start difference. First operand 211 states and 726 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 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) [2022-03-15 22:06:10,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:10,936 INFO L93 Difference]: Finished difference Result 396 states and 1263 transitions. [2022-03-15 22:06:10,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:06:10,936 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 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 15 [2022-03-15 22:06:10,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:10,939 INFO L225 Difference]: With dead ends: 396 [2022-03-15 22:06:10,939 INFO L226 Difference]: Without dead ends: 390 [2022-03-15 22:06:10,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=962, Invalid=3460, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:06:10,941 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:10,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:06:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-03-15 22:06:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 243. [2022-03-15 22:06:10,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 3.4710743801652892) internal successors, (840), 242 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:10,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 840 transitions. [2022-03-15 22:06:10,951 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 840 transitions. Word has length 15 [2022-03-15 22:06:10,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:10,951 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 840 transitions. [2022-03-15 22:06:10,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 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) [2022-03-15 22:06:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 840 transitions. [2022-03-15 22:06:10,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:06:10,952 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:10,952 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:10,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:06:11,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:11,168 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:11,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1869207442, now seen corresponding path program 2 times [2022-03-15 22:06:11,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:11,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452699927] [2022-03-15 22:06:11,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:11,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:11,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:11,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452699927] [2022-03-15 22:06:11,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452699927] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:11,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926483698] [2022-03-15 22:06:11,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:06:11,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:11,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:11,343 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) [2022-03-15 22:06:11,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-15 22:06:11,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:06:11,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:11,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:06:11,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:11,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:11,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:11,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:06:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:11,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:12,262 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:06:12,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 161 [2022-03-15 22:06:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:14,490 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926483698] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:14,490 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:14,490 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 22:06:14,490 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1095703620] [2022-03-15 22:06:14,490 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:14,491 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:14,495 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:06:14,496 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:17,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [4887#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< i N))), 4881#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 4877#(or (< j M) (= min1 min2)), 4888#(and (or (< j M) (not (= k i)) (= min1 min2)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 4882#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 4886#(and (or (< j M) (= min1 min2) (<= (+ i 1) N) (<= (+ (select A k) 1) min2)) (or (< j M) (<= min2 (select A k)) (<= (+ i 1) N) (= min1 (select A k)))), 4889#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 4884#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2))), 4885#(and (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (<= (select A j) (select A k)))), 4879#(or (< j M) (= min1 min2) (< i N)), 4880#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 4878#(or (= min1 min2) (< i N)), 4883#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1)))] [2022-03-15 22:06:17,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:06:17,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:17,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:06:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:06:17,491 INFO L87 Difference]: Start difference. First operand 243 states and 840 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 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) [2022-03-15 22:06:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:22,140 INFO L93 Difference]: Finished difference Result 710 states and 2042 transitions. [2022-03-15 22:06:22,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:06:22,140 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 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 15 [2022-03-15 22:06:22,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:22,144 INFO L225 Difference]: With dead ends: 710 [2022-03-15 22:06:22,144 INFO L226 Difference]: Without dead ends: 689 [2022-03-15 22:06:22,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=825, Invalid=5027, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:06:22,146 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:22,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:06:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-03-15 22:06:22,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 244. [2022-03-15 22:06:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.4979423868312756) internal successors, (850), 243 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 850 transitions. [2022-03-15 22:06:22,159 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 850 transitions. Word has length 15 [2022-03-15 22:06:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:22,159 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 850 transitions. [2022-03-15 22:06:22,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 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) [2022-03-15 22:06:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 850 transitions. [2022-03-15 22:06:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:06:22,160 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:22,160 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:22,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:22,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:22,383 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:22,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:22,384 INFO L85 PathProgramCache]: Analyzing trace with hash -764809232, now seen corresponding path program 3 times [2022-03-15 22:06:22,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:22,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361180157] [2022-03-15 22:06:22,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:22,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:22,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:06:22,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:22,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361180157] [2022-03-15 22:06:22,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361180157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:22,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534823185] [2022-03-15 22:06:22,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:06:22,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:22,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:22,424 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) [2022-03-15 22:06:22,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-15 22:06:22,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:06:22,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:22,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:06:22,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:06:22,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:06:22,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534823185] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:22,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:22,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-03-15 22:06:22,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1918873224] [2022-03-15 22:06:22,553 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:22,554 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:22,558 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 103 transitions. [2022-03-15 22:06:22,558 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:22,882 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6206#(< i N), 6276#(or (< (+ j 1) M) (<= M j)), 6282#(or (< (+ 2 j) M) (<= M (+ j 1))), 6281#(or (<= N i) (<= (+ 2 M i) (+ N j))), 6275#(< j M), 6278#(or (< j M) (< i N)), 6279#(or (<= N i) (< (+ i 1) N) (< j M)), 6280#(or (<= (+ 3 i) N) (<= N i)), 6277#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:06:22,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:06:22,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:06:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:06:22,883 INFO L87 Difference]: Start difference. First operand 244 states and 850 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:23,394 INFO L93 Difference]: Finished difference Result 560 states and 1826 transitions. [2022-03-15 22:06:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:06:23,394 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:06:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:23,398 INFO L225 Difference]: With dead ends: 560 [2022-03-15 22:06:23,398 INFO L226 Difference]: Without dead ends: 560 [2022-03-15 22:06:23,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=1062, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:06:23,399 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:23,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:06:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-03-15 22:06:23,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 349. [2022-03-15 22:06:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.5804597701149423) internal successors, (1246), 348 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1246 transitions. [2022-03-15 22:06:23,411 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1246 transitions. Word has length 15 [2022-03-15 22:06:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:23,411 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 1246 transitions. [2022-03-15 22:06:23,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1246 transitions. [2022-03-15 22:06:23,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:06:23,413 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:23,413 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:23,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:23,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-03-15 22:06:23,632 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash -519709146, now seen corresponding path program 4 times [2022-03-15 22:06:23,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:23,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126836386] [2022-03-15 22:06:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:23,876 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:23,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126836386] [2022-03-15 22:06:23,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126836386] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:23,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65827697] [2022-03-15 22:06:23,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:06:23,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:23,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:23,877 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) [2022-03-15 22:06:23,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-15 22:06:23,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:06:23,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:23,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:06:23,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:24,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:24,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:24,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:06:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:24,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:24,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:24,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:24,879 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:06:24,879 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 143 [2022-03-15 22:06:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:25,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65827697] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:25,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:25,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:06:25,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28241677] [2022-03-15 22:06:25,414 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:25,414 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:25,418 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:06:25,418 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:28,093 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7682#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 7691#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (< k N) (<= min2 (select A j))) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 7680#(or (= min1 min2) (< i N)), 7684#(or (= min1 min2) (< k N) (< i N)), 7683#(or (= min1 min2) (< k N)), 7688#(and (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= min2 (select A j))) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (select A i) min1))), 7686#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 7681#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 7687#(and (or (<= min2 (select A j)) (< i N) (= (select A j) min1)) (or (<= (+ (select A j) 1) min2) (= min1 min2) (< i N))), 7685#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 7692#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A j) (select A (+ i 1))) (< k N) (< (select A i) min1) (<= min2 (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= (select A j) (select A (+ i 1))) (< k N) (<= min2 (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A i) (select A j)) (< k N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 7690#(and (or (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< i N)) (or (<= (+ k 1) N) (<= min2 (select A j)) (< i N) (= (select A j) min1))), 7689#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A i) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (<= min2 (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= (select A j) (select A (+ i 1))) (<= min2 (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))))] [2022-03-15 22:06:28,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:06:28,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:28,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:06:28,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:06:28,094 INFO L87 Difference]: Start difference. First operand 349 states and 1246 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 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) [2022-03-15 22:06:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:33,429 INFO L93 Difference]: Finished difference Result 731 states and 2341 transitions. [2022-03-15 22:06:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:06:33,429 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 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 15 [2022-03-15 22:06:33,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:33,433 INFO L225 Difference]: With dead ends: 731 [2022-03-15 22:06:33,433 INFO L226 Difference]: Without dead ends: 723 [2022-03-15 22:06:33,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=962, Invalid=4294, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:06:33,435 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 393 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:33,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 0 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:06:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-03-15 22:06:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 358. [2022-03-15 22:06:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.5910364145658265) internal successors, (1282), 357 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1282 transitions. [2022-03-15 22:06:33,450 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1282 transitions. Word has length 15 [2022-03-15 22:06:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:33,450 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 1282 transitions. [2022-03-15 22:06:33,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 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) [2022-03-15 22:06:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1282 transitions. [2022-03-15 22:06:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:33,451 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:33,451 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:33,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:33,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:33,666 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1842155728, now seen corresponding path program 6 times [2022-03-15 22:06:33,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:33,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572964018] [2022-03-15 22:06:33,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:33,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:33,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:33,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572964018] [2022-03-15 22:06:33,719 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572964018] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:33,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322900388] [2022-03-15 22:06:33,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:33,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:33,721 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) [2022-03-15 22:06:33,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-15 22:06:33,755 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:06:33,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:33,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:33,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:33,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:33,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322900388] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:33,846 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:33,846 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:06:33,846 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833343294] [2022-03-15 22:06:33,846 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:33,847 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:33,851 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:06:33,851 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:34,847 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [9344#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9331#(or (< j M) (< i N)), 9354#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9333#(or (<= N i) (< (+ i 1) N)), 9328#(or (< k N) (< i N)), 9337#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9336#(or (<= N (+ i 1)) (< (+ 2 i) N)), 9352#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9356#(or (< j M) (<= (+ k 1) i)), 9355#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 9351#(or (<= (+ 2 k) i) (< j M)), 9350#(or (<= (+ 3 k) N) (< j M)), 9320#(or (<= k i) (< j M)), 9330#(or (<= (+ k 1) N) (< j M)), 9340#(or (<= (+ 2 k) N) (< j M)), 9334#(or (<= N i) (< (+ i 1) N) (< j M)), 9345#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 9348#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9349#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 9332#(or (< j M) (< k N) (< i N)), 9353#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 9327#(< i N), 9343#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 9342#(or (<= (+ 2 k) N) (< j M) (< i N)), 9335#(or (<= N i) (< (+ i 1) N) (< k N)), 9347#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9339#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9329#(< j M), 9341#(or (<= (+ 2 k) N) (< i N)), 9338#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9346#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N))] [2022-03-15 22:06:34,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:06:34,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:34,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:06:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:06:34,848 INFO L87 Difference]: Start difference. First operand 358 states and 1282 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:36,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:36,840 INFO L93 Difference]: Finished difference Result 661 states and 2214 transitions. [2022-03-15 22:06:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:06:36,841 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have 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 [2022-03-15 22:06:36,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:36,844 INFO L225 Difference]: With dead ends: 661 [2022-03-15 22:06:36,844 INFO L226 Difference]: Without dead ends: 661 [2022-03-15 22:06:36,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2472, Invalid=9518, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:06:36,848 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 418 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:36,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 0 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:06:36,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-03-15 22:06:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 411. [2022-03-15 22:06:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.624390243902439) internal successors, (1486), 410 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:36,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1486 transitions. [2022-03-15 22:06:36,863 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1486 transitions. Word has length 16 [2022-03-15 22:06:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:36,863 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 1486 transitions. [2022-03-15 22:06:36,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1486 transitions. [2022-03-15 22:06:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:36,864 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:36,865 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:36,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:37,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:06:37,084 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:37,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:37,084 INFO L85 PathProgramCache]: Analyzing trace with hash -772947566, now seen corresponding path program 7 times [2022-03-15 22:06:37,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:37,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971360369] [2022-03-15 22:06:37,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:37,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:37,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:37,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971360369] [2022-03-15 22:06:37,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971360369] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:37,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437958092] [2022-03-15 22:06:37,138 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:06:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:37,144 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) [2022-03-15 22:06:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-15 22:06:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:37,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:37,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:37,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:37,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437958092] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:37,277 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:37,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:06:37,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [439108962] [2022-03-15 22:06:37,278 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:37,279 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:37,283 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:06:37,283 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:37,780 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11085#(or (<= N (+ k 1)) (< i N)), 11091#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 11087#(or (<= N i) (< (+ i 1) N) (<= N k)), 11090#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 11086#(or (<= N i) (< (+ i 1) N)), 11084#(or (<= N k) (< i N)), 11089#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 11088#(or (<= N (+ i 1)) (< (+ 2 i) N)), 11083#(< i N)] [2022-03-15 22:06:37,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:06:37,780 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:06:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:06:37,781 INFO L87 Difference]: Start difference. First operand 411 states and 1486 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 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) [2022-03-15 22:06:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:38,491 INFO L93 Difference]: Finished difference Result 1132 states and 4011 transitions. [2022-03-15 22:06:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:06:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 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 16 [2022-03-15 22:06:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:38,498 INFO L225 Difference]: With dead ends: 1132 [2022-03-15 22:06:38,498 INFO L226 Difference]: Without dead ends: 1110 [2022-03-15 22:06:38,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=944, Invalid=2716, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:06:38,500 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 298 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:38,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 0 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:06:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-03-15 22:06:38,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 554. [2022-03-15 22:06:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.678119349005425) internal successors, (2034), 553 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 2034 transitions. [2022-03-15 22:06:38,522 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 2034 transitions. Word has length 16 [2022-03-15 22:06:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:38,522 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 2034 transitions. [2022-03-15 22:06:38,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 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) [2022-03-15 22:06:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 2034 transitions. [2022-03-15 22:06:38,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:38,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:38,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:38,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:38,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:06:38,731 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:38,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:38,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2110966522, now seen corresponding path program 5 times [2022-03-15 22:06:38,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:38,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079773535] [2022-03-15 22:06:38,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:38,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:38,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:38,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079773535] [2022-03-15 22:06:38,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079773535] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:38,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944238848] [2022-03-15 22:06:38,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:06:38,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:38,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:38,784 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) [2022-03-15 22:06:38,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-15 22:06:38,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:06:38,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:38,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:06:38,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:38,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:38,917 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944238848] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:38,917 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:38,918 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:06:38,918 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400629661] [2022-03-15 22:06:38,918 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:38,918 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:38,923 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:06:38,923 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:39,643 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [13522#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 13507#(or (<= N k) (< i N)), 13506#(< i N), 13520#(or (<= N i) (< (+ i 1) N) (< j M)), 13515#(or (< j M) (< i N)), 13518#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 13510#(or (<= N (+ i 1)) (< (+ 2 i) N)), 13525#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 13523#(or (< j M) (<= i k)), 13511#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 13517#(or (< j M) (<= i (+ k 1))), 13513#(or (< j M) (<= N k)), 13508#(or (<= N i) (< (+ i 1) N)), 13512#(< j M), 13516#(or (< j M) (<= N k) (< i N)), 13521#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 13524#(or (< (+ j 1) M) (<= i k) (<= M j)), 13519#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 13509#(or (<= N i) (< (+ i 1) N) (<= N k)), 13514#(or (<= N (+ k 1)) (< j M))] [2022-03-15 22:06:39,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:06:39,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:39,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:06:39,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:06:39,644 INFO L87 Difference]: Start difference. First operand 554 states and 2034 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:41,741 INFO L93 Difference]: Finished difference Result 1411 states and 4886 transitions. [2022-03-15 22:06:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 22:06:41,741 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:06:41,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:41,748 INFO L225 Difference]: With dead ends: 1411 [2022-03-15 22:06:41,748 INFO L226 Difference]: Without dead ends: 1397 [2022-03-15 22:06:41,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4040 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2856, Invalid=10254, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 22:06:41,752 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 371 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:41,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:06:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-03-15 22:06:41,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 723. [2022-03-15 22:06:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 3.9265927977839334) internal successors, (2835), 722 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 2835 transitions. [2022-03-15 22:06:41,779 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 2835 transitions. Word has length 16 [2022-03-15 22:06:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:41,779 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 2835 transitions. [2022-03-15 22:06:41,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 2835 transitions. [2022-03-15 22:06:41,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:41,781 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:41,781 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:41,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:42,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:06:42,004 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash -687661098, now seen corresponding path program 6 times [2022-03-15 22:06:42,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:42,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198508026] [2022-03-15 22:06:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:42,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:42,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198508026] [2022-03-15 22:06:42,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198508026] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:42,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577594603] [2022-03-15 22:06:42,056 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:42,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:42,057 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) [2022-03-15 22:06:42,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-15 22:06:42,087 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:06:42,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:42,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:42,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:42,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:42,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:42,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577594603] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:42,205 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:42,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:06:42,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123741159] [2022-03-15 22:06:42,205 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:42,206 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:42,212 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:06:42,212 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:43,063 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16659#(< i N), 16680#(or (<= (+ k j) (+ M i 1)) (<= N i)), 16663#(or (<= (+ 2 k) N) (< j M)), 16679#(or (<= N i) (<= k (+ i 1))), 16657#(< j M), 16665#(or (<= N i) (< (+ i 1) N)), 16669#(or (< j M) (<= (+ k 1) i)), 16670#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 16666#(or (<= N i) (< (+ i 1) N) (< j M)), 16674#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 16661#(or (< k N) (< i N)), 16662#(or (< j M) (< k N) (< i N)), 16668#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 16676#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16672#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16673#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 16678#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 16671#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16658#(or (<= (+ k 1) N) (< j M)), 16667#(or (<= N i) (< (+ i 1) N) (< k N)), 16677#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 16664#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 16660#(or (< j M) (< i N)), 16675#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 22:06:43,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:06:43,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:06:43,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:06:43,064 INFO L87 Difference]: Start difference. First operand 723 states and 2835 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:47,569 INFO L93 Difference]: Finished difference Result 2149 states and 7120 transitions. [2022-03-15 22:06:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:06:47,570 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have 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 [2022-03-15 22:06:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:47,578 INFO L225 Difference]: With dead ends: 2149 [2022-03-15 22:06:47,578 INFO L226 Difference]: Without dead ends: 2148 [2022-03-15 22:06:47,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11785 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5679, Invalid=27993, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:06:47,580 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 532 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:47,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 0 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:06:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-03-15 22:06:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 988. [2022-03-15 22:06:47,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 4.053698074974671) internal successors, (4001), 987 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 4001 transitions. [2022-03-15 22:06:47,623 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 4001 transitions. Word has length 16 [2022-03-15 22:06:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:47,623 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 4001 transitions. [2022-03-15 22:06:47,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 4001 transitions. [2022-03-15 22:06:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:47,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:47,626 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:47,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:47,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 22:06:47,836 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:47,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 416737112, now seen corresponding path program 7 times [2022-03-15 22:06:47,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:47,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196881965] [2022-03-15 22:06:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:47,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:06:47,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:47,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196881965] [2022-03-15 22:06:47,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196881965] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:47,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540259184] [2022-03-15 22:06:47,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:06:47,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:47,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:47,879 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) [2022-03-15 22:06:47,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-15 22:06:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:47,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:06:47,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:06:47,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:06:48,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540259184] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:48,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:48,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 22:06:48,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [599542863] [2022-03-15 22:06:48,035 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:48,036 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:48,040 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:06:48,040 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:48,550 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [21202#(or (<= N i) (<= (+ 2 i) N)), 21209#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 21207#(or (< (+ 2 j) M) (<= M (+ j 1))), 21201#(< j M), 21210#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 21206#(or (< (+ j 1) M) (<= M j)), 21205#(or (<= N i) (<= (+ M i 1) (+ N j))), 21208#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 21204#(or (<= N i) (< (+ i 1) N) (< j M)), 21203#(or (< j M) (< i N))] [2022-03-15 22:06:48,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:06:48,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:06:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:06:48,551 INFO L87 Difference]: Start difference. First operand 988 states and 4001 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 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) [2022-03-15 22:06:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:49,416 INFO L93 Difference]: Finished difference Result 2796 states and 10220 transitions. [2022-03-15 22:06:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:06:49,416 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 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 16 [2022-03-15 22:06:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:49,431 INFO L225 Difference]: With dead ends: 2796 [2022-03-15 22:06:49,431 INFO L226 Difference]: Without dead ends: 2796 [2022-03-15 22:06:49,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:06:49,432 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:49,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:06:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2022-03-15 22:06:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1188. [2022-03-15 22:06:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 4.176916596461668) internal successors, (4958), 1187 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 4958 transitions. [2022-03-15 22:06:49,492 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 4958 transitions. Word has length 16 [2022-03-15 22:06:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:49,492 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 4958 transitions. [2022-03-15 22:06:49,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 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) [2022-03-15 22:06:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 4958 transitions. [2022-03-15 22:06:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:49,498 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:49,498 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:49,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:49,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:49,711 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:49,712 INFO L85 PathProgramCache]: Analyzing trace with hash 661837198, now seen corresponding path program 8 times [2022-03-15 22:06:49,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:49,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943398303] [2022-03-15 22:06:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:49,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:49,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943398303] [2022-03-15 22:06:49,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943398303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:49,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032593933] [2022-03-15 22:06:49,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:06:49,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:49,776 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) [2022-03-15 22:06:49,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-15 22:06:49,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:06:49,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:49,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:49,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:49,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:50,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032593933] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:50,027 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:50,027 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:06:50,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [527681128] [2022-03-15 22:06:50,027 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:50,028 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:50,033 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:06:50,033 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:50,862 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [26550#(or (<= N (+ i 1)) (< (+ 2 i) N)), 26559#(or (<= (+ 2 j) M) (< i N)), 26565#(or (< k N) (<= (+ j 1) M)), 26560#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 26555#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 26567#(or (<= (+ 2 k j) (+ N M)) (< i N)), 26571#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 26552#(or (< k N) (< i N)), 26553#(or (<= N i) (< (+ i 1) N) (< k N)), 26554#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 26558#(or (<= N i) (< (+ i 1) N) (< j M)), 26570#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 26564#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 26549#(or (<= N i) (< (+ i 1) N)), 26561#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 26572#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 26566#(or (< j M) (< k N) (< i N)), 26569#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 26551#(< k N), 26568#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 26557#(or (<= (+ j 1) M) (< i N)), 26563#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 26573#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 26556#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 26562#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 26548#(< i N)] [2022-03-15 22:06:50,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:06:50,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:06:50,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:06:50,864 INFO L87 Difference]: Start difference. First operand 1188 states and 4958 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 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) [2022-03-15 22:06:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:54,173 INFO L93 Difference]: Finished difference Result 2178 states and 8067 transitions. [2022-03-15 22:06:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:06:54,174 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 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 16 [2022-03-15 22:06:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:54,184 INFO L225 Difference]: With dead ends: 2178 [2022-03-15 22:06:54,184 INFO L226 Difference]: Without dead ends: 2178 [2022-03-15 22:06:54,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7421 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4412, Invalid=19768, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:06:54,188 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:54,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:06:54,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2022-03-15 22:06:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1361. [2022-03-15 22:06:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 4.268382352941177) internal successors, (5805), 1360 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 5805 transitions. [2022-03-15 22:06:54,237 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 5805 transitions. Word has length 16 [2022-03-15 22:06:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:54,238 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 5805 transitions. [2022-03-15 22:06:54,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 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) [2022-03-15 22:06:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 5805 transitions. [2022-03-15 22:06:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:54,242 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:54,242 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:54,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:54,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:06:54,447 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:54,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1488485624, now seen corresponding path program 9 times [2022-03-15 22:06:54,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:54,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986360626] [2022-03-15 22:06:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:54,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:54,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:54,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986360626] [2022-03-15 22:06:54,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986360626] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:54,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281736920] [2022-03-15 22:06:54,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:06:54,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:54,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:54,500 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) [2022-03-15 22:06:54,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-15 22:06:54,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:06:54,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:54,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:06:54,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:54,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:54,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281736920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:54,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:54,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:06:54,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [733018905] [2022-03-15 22:06:54,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:54,710 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:54,714 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:06:54,714 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:55,230 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31805#(< i N), 31807#(or (<= N k) (< i N)), 31808#(or (<= (+ N M) (+ k j 1)) (< i N)), 31804#(< j M), 31816#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 31810#(or (<= N i) (< (+ i 1) N) (< j M)), 31813#(or (<= N i) (< (+ i 1) N) (<= N k)), 31811#(or (<= N (+ i 1)) (< (+ 2 i) N)), 31806#(or (< j M) (< i N)), 31814#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 31815#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 31809#(or (<= N i) (< (+ i 1) N)), 31812#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:06:55,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:06:55,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:06:55,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:06:55,231 INFO L87 Difference]: Start difference. First operand 1361 states and 5805 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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) [2022-03-15 22:06:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:56,745 INFO L93 Difference]: Finished difference Result 4245 states and 17123 transitions. [2022-03-15 22:06:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:06:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 16 [2022-03-15 22:06:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:56,760 INFO L225 Difference]: With dead ends: 4245 [2022-03-15 22:06:56,760 INFO L226 Difference]: Without dead ends: 4190 [2022-03-15 22:06:56,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2286 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:06:56,762 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:56,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:06:56,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2022-03-15 22:06:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2019. [2022-03-15 22:06:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 4.581268582755203) internal successors, (9245), 2018 states have internal predecessors, (9245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 9245 transitions. [2022-03-15 22:06:56,843 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 9245 transitions. Word has length 16 [2022-03-15 22:06:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:56,843 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 9245 transitions. [2022-03-15 22:06:56,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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) [2022-03-15 22:06:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 9245 transitions. [2022-03-15 22:06:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:56,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:56,850 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:56,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 22:06:57,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:57,072 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:06:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2034886336, now seen corresponding path program 10 times [2022-03-15 22:06:57,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:57,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669643900] [2022-03-15 22:06:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:57,116 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:57,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669643900] [2022-03-15 22:06:57,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669643900] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:57,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512696404] [2022-03-15 22:06:57,116 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:06:57,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:57,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:57,117 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) [2022-03-15 22:06:57,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:06:57,151 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:06:57,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:57,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:06:57,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:57,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:57,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512696404] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:57,339 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:57,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:06:57,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987871537] [2022-03-15 22:06:57,339 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:57,340 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:57,344 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:06:57,344 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:57,792 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [40324#(< i N), 40329#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 40328#(or (<= N (+ i 1)) (< (+ 2 i) N)), 40335#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 40336#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 40330#(< k N), 40334#(or (<= (+ N M) (+ k j 1)) (< i N)), 40331#(or (< k N) (< i N)), 40332#(or (<= N i) (< (+ i 1) N) (< k N)), 40325#(or (<= N i) (< (+ i 1) N)), 40326#(or (< i N) (<= M j)), 40333#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 40327#(or (<= N i) (< (+ i 1) N) (<= M j))] [2022-03-15 22:06:57,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:06:57,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:06:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:06:57,793 INFO L87 Difference]: Start difference. First operand 2019 states and 9245 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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) [2022-03-15 22:06:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:59,751 INFO L93 Difference]: Finished difference Result 4152 states and 16909 transitions. [2022-03-15 22:06:59,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:06:59,751 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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 16 [2022-03-15 22:06:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:59,765 INFO L225 Difference]: With dead ends: 4152 [2022-03-15 22:06:59,765 INFO L226 Difference]: Without dead ends: 4093 [2022-03-15 22:06:59,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2783, Invalid=11259, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:06:59,766 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 331 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:59,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:06:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-03-15 22:06:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 2154. [2022-03-15 22:06:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2153 states have (on average 4.626103111936833) internal successors, (9960), 2153 states have internal predecessors, (9960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 9960 transitions. [2022-03-15 22:06:59,841 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 9960 transitions. Word has length 16 [2022-03-15 22:06:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:59,841 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 9960 transitions. [2022-03-15 22:06:59,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 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) [2022-03-15 22:06:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 9960 transitions. [2022-03-15 22:06:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:06:59,848 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:59,848 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:59,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:07:00,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:00,064 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:07:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1272142052, now seen corresponding path program 8 times [2022-03-15 22:07:00,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:00,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388980463] [2022-03-15 22:07:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:07:00,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:00,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388980463] [2022-03-15 22:07:00,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388980463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:00,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698778532] [2022-03-15 22:07:00,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:07:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:00,711 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) [2022-03-15 22:07:00,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:07:00,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:07:00,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:00,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:07:00,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:01,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:07:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:07:01,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:02,928 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:07:02,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 967 treesize of output 509 [2022-03-15 22:07:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:07:12,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698778532] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:12,076 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:12,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:07:12,076 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2038635715] [2022-03-15 22:07:12,076 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:12,077 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:12,082 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:07:12,083 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:31,616 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [49109#(and (or (<= N (+ 2 i)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (not (< (select A i) min1)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1))), 49105#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 49124#(and (or (<= N (+ 2 i)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (not (< (select A i) min1)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 49118#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1))), 49111#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 49120#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 49099#(or (= min1 min2) (< i N)), 49098#(and (or (< j M) (= k 0) (< (+ 3 k) N)) (or (<= min2 (select A (+ (- 2) N))) (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= (+ (select A k) 1) min2) (< (+ 3 k) N) (= (select A (+ (- 2) N)) min1)) (or (< j M) (<= (+ (select A (+ (- 2) N)) 1) min2) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< (+ 3 k) N) (<= min2 (select A (+ (- 1) N)))) (or (<= (+ 3 k) N) (< j M)) (or (<= (+ (select A (+ (- 2) N)) 1) (select A k)) (< j M) (<= (select A k) (select A (+ (- 1) N))) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (< (+ 3 k) N)) (or (<= min2 (select A (+ (- 2) N))) (< j M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< (+ 3 k) N)) (or (< j M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (<= (select A k) (select A (+ (- 2) N))) (< (+ 3 k) N)) (or (< j M) (= min1 min2) (<= (+ (select A (+ (- 2) N)) 1) min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2) (< (+ 3 k) N)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (<= (+ (select A (+ (- 2) N)) 1) (select A k)) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (+ 3 k) N)) (or (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= min2 (select A k)) (<= (select A k) (select A (+ (- 2) N))) (< (+ 3 k) N) (= (select A (+ (- 2) N)) min1))), 49126#(and (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (not (< (+ i 1) N)) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 i) N) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2))), 49132#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (select A k) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) min1) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)) (or (<= min1 (select A (+ 2 i))) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (select A k) min2) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (< (select A (+ 2 i)) min1))), 49107#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 49129#(and (or (< j M) (<= min2 min1) (<= (+ (select A k) 1) min2)) (or (< j M) (= k 0)) (or (< j M) (<= min2 (select A k)) (<= (select A k) min1)) (or (< j M) (<= min1 min2)) (or (< j M) (<= min1 (select A k))) (or (< j M) (<= (+ k 1) i))), 49116#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 49095#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 49122#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A i) min1) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (< (+ i 1) N) (< j M) (<= (select A k) (select A (+ (- 1) N))) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (= min1 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (= (select A i) (select A k)))), 49117#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 49103#(or (< j M) (= min1 min2) (< i N)), 49106#(and (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< i N) (<= min2 (select A (+ (- 1) N)))) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2) (< i N)) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (< i N)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 49096#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)))), 49119#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 49131#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1))), 49101#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N))), 49102#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2) (< i N)) (or (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (< i N)) (or (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< i N) (<= min2 (select A (+ (- 1) N))))), 49128#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))))), 49110#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 49094#(or (< j M) (= min1 min2)), 49112#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 49133#(and (or (< j M) (= k i)) (or (< j M) (= i min1)) (or (< j M) (= min1 min2)) (or (< j M) (= k 0))), 49115#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 49121#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A i) min1) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (= (select A i) (select A k))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (< (+ i 1) N) (<= (select A k) (select A (+ (- 1) N))) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (= min1 (select A (+ (- 1) N)))) (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) min2) (= (select A i) min2))), 49125#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1))), 49123#(and (or (< j M) (= k 0) (< (+ 2 k) i)) (or (< j M) (< (+ 2 k) i) (<= min1 (select A k))) (or (< j M) (<= (select A k) (select A (+ (- 1) i))) (<= min2 (select A k)) (< (+ 2 k) i) (= (select A (+ (- 1) i)) min1)) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (<= (+ (select A (+ (- 1) i)) 1) min2) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ 2 k) i)) (or (< j M) (<= (+ (select A k) 1) min2) (< (+ 2 k) i) (= (select A (+ (- 1) i)) min1) (<= min2 (select A (+ (- 1) i)))) (or (< j M) (<= (+ (select A (+ (- 1) i)) 1) (select A k)) (<= min2 (select A k)) (< (+ 2 k) i) (<= (select A k) min1))), 49100#(or (= min1 min2) (< k N) (< i N)), 49113#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2))), 49108#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 49114#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 49104#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 49127#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= min1 (select A (+ 2 i))) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (< (select A (+ 2 i)) min1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (select A k) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (select A k) min2) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= (select A (+ k 1)) min1) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) min1) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k)) (< (select A (+ i 1)) (select A i)))), 49130#(and (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 49097#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N)))) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))))] [2022-03-15 22:07:31,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:07:31,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:31,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:07:31,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=3636, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:07:31,618 INFO L87 Difference]: Start difference. First operand 2154 states and 9960 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:35,947 INFO L93 Difference]: Finished difference Result 3049 states and 12890 transitions. [2022-03-15 22:08:35,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-15 22:08:35,947 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have 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 [2022-03-15 22:08:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:35,960 INFO L225 Difference]: With dead ends: 3049 [2022-03-15 22:08:35,960 INFO L226 Difference]: Without dead ends: 3004 [2022-03-15 22:08:35,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18323 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=7348, Invalid=43954, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 22:08:35,963 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 914 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:35,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 0 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 22:08:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-03-15 22:08:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2258. [2022-03-15 22:08:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 4.609658839167036) internal successors, (10404), 2257 states have internal predecessors, (10404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 10404 transitions. [2022-03-15 22:08:36,034 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 10404 transitions. Word has length 17 [2022-03-15 22:08:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:36,035 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 10404 transitions. [2022-03-15 22:08:36,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 10404 transitions. [2022-03-15 22:08:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:08:36,041 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:36,041 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:36,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:08:36,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:36,263 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:08:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2114457254, now seen corresponding path program 9 times [2022-03-15 22:08:36,264 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:36,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006163192] [2022-03-15 22:08:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:36,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:36,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006163192] [2022-03-15 22:08:36,328 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006163192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:36,328 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796403946] [2022-03-15 22:08:36,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:08:36,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:36,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:36,329 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) [2022-03-15 22:08:36,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:08:36,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:08:36,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:36,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:08:36,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:36,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:36,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796403946] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:36,447 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:36,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:08:36,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [200628370] [2022-03-15 22:08:36,447 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:36,448 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:36,453 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:08:36,454 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:37,715 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [57156#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 57158#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 57147#(or (<= N i) (< j M)), 57161#(or (< j M) (<= k (+ 2 i))), 57142#(or (< j M) (< k N)), 57139#(or (<= N i) (<= N k) (< (+ k 1) N)), 57149#(or (<= N (+ 2 i)) (< j M)), 57143#(or (< j M) (<= N k) (< (+ k 1) N)), 57155#(or (<= N i) (< j M) (< k N)), 57134#(or (<= (+ N 1) i) (< k N)), 57138#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 57140#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 57153#(or (< j M) (<= (+ N 1) i) (< k N)), 57126#(or (< j M) (<= k (+ i 1))), 57163#(or (<= k i) (< j M)), 57157#(or (<= N (+ i 1)) (< j M) (< k N)), 57159#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 57137#(or (<= N k) (< (+ k 1) N)), 57154#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 57141#(< j M), 57146#(or (< j M) (<= (+ N 1) i)), 57144#(or (<= N (+ k 1)) (< (+ 2 k) N)), 57150#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 57151#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 57136#(or (<= N (+ i 1)) (< k N)), 57162#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 57145#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 57160#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 57133#(< k N), 57152#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 57135#(or (<= N i) (< k N)), 57148#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:08:37,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:08:37,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:08:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:08:37,717 INFO L87 Difference]: Start difference. First operand 2258 states and 10404 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:40,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:40,021 INFO L93 Difference]: Finished difference Result 3018 states and 13042 transitions. [2022-03-15 22:08:40,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:08:40,022 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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 [2022-03-15 22:08:40,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:40,031 INFO L225 Difference]: With dead ends: 3018 [2022-03-15 22:08:40,031 INFO L226 Difference]: Without dead ends: 3004 [2022-03-15 22:08:40,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3590 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3071, Invalid=11209, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 22:08:40,034 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 404 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:40,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 0 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:08:40,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-03-15 22:08:40,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2359. [2022-03-15 22:08:40,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2358 states have (on average 4.592027141645462) internal successors, (10828), 2358 states have internal predecessors, (10828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 10828 transitions. [2022-03-15 22:08:40,110 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 10828 transitions. Word has length 17 [2022-03-15 22:08:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:40,110 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 10828 transitions. [2022-03-15 22:08:40,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 10828 transitions. [2022-03-15 22:08:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:08:40,117 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:40,117 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:40,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:08:40,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:40,331 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:08:40,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2888034, now seen corresponding path program 11 times [2022-03-15 22:08:40,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:40,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926911657] [2022-03-15 22:08:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:40,609 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:40,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926911657] [2022-03-15 22:08:40,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926911657] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:40,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242096431] [2022-03-15 22:08:40,609 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:08:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:40,610 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) [2022-03-15 22:08:40,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:08:40,636 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:08:40,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:40,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:08:40,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:41,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:41,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:41,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:08:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:41,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:43,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:43,136 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:08:43,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 887 treesize of output 527 [2022-03-15 22:09:40,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:09:40,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242096431] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:09:40,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:09:40,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 22:09:40,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [608355862] [2022-03-15 22:09:40,877 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:09:40,878 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:09:40,884 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:09:40,884 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:09:52,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [65179#(and (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j)))) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j)))) (or (not (< (+ j 1) M)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (< (select A (+ j 1)) min2)) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (<= (+ (select A k) 1) (select A j)) (< (+ 2 j) M) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< (+ j 1) M)) (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (<= (+ (select A k) 1) min2) (< (select A (+ j 1)) min2)) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A (+ j 1)) min2))) (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (select A j) min2) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A (+ j 1)) min2)))), 65175#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 65170#(or (< j M) (= min1 min2)), 65181#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< i N))), 65183#(and (or (< j M) (not (= k i)) (= min1 min2)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 65180#(and (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 65173#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 65185#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 65186#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 65176#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 65189#(and (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (not (= k i)) (< (select A j) min2) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (= k i)) (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (<= M (+ j 1))) (or (< (+ 2 j) M) (<= M (+ j 1)) (< i (+ k 1))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (not (= k i)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1))) (or (not (= k i)) (< (select A (+ j 1)) (select A j)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1)) (= (select A j) min1)) (or (<= (+ k 1) N) (<= k i) (< (+ 2 j) M) (<= M (+ j 1)))), 65178#(and (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (<= (select A j) (select A k)))), 65184#(and (or (< j M) (= min1 min2) (<= (+ (select A i) 1) min1)) (or (<= (+ k 1) N) (< j M)) (or (<= (+ i 1) k) (< j M)) (or (<= min1 (select A i)) (< j M) (= (select A i) min2))), 65172#(or (< j M) (= min1 min2) (< i N)), 65188#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) 1) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= min1 (select A i)) (not (< j M)) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A i) 1) min1)) (or (< (+ j 1) M) (<= min1 (select A i)) (< (select A j) min2) (not (< j M)) (= (select A i) min2)) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)))), 65182#(and (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j))) (< i N)) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j))) (< i N)) (or (not (< (+ j 1) M)) (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (<= (+ (select A k) 1) min2) (< (select A (+ j 1)) min2) (< i N)) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (<= (+ (select A k) 1) (select A j)) (< (+ 2 j) M) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (select A j) min2) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A (+ j 1)) min2)) (< i N)) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A (+ j 1)) min2)) (< i N)) (or (not (< (+ j 1) M)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (< i N))), 65187#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 65177#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2))), 65174#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 65190#(and (or (<= (+ i 1) k) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (+ k 1) N) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= min1 (select A i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) (select A (+ j 1)))) (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (< (+ 2 j) M) (<= (+ (select A i) 1) min1) (<= M (+ j 1))) (or (<= (select A j) (select A (+ j 1))) (<= min1 (select A i)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1)) (= (select A i) (select A (+ j 1)))) (or (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (<= (+ (select A i) 1) min1) (<= M (+ j 1))) (or (<= min1 (select A i)) (< (select A j) min2) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (<= M (+ j 1)) (= (select A i) min2)) (or (<= min1 (select A i)) (< (select A (+ j 1)) (select A j)) (= (select A i) (select A j)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (< (+ 2 j) M) (<= (+ (select A i) 1) min1) (<= min2 (select A j)) (<= M (+ j 1))) (or (< (select A (+ j 1)) (select A j)) (< (+ 2 j) M) (<= (+ (select A i) 1) min1) (<= min2 (select A j)) (<= M (+ j 1)) (= (select A j) min1))), 65171#(or (= min1 min2) (< i N))] [2022-03-15 22:09:52,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:09:52,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:09:52,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:09:52,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1788, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:09:52,053 INFO L87 Difference]: Start difference. First operand 2359 states and 10828 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:10:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:15,120 INFO L93 Difference]: Finished difference Result 4006 states and 15508 transitions. [2022-03-15 22:10:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 22:10:15,120 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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 [2022-03-15 22:10:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:15,129 INFO L225 Difference]: With dead ends: 4006 [2022-03-15 22:10:15,129 INFO L226 Difference]: Without dead ends: 3974 [2022-03-15 22:10:15,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4978 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=2323, Invalid=14707, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 22:10:15,130 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:15,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:10:15,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2022-03-15 22:10:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 2479. [2022-03-15 22:10:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 4.567393058918483) internal successors, (11318), 2478 states have internal predecessors, (11318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:10:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 11318 transitions. [2022-03-15 22:10:15,197 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 11318 transitions. Word has length 17 [2022-03-15 22:10:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:15,197 INFO L470 AbstractCegarLoop]: Abstraction has 2479 states and 11318 transitions. [2022-03-15 22:10:15,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:10:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 11318 transitions. [2022-03-15 22:10:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:15,204 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:15,204 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:15,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:10:15,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 22:10:15,426 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:10:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -778125788, now seen corresponding path program 12 times [2022-03-15 22:10:15,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:15,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179048741] [2022-03-15 22:10:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:15,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:15,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179048741] [2022-03-15 22:10:15,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179048741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:15,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277143983] [2022-03-15 22:10:15,849 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:10:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:15,850 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) [2022-03-15 22:10:15,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:10:15,878 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:10:15,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:10:15,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:10:15,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:16,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:16,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:16,669 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:10:16,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 161 [2022-03-15 22:10:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:17,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:18,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:18,776 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:10:18,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 883 treesize of output 527 [2022-03-15 22:11:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:11:03,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277143983] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:03,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:03,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 22:11:03,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1648553473] [2022-03-15 22:11:03,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:03,477 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:03,482 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:11:03,482 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:13,619 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [74459#(and (or (< i (+ 2 j)) (not (< j M))) (or (<= (+ M 1) N) (not (< j M))) (or (not (= (+ j 1) i)) (not (< j M)) (<= (+ M i) (+ k j 1))) (or (not (= (+ j 1) i)) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ k 1) N) (not (= (+ j 1) i)) (not (< j M))) (or (not (= (+ j 1) i)) (< (select A j) min2) (not (< j M)) (= min1 min2))), 74450#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 74463#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 74448#(or (= min1 min2) (< i N)), 74455#(or (= min1 min2) (< k N) (< i N)), 74454#(or (= min1 min2) (< k N)), 74461#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1))), 74457#(and (or (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (+ (select A k) 1) (select A j)) (<= M (+ j 1)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (<= M (+ j 1)) (< i N)) (or (< (select A j) min2) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ j 1)) 1) min2) (<= M (+ j 1)) (< i N)) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1)) (not (< (select A j) min2)) (< i N)) (or (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (<= M (+ j 1)) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1)) (< i N))), 74452#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= min2 (select A j)) (<= M j)) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (select A i) min1) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1) (<= M j)) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (<= M j) (= (select A i) min2))), 74453#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A i) (select A j)) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (< (select A (+ i 1)) (select A i)) (<= M j) (= (select A i) min2)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A j) (select A (+ i 1))) (not (< (select A j) min2)) (<= M j)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (= min2 (select A (+ i 1))) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (not (< (select A j) min2)) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A i) min1) (not (< (select A j) min2)) (= (select A j) min1) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A j) min2) (= min1 min2) (< (select A i) min1) (<= M j))), 74460#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 74456#(and (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1)) (not (< (select A j) min2))) (or (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (<= M (+ j 1)) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (select A j) min2) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ j 1)) 1) min2) (<= M (+ j 1))) (or (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (<= M (+ j 1))) (or (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (+ (select A k) 1) (select A j)) (<= M (+ j 1)) (not (< (select A j) min2)) (= (select A j) min1))), 74462#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 74464#(and (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (not (< (select A (+ 2 i)) (select A i))) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (not (< (select A (+ 2 i)) (select A i))) (= (select A (+ 2 i)) min2) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (+ 3 i) N) (< (select A i) min1) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (not (< (select A j) min2)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (< (select A j) min2) (not (< (select A (+ 2 i)) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= M j)) (or (< (select A (+ 2 i)) (select A i)) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A i) (select A j)) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (< (select A j) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (not (< (select A j) min2)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (not (< (select A (+ 2 i)) min1)) (< (+ 3 i) N) (< (select A i) min1) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (not (< (select A j) min2)) (= (select A j) min1) (<= M j)) (or (< (select A (+ 2 i)) (select A i)) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (<= M j) (= (select A i) min2)) (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j))), 74451#(and (or (<= min2 (select A j)) (< i N) (= (select A j) min1) (<= M j)) (or (<= (+ (select A j) 1) min2) (= min1 min2) (< i N) (<= M j))), 74449#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 74458#(and (or (<= (+ k 1) N) (<= k i) (<= (+ M i) (+ N j)) (not (< j M))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (not (< (select A j) min2))) (or (not (= k i)) (<= (+ M i) (+ N j)) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ M i) (+ 2 k j)) (<= (+ M i) (+ N j)) (not (< j M)) (< i (+ k 1))) (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (not (= k i)) (<= (+ M i) (+ N j)) (< (select A j) min2) (not (< j M))))] [2022-03-15 22:11:13,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:11:13,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:13,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:11:13,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1549, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:11:13,620 INFO L87 Difference]: Start difference. First operand 2479 states and 11318 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 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) [2022-03-15 22:12:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:41,373 INFO L93 Difference]: Finished difference Result 7044 states and 26091 transitions. [2022-03-15 22:12:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-03-15 22:12:41,374 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 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 17 [2022-03-15 22:12:41,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:41,389 INFO L225 Difference]: With dead ends: 7044 [2022-03-15 22:12:41,389 INFO L226 Difference]: Without dead ends: 7007 [2022-03-15 22:12:41,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29082 ImplicationChecksByTransitivity, 87.5s TimeCoverageRelationStatistics Valid=11880, Invalid=59142, Unknown=0, NotChecked=0, Total=71022 [2022-03-15 22:12:41,392 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 731 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:41,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 0 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:12:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2022-03-15 22:12:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 2696. [2022-03-15 22:12:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2695 states have (on average 4.559925788497217) internal successors, (12289), 2695 states have internal predecessors, (12289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 12289 transitions. [2022-03-15 22:12:41,477 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 12289 transitions. Word has length 17 [2022-03-15 22:12:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:41,478 INFO L470 AbstractCegarLoop]: Abstraction has 2696 states and 12289 transitions. [2022-03-15 22:12:41,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 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) [2022-03-15 22:12:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 12289 transitions. [2022-03-15 22:12:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:12:41,485 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:41,485 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:41,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 22:12:41,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:12:41,686 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:41,687 INFO L85 PathProgramCache]: Analyzing trace with hash 157231774, now seen corresponding path program 13 times [2022-03-15 22:12:41,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:41,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571553828] [2022-03-15 22:12:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:41,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:42,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:42,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571553828] [2022-03-15 22:12:42,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571553828] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:42,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586431998] [2022-03-15 22:12:42,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:12:42,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:42,030 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) [2022-03-15 22:12:42,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:12:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:42,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:12:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:42,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:42,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:42,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:42,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:42,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:42,910 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 153 [2022-03-15 22:12:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:43,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:44,662 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:12:44,663 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 907 treesize of output 527 [2022-03-15 22:13:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:16,771 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586431998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:16,771 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:16,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 22:13:16,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1754306945] [2022-03-15 22:13:16,771 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:16,772 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:16,778 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:13:16,778 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:13:31,267 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [87497#(and (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (= min1 (select A k))) (or (< (+ j 1) M) (<= (+ min1 1) (select A j)) (not (< j M)) (<= (select A j) (select A k))) (or (< (+ j 1) M) (<= (+ min1 1) min2) (<= min2 (select A k)) (not (< j M))) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= min1 min2) (not (< j M))) (or (< (+ j 1) M) (<= min1 (select A j)) (not (< j M)))), 87488#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1))), 87479#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)))), 87482#(or (= min1 min2) (< k N) (< i N)), 87492#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 87491#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 87474#(or (= min1 min2) (< i N)), 87505#(and (or (< i k) (not (< i N))) (or (not (= (+ i 1) k)) (not (< i N)) (= min1 min2) (< (select A i) min1)) (or (not (< (select A i) min1)) (not (= (+ i 1) k)) (not (< i N)) (= (select A i) min2)) (or (<= (+ k j) (+ M i 1)) (not (< i N)))), 87485#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 87499#(and (or (< i k) (not (< i N))) (or (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (not (< i N)) (<= k (+ i 1))) (or (not (< i N)) (= min1 min2) (< (select A i) min1))), 87503#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= min2 (select A k))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A (+ i 1)) min1)) (<= min2 (select A k)) (< (select A i) min1))), 87495#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 87496#(and (or (< j M) (<= (+ min1 1) min2) (<= min2 (select A k))) (or (< j M) (= min1 min2) (= min1 (select A k))) (or (< j M) (<= min1 min2)) (or (< j M) (<= (+ k 1) i))), 87490#(and (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A (+ i 1)) min1)) (<= min2 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k))) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1))), 87481#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A j)) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (select A k) (select A (+ (- 1) N))) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (< (+ j 1) M) (<= (select A j) (select A (+ (- 1) N))) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (not (< j M)) (= min1 (select A (+ (- 1) N))) (not (< (select A j) min2))) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (select A j) min2) (< (+ 2 k) N) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k))) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M))) (or (< (+ j 1) M) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2))), 87498#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 87494#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 87501#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 87489#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 87477#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 87480#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N))))), 87502#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 87476#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 87483#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 87478#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 87493#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1))), 87473#(or (< j M) (= min1 min2)), 87500#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 87487#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 87486#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 87484#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N))), 87475#(or (< j M) (= min1 min2) (< i N)), 87504#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)))] [2022-03-15 22:13:31,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:13:31,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:13:31,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:13:31,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3030, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:13:31,268 INFO L87 Difference]: Start difference. First operand 2696 states and 12289 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:14:49,503 INFO L93 Difference]: Finished difference Result 5736 states and 21302 transitions. [2022-03-15 22:14:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2022-03-15 22:14:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:14:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:14:49,515 INFO L225 Difference]: With dead ends: 5736 [2022-03-15 22:14:49,515 INFO L226 Difference]: Without dead ends: 5591 [2022-03-15 22:14:49,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34327 ImplicationChecksByTransitivity, 77.8s TimeCoverageRelationStatistics Valid=12940, Invalid=81616, Unknown=0, NotChecked=0, Total=94556 [2022-03-15 22:14:49,518 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1023 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:14:49,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1023 Valid, 0 Invalid, 5028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 22:14:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2022-03-15 22:14:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 2769. [2022-03-15 22:14:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2769 states, 2768 states have (on average 4.575505780346821) internal successors, (12665), 2768 states have internal predecessors, (12665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 12665 transitions. [2022-03-15 22:14:49,616 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 12665 transitions. Word has length 17 [2022-03-15 22:14:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:14:49,616 INFO L470 AbstractCegarLoop]: Abstraction has 2769 states and 12665 transitions. [2022-03-15 22:14:49,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:14:49,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 12665 transitions. [2022-03-15 22:14:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:14:49,624 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:14:49,624 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:14:49,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:14:49,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:49,843 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:14:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:14:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -965868444, now seen corresponding path program 14 times [2022-03-15 22:14:49,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:14:49,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269491296] [2022-03-15 22:14:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:14:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:14:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:14:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:50,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:14:50,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269491296] [2022-03-15 22:14:50,880 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269491296] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:14:50,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488584830] [2022-03-15 22:14:50,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:14:50,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:14:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:14:50,881 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) [2022-03-15 22:14:50,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:14:50,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:14:50,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:14:50,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:14:50,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:14:55,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:14:55,917 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:14:55,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 169 [2022-03-15 22:14:56,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:14:56,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:14:59,134 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:14:59,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 847 treesize of output 541 [2022-03-15 22:16:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:28,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488584830] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:28,584 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:28,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:16:28,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097624230] [2022-03-15 22:16:28,584 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:28,585 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:28,591 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 22:16:28,591 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:49,730 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [99412#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 99430#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 99428#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 99429#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1))), 99405#(or (= min1 min2) (<= (+ j 1) M) (< i N)), 99409#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 99434#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A j) (select A (+ i 1))) (< k N) (<= min2 (select A j))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A i) (select A j)) (< k N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= (select A j) (select A (+ i 1))) (< k N) (< (select A i) min1) (<= min2 (select A j))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N) (< (select A i) min1))), 99433#(and (or (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= (+ k 1) N) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ 2 k) (+ N M))) (or (< (+ i 1) N) (not (< i N)) (= j 0) (< k N)) (or (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ i 1) N) (not (< (select A i) min1)) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (not (< i N)) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= (+ k 1) N) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (= (select A i) min2)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (<= (+ min2 1) (select A j))) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A j) min1) (<= (+ min2 1) (select A j)))), 99425#(and (or (< (+ i 1) N) (<= min2 (select A (+ j 1))) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (= (select A i) (select A (+ j 1)))) (or (= (select A (+ j 1)) min1) (< (+ i 1) N) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (< (select A i) min1)) (or (<= (select A j) (select A (+ j 1))) (< (+ i 1) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< i N)) (not (< (select A j) min2)) (= (select A i) (select A (+ j 1)))) (or (< (+ i 1) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (not (< i N)) (= j 0)) (or (< (+ i 1) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< i N)) (= (select A i) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2))) (or (< (+ i 1) N) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (<= (+ (select A (+ j 1)) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (= min1 min2) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (< (select A i) min1) (not (< (select A j) min2)))), 99418#(or (= min1 min2) (< k N) (<= (+ j 1) M) (< i N)), 99423#(and (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (< k N) (<= min2 (select A j))) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1))), 99432#(and (or (= (select A (+ j 1)) min1) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (<= N (+ 2 i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= (select A j) (select A (+ j 1))) (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1) (<= min2 (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A i) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= min2 (select A (+ j 1))) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1)))) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1) (<= min2 (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2) (<= min1 (select A (+ i 1)))) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1))) (<= min2 (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A (+ j 1)) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= 2 M)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A (+ j 1)) 1) min2)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))))), 99408#(and (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (select A i) min1)) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= min2 (select A j)))), 99426#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= j 0)) (or (<= (select A j) (select A (+ j 1))) (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< (select A j) min2))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A j) min2) (<= (+ 3 j) M) (= min1 min2) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (<= (+ 3 j) M) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M)) (or (= (select A (+ j 1)) min1) (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (select A i) min1)) (or (<= (select A j) (select A (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (<= (+ 3 j) M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (= (select A i) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i))) (or (<= (select A j) (select A (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (not (< (select A (+ i 1)) min1)) (<= (+ 3 j) M) (< (select A i) min1) (not (< (select A j) min2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= min2 (select A (+ j 1))) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (= min2 (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (<= (+ 3 j) M) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (not (< (select A j) min2))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (< (select A i) min1) (not (< (select A j) min2))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 2 M))), 99419#(and (or (<= (+ 2 j) M) (< k N) (<= min2 (select A j)) (= (select A j) min1)) (or (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N))), 99417#(or (< j M) (= min1 min2) (< k N)), 99413#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 99403#(or (= min1 min2) (< i N)), 99437#(and (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= N (+ 2 i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (select A i) (select A (+ 2 i))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ 2 i)) (select A i)) (<= (+ k 1) N) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (< (+ 3 i) N) (<= (+ 2 k) (+ N M))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A (+ 2 i)) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A (+ i 1)) (select A i)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0) (< k N)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2))), 99416#(or (= min1 min2) (< k N) (< i N)), 99422#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 99421#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 99424#(and (or (<= 2 M) (< i N)) (or (<= (+ (select A j) 1) min2) (= min1 min2) (<= (select A (+ (- 1) M)) min2) (< 2 M) (< i N)) (or (<= (+ min2 1) (select A (+ (- 1) M))) (< 2 M) (<= (select A j) (select A (+ (- 1) M))) (< i N) (= (select A (+ (- 1) M)) min1)) (or (= j 0) (< i N)) (or (< 2 M) (<= (+ (select A (+ (- 1) M)) 1) (select A j)) (< i N) (= (select A j) min1) (<= (+ min2 1) (select A j)))), 99436#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< k N) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A i) (select A j)) (< k N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< k N) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)))), 99415#(or (= min1 min2) (< k N)), 99414#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A i) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 99411#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A i) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A j) (select A (+ i 1))) (<= min2 (select A j))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (<= min2 (select A j))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1))), 99406#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 99420#(and (or (<= (+ 2 j) M) (< k N) (<= min2 (select A j)) (< i N) (= (select A j) min1)) (or (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N) (< i N))), 99427#(and (or (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (+ 2 k) (+ N M)) (< i N) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< i N)) (or (= j 0) (< k N) (< i N)) (or (<= (+ k 1) N) (<= (+ 2 k) (+ N M)) (< i N)) (or (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (< i N) (= (select A j) min1) (<= (+ min2 1) (select A j)))), 99407#(and (or (<= (+ 2 j) M) (<= min2 (select A j)) (< i N) (= (select A j) min1)) (or (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (= min1 min2) (< i N))), 99435#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< (+ 2 k) (+ N M)) (< (select A (+ i 1)) (select A i)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (= (select A i) min2)) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ 2 k) (+ N M))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= j 0) (< k N)) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ i 1)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2))), 99431#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 99404#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 99410#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1)))] [2022-03-15 22:16:49,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:16:49,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:16:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=3568, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:16:49,731 INFO L87 Difference]: Start difference. First operand 2769 states and 12665 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:18:10,755 WARN L244 SmtUtils]: Removed 66 from assertion stack [2022-03-15 22:18:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-03-15 22:18:10,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14378 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=6180, Invalid=35232, Unknown=0, NotChecked=0, Total=41412 [2022-03-15 22:18:10,758 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 752 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 2247 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 2247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:10,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [752 Valid, 0 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 2247 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-03-15 22:18:10,759 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:18:10,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 22:18:10,777 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:18:10,778 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:18:10,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:10,963 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (2769states) and FLOYD_HOARE automaton (currently 161 states, 47 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 219 for 635ms.. [2022-03-15 22:18:10,965 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:18:10,965 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:18:10,965 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:18:10,966 INFO L732 BasicCegarLoop]: Path program histogram: [14, 9, 1, 1, 1] [2022-03-15 22:18:10,968 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:18:10,968 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:18:10,970 INFO L202 PluginConnector]: Adding new model min-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:18:10 BasicIcfg [2022-03-15 22:18:10,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:18:10,970 INFO L158 Benchmark]: Toolchain (without parser) took 746263.19ms. Allocated memory was 188.7MB in the beginning and 792.7MB in the end (delta: 604.0MB). Free memory was 147.3MB in the beginning and 269.0MB in the end (delta: -121.7MB). Peak memory consumption was 481.8MB. Max. memory is 8.0GB. [2022-03-15 22:18:10,971 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:18:10,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.06ms. Allocated memory is still 188.7MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:18:10,971 INFO L158 Benchmark]: Boogie Preprocessor took 25.89ms. Allocated memory is still 188.7MB. Free memory was 145.7MB in the beginning and 144.8MB in the end (delta: 961.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:18:10,971 INFO L158 Benchmark]: RCFGBuilder took 229.77ms. Allocated memory is still 188.7MB. Free memory was 144.7MB in the beginning and 135.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:18:10,971 INFO L158 Benchmark]: TraceAbstraction took 745978.28ms. Allocated memory was 188.7MB in the beginning and 792.7MB in the end (delta: 604.0MB). Free memory was 134.8MB in the beginning and 269.0MB in the end (delta: -134.2MB). Peak memory consumption was 469.2MB. Max. memory is 8.0GB. [2022-03-15 22:18:10,972 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 148.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.06ms. Allocated memory is still 188.7MB. Free memory was 147.2MB in the beginning and 145.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.89ms. Allocated memory is still 188.7MB. Free memory was 145.7MB in the beginning and 144.8MB in the end (delta: 961.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 229.77ms. Allocated memory is still 188.7MB. Free memory was 144.7MB in the beginning and 135.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 745978.28ms. Allocated memory was 188.7MB in the beginning and 792.7MB in the end (delta: 604.0MB). Free memory was 134.8MB in the beginning and 269.0MB in the end (delta: -134.2MB). Peak memory consumption was 469.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - 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: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2769states) and FLOYD_HOARE automaton (currently 161 states, 47 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 219 for 635ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2769states) and FLOYD_HOARE automaton (currently 161 states, 47 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 219 for 635ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2769states) and FLOYD_HOARE automaton (currently 161 states, 47 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 219 for 635ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2769states) and FLOYD_HOARE automaton (currently 161 states, 47 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 219 for 635ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 745.9s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.1s, AutomataDifference: 375.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8907 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8907 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 17.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7005 mSDsCounter, 3702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28741 IncrementalHoareTripleChecker+Invalid, 32443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3702 mSolverCounterUnsat, 0 mSDtfsCounter, 28741 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3780 GetRequests, 1070 SyntacticMatches, 121 SemanticMatches, 2588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148739 ImplicationChecksByTransitivity, 378.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2769occurred in iteration=25, InterpolantAutomatonStates: 1947, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 20776 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 264.1s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1043 ConstructedInterpolants, 10 QuantifiedInterpolants, 30426 SizeOfPredicates, 82 NumberOfNonLiveVariables, 1501 ConjunctsInSsa, 366 ConjunctsInUnsatCore, 72 InterpolantComputations, 3 PerfectInterpolantSequences, 147/506 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown