/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/max-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:04:22,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:04:22,821 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:04:22,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:04:22,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:04:22,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:04:22,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:04:22,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:04:22,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:04:22,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:04:22,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:04:22,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:04:22,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:04:22,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:04:22,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:04:22,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:04:22,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:04:22,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:04:22,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:04:22,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:04:22,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:04:22,902 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:04:22,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:04:22,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:04:22,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:04:22,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:04:22,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:04:22,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:04:22,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:04:22,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:04:22,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:04:22,908 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:04:22,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:04:22,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:04:22,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:04:22,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:04:22,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:04:22,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:04:22,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:04:22,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:04:22,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:04:22,913 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:04:22,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:04:22,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:04:22,937 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:04:22,938 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:04:22,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:04:22,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:04:22,938 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:04:22,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:04:22,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:04:22,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:04:22,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:04:22,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:04:22,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:04:22,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:04:22,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:04:22,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:04:22,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:04:22,941 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:04:22,941 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:04:22,941 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:04:22,942 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:04:22,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:04:22,942 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:04:22,942 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:04:22,942 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:04:22,942 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:04:23,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:04:23,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:04:23,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:04:23,159 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:04:23,161 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:04:23,161 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/max-fun.wvr.bpl [2022-03-15 22:04:23,162 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun.wvr.bpl' [2022-03-15 22:04:23,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:04:23,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:04:23,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:04:23,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:04:23,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:04:23,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,200 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:04:23,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:04:23,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:04:23,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:04:23,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:04:23,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:04:23,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:04:23,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:04:23,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:04:23,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/1) ... [2022-03-15 22:04:23,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:04:23,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:23,247 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:04:23,273 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:04:23,286 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:04:23,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:04:23,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:04:23,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:04:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:04:23,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:04:23,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:04:23,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:04:23,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:04:23,287 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:04:23,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:04:23,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:04:23,288 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:04:23,327 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:04:23,328 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:04:23,416 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:04:23,425 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:04:23,426 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:04:23,427 INFO L202 PluginConnector]: Adding new model max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:04:23 BoogieIcfgContainer [2022-03-15 22:04:23,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:04:23,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:04:23,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:04:23,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:04:23,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:04:23" (1/2) ... [2022-03-15 22:04:23,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dd37a49 and model type max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:04:23, skipping insertion in model container [2022-03-15 22:04:23,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:04:23" (2/2) ... [2022-03-15 22:04:23,435 INFO L111 eAbstractionObserver]: Analyzing ICFG max-fun.wvr.bpl [2022-03-15 22:04:23,438 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:04:23,438 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:04:23,438 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:04:23,438 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:04:23,470 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:04:23,503 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:04:23,508 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:04:23,508 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:04:23,515 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:04:23,523 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:04:23,526 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:04:23,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:04:23,560 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:04:23,560 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:04:23,569 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 4. Compared 23 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:04:23,571 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:04:23,825 INFO L131 LiptonReduction]: Checked pairs total: 116 [2022-03-15 22:04:23,825 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:04:23,831 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:04:23,845 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:04:23,846 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:04:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:04:23,850 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:23,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:23,851 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:04:23,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:23,855 INFO L85 PathProgramCache]: Analyzing trace with hash -580571257, now seen corresponding path program 1 times [2022-03-15 22:04:23,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:23,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096287082] [2022-03-15 22:04:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:23,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:24,093 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:04:24,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:24,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096287082] [2022-03-15 22:04:24,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096287082] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:04:24,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:04:24,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:04:24,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379120287] [2022-03-15 22:04:24,097 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:24,101 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:24,113 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:04:24,113 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:24,403 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:04:24,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:04:24,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:04:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:04:24,423 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:04:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:24,478 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:04:24,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:04:24,480 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:04:24,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:24,492 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:04:24,492 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:04:24,493 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:04:24,495 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:04:24,496 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:04:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:04:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:04:24,522 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:04:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:04:24,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:04:24,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:24,524 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:04:24,524 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:04:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:04:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:04:24,524 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:24,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:24,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:04:24,525 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:04:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:24,525 INFO L85 PathProgramCache]: Analyzing trace with hash -817689900, now seen corresponding path program 1 times [2022-03-15 22:04:24,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:24,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399871903] [2022-03-15 22:04:24,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:24,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:24,550 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:04:24,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:24,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399871903] [2022-03-15 22:04:24,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399871903] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:04:24,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:04:24,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:04:24,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103199178] [2022-03-15 22:04:24,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:24,552 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:24,556 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:04:24,557 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:24,673 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [220#(< i N)] [2022-03-15 22:04:24,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:04:24,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:24,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:04:24,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:04:24,679 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:04:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:24,706 INFO L93 Difference]: Finished difference Result 37 states and 98 transitions. [2022-03-15 22:04:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:04:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have 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:04:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:24,707 INFO L225 Difference]: With dead ends: 37 [2022-03-15 22:04:24,707 INFO L226 Difference]: Without dead ends: 37 [2022-03-15 22:04:24,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 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:04:24,709 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:24,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:04:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-15 22:04:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-03-15 22:04:24,717 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:04:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:04:24,720 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:04:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:24,721 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:04:24,721 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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:04:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:04:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:04:24,722 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:24,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:24,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:04:24,722 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:04:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1068507127, now seen corresponding path program 1 times [2022-03-15 22:04:24,725 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:24,725 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874008190] [2022-03-15 22:04:24,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:24,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:24,766 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:04:24,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:24,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874008190] [2022-03-15 22:04:24,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874008190] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:04:24,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:04:24,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:04:24,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1363698451] [2022-03-15 22:04:24,767 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:24,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:24,769 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:04:24,770 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:24,915 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:04:24,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:04:24,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:04:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:04:24,918 INFO L87 Difference]: Start difference. First operand 31 states and 80 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:04:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:24,944 INFO L93 Difference]: Finished difference Result 40 states and 106 transitions. [2022-03-15 22:04:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:04:24,945 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:04:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:24,949 INFO L225 Difference]: With dead ends: 40 [2022-03-15 22:04:24,950 INFO L226 Difference]: Without dead ends: 40 [2022-03-15 22:04:24,950 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:04:24,953 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:04:24,954 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:04:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-15 22:04:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-03-15 22:04:24,960 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:04:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:04:24,960 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:04:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:24,961 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:04:24,961 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:04:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:04:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:04:24,962 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:24,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:24,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:04:24,962 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:04:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:24,962 INFO L85 PathProgramCache]: Analyzing trace with hash 282949368, now seen corresponding path program 1 times [2022-03-15 22:04:24,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:24,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142129776] [2022-03-15 22:04:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:25,132 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:04:25,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:25,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142129776] [2022-03-15 22:04:25,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142129776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:25,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714912658] [2022-03-15 22:04:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:25,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:25,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:25,135 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:04:25,141 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:04:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:25,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 18 conjunts are in the unsatisfiable core [2022-03-15 22:04:25,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:25,395 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:04:25,476 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:04:25,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:25,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:04:25,616 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 73 treesize of output 67 [2022-03-15 22:04:25,887 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:04:25,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714912658] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:25,888 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:25,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-03-15 22:04:25,888 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002383233] [2022-03-15 22:04:25,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:25,890 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:25,893 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:04:25,893 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:27,766 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [529#(and (or (< max3 (select A k)) (<= 1 max3) (= max2 max1)) (or (< max3 (select A k)) (= max3 max1)) (or (= max2 0) (= max2 max1)) (or (= max1 (select A k)) (not (< max3 (select A k)))) (or (<= 1 (select A k)) (<= (select A k) max3) (= max2 max1))), 528#(and (or (< j M) (<= 1 max3) (= max2 max1)) (or (= max2 0) (< j M) (= max2 max1)) (or (< j M) (= max3 max1))), 530#(and (or (<= 1 (select A k)) (< j M) (<= (select A k) max3) (= max2 max1)) (or (< j M) (< max3 (select A k)) (= max3 max1)) (or (= max2 0) (< j M) (= max2 max1)) (or (= max1 (select A k)) (< j M) (not (< max3 (select A k)))) (or (< j M) (< max3 (select A k)) (<= 1 max3) (= max2 max1))), 532#(and (or (< j M) (= k i)) (or (< j M) (= max2 max1)) (or (<= 0 max3) (< j M)) (or (< j M) (= k 0)) (or (< j M) (= max3 max1)) (or (< j M) (<= max3 0))), 531#(and (or (< j M) (= max2 max1)) (or (< j M) (= max3 max1) (<= 1 (select A i))) (or (< j M) (= max1 0)) (or (< j M) (<= (select A i) 0) (= (select A i) max3)))] [2022-03-15 22:04:27,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:04:27,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:27,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:04:27,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-03-15 22:04:27,769 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:04:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:28,065 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:04:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:04:28,065 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:04:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:28,066 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:04:28,066 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:04:28,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:04:28,067 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:28,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:04:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:04:28,073 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:04:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:04:28,073 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:04:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:28,074 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:04:28,074 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:04:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:04:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:04:28,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:28,075 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:28,099 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:04:28,283 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:04:28,284 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:04:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:28,284 INFO L85 PathProgramCache]: Analyzing trace with hash 134365460, now seen corresponding path program 2 times [2022-03-15 22:04:28,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:28,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946639008] [2022-03-15 22:04:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:28,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:28,331 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:04:28,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:28,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946639008] [2022-03-15 22:04:28,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946639008] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:28,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094429463] [2022-03-15 22:04:28,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:04:28,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:28,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:28,348 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:04:28,355 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:04:28,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:04:28,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:28,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:04:28,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:28,421 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:04:28,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:28,468 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:04:28,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094429463] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:28,468 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:28,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:04:28,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [271596100] [2022-03-15 22:04:28,469 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:28,470 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:28,474 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:04:28,474 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:28,999 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [847#(or (< j M) (<= k (+ i 1))), 843#(or (<= N i) (< k N)), 839#(or (<= N k) (< (+ k 1) N)), 841#(or (<= N i) (< j M)), 829#(or (<= k i) (< j M)), 842#(or (<= N (+ i 1)) (< j M)), 840#(or (< j M) (<= N k) (< (+ k 1) N)), 837#(< k N), 844#(or (<= N i) (<= N k) (< (+ k 1) N)), 838#(or (< j M) (< k N)), 846#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 836#(< j M), 845#(or (<= N i) (< j M) (< k N))] [2022-03-15 22:04:28,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:04:29,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:04:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:04:29,000 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:29,964 INFO L93 Difference]: Finished difference Result 175 states and 510 transitions. [2022-03-15 22:04:29,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:04:29,965 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:04:29,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:29,966 INFO L225 Difference]: With dead ends: 175 [2022-03-15 22:04:29,966 INFO L226 Difference]: Without dead ends: 172 [2022-03-15 22:04:29,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=800, Invalid=2622, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:04:29,969 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:29,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:04:29,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-03-15 22:04:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 91. [2022-03-15 22:04:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 3.2555555555555555) internal successors, (293), 90 states have internal predecessors, (293), 0 states have call successors, (0), 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:04:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 293 transitions. [2022-03-15 22:04:29,978 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 293 transitions. Word has length 14 [2022-03-15 22:04:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:29,978 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 293 transitions. [2022-03-15 22:04:29,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 293 transitions. [2022-03-15 22:04:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:04:29,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:29,979 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:30,026 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:04:30,187 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:04:30,188 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:04:30,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:30,188 INFO L85 PathProgramCache]: Analyzing trace with hash -771572247, now seen corresponding path program 3 times [2022-03-15 22:04:30,189 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:30,189 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47944616] [2022-03-15 22:04:30,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:30,231 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:04:30,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:30,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47944616] [2022-03-15 22:04:30,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47944616] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:30,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631821466] [2022-03-15 22:04:30,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:04:30,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:30,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:30,242 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:04:30,243 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:04:30,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:04:30,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:30,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:04:30,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:30,343 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:04:30,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:30,378 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:04:30,378 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631821466] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:30,378 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:30,378 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:04:30,379 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1398853368] [2022-03-15 22:04:30,379 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:30,380 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:30,383 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:04:30,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:30,844 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [1372#(or (<= N k) (< (+ k 1) N)), 1375#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 1373#(or (<= N (+ k 1)) (< (+ 2 k) N)), 1374#(or (<= N k) (< (+ k 1) N) (< i N)), 1370#(< k N), 1371#(or (< k N) (< i N))] [2022-03-15 22:04:30,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 22:04:30,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:30,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 22:04:30,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:04:30,845 INFO L87 Difference]: Start difference. First operand 91 states and 293 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:31,292 INFO L93 Difference]: Finished difference Result 240 states and 732 transitions. [2022-03-15 22:04:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:04:31,292 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:04:31,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:31,294 INFO L225 Difference]: With dead ends: 240 [2022-03-15 22:04:31,294 INFO L226 Difference]: Without dead ends: 240 [2022-03-15 22:04:31,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:04:31,295 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:31,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:04:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-03-15 22:04:31,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 170. [2022-03-15 22:04:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 3.4319526627218937) internal successors, (580), 169 states have internal predecessors, (580), 0 states have call successors, (0), 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:04:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 580 transitions. [2022-03-15 22:04:31,307 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 580 transitions. Word has length 14 [2022-03-15 22:04:31,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:31,308 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 580 transitions. [2022-03-15 22:04:31,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 580 transitions. [2022-03-15 22:04:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:04:31,309 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:31,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:31,341 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:04:31,523 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:04:31,524 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:04:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1294994650, now seen corresponding path program 1 times [2022-03-15 22:04:31,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:31,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266509966] [2022-03-15 22:04:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:31,549 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:04:31,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:31,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266509966] [2022-03-15 22:04:31,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266509966] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:31,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244405314] [2022-03-15 22:04:31,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:31,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:31,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:31,551 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:04:31,552 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:04:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:04:31,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:31,611 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:04:31,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:31,645 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:04:31,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244405314] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:31,646 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:31,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:04:31,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1807679843] [2022-03-15 22:04:31,646 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:31,648 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:31,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:04:31,652 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:32,056 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2081#(or (< j M) (<= (+ 2 i) N)), 2078#(or (< j M) (< i N)), 2077#(< j M), 2082#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 2079#(or (< (+ j 1) M) (<= M j)), 2080#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:04:32,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:04:32,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:32,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:04:32,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:04:32,057 INFO L87 Difference]: Start difference. First operand 170 states and 580 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:32,184 INFO L93 Difference]: Finished difference Result 256 states and 873 transitions. [2022-03-15 22:04:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-15 22:04:32,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:04:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:32,186 INFO L225 Difference]: With dead ends: 256 [2022-03-15 22:04:32,186 INFO L226 Difference]: Without dead ends: 256 [2022-03-15 22:04:32,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:04:32,187 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:32,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:04:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-03-15 22:04:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 210. [2022-03-15 22:04:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 3.444976076555024) internal successors, (720), 209 states have internal predecessors, (720), 0 states have call successors, (0), 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:04:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 720 transitions. [2022-03-15 22:04:32,194 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 720 transitions. Word has length 14 [2022-03-15 22:04:32,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:32,194 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 720 transitions. [2022-03-15 22:04:32,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 720 transitions. [2022-03-15 22:04:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:04:32,196 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:32,196 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:32,219 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:04:32,396 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:04:32,397 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:04:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1803933763, now seen corresponding path program 4 times [2022-03-15 22:04:32,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:32,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273591821] [2022-03-15 22:04:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:32,800 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:04:32,800 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:32,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273591821] [2022-03-15 22:04:32,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273591821] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:32,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893294389] [2022-03-15 22:04:32,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:04:32,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:32,802 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:04:32,803 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:04:32,826 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:04:32,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:32,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 27 conjunts are in the unsatisfiable core [2022-03-15 22:04:32,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:33,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:33,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:33,153 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2022-03-15 22:04:33,273 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:04:33,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:33,828 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:04:33,829 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 367 treesize of output 253 [2022-03-15 22:04:35,463 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:04:35,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893294389] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:35,464 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:35,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:04:35,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [539349231] [2022-03-15 22:04:35,464 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:35,465 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:35,488 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:04:35,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:49,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2876#(and (or (< j M) (< k N) (<= (+ i 1) N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1))), 2884#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 2875#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1))), 2888#(and (or (not (< k N)) (<= (select A i) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)))), 2887#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 2870#(and (or (< j M) (= max3 max1) (<= max3 max2)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1))), 2872#(and (or (< j M) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ 2 i) N) (= max3 max1) (= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i)))), 2892#(and (or (< j M) (= max2 max1)) (or (< j M) (= max3 max1) (<= 1 (select A i))) (or (< j M) (= max1 0)) (or (< j M) (<= (select A i) 0) (= (select A i) max3)) (or (<= (+ i 1) k) (< j M)) (or (< j M) (= i max2))), 2880#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2))), 2871#(and (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 2891#(and (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A i) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1)))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1))) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1))), 2889#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1)))) (or (<= N (+ k 1)) (<= (select A i) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (<= (select A i) (select A (+ k 1))) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)))), 2873#(and (or (< k N) (= max3 max1) (<= max3 max2)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1))), 2890#(and (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (= (select A i) max3)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (< j M) (<= (select A i) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1))), 2874#(and (or (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< k N) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 2882#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N))), 2885#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 2893#(and (or (< j M) (= max2 max1)) (or (< j M) (= k 0)) (or (< j M) (= max3 max1)) (or (< j M) (= max3 0)) (or (< j M) (= i max2))), 2877#(and (or (< k N) (<= (+ 2 i) N) (= max3 max1) (= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< k N) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1))), 2881#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2))), 2879#(and (or (< (+ 2 i) N) (< j M) (= i max1)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A i) 0) (<= (select A (+ (- 1) N)) (select A i))) (or (< j M) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) 0) (= (select A i) max3)) (or (< (+ 2 i) N) (< j M) (= max1 0)) (or (< (+ 2 i) N) (< j M) (= (+ i (* (- 1) max2)) 0)) (or (<= (select A (+ (- 1) N)) max3) (< (+ 2 i) N) (< j M)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= 1 (select A i))) (or (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ i 1) (select A (+ (- 1) N))) (<= 1 (select A i)))), 2878#(and (or (< j M) (< k N) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< j M) (< k N) (<= (+ 2 i) N) (= max3 max1) (= (select A i) max3)) (or (< j M) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1))), 2883#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1))), 2886#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (select A k) max2)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)))] [2022-03-15 22:04:49,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:04:49,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:49,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:04:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:04:49,094 INFO L87 Difference]: Start difference. First operand 210 states and 720 transitions. Second operand has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:08,529 INFO L93 Difference]: Finished difference Result 440 states and 1390 transitions. [2022-03-15 22:05:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-03-15 22:05:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:05:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:08,531 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:05:08,531 INFO L226 Difference]: Without dead ends: 429 [2022-03-15 22:05:08,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3621 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2066, Invalid=10144, Unknown=0, NotChecked=0, Total=12210 [2022-03-15 22:05:08,534 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 424 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:08,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [424 Valid, 0 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 22:05:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-03-15 22:05:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 256. [2022-03-15 22:05:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.5686274509803924) internal successors, (910), 255 states have internal predecessors, (910), 0 states have call successors, (0), 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:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 910 transitions. [2022-03-15 22:05:08,543 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 910 transitions. Word has length 15 [2022-03-15 22:05:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:08,543 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 910 transitions. [2022-03-15 22:05:08,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.90625) internal successors, (93), 32 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 910 transitions. [2022-03-15 22:05:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:05:08,544 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:08,544 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:08,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-15 22:05:08,759 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:05:08,759 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:05:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1005306136, now seen corresponding path program 5 times [2022-03-15 22:05:08,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:08,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965619686] [2022-03-15 22:05:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:08,821 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:05:08,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:08,821 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965619686] [2022-03-15 22:05:08,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965619686] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:08,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29570675] [2022-03-15 22:05:08,822 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:05:08,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:08,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:08,823 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:05:08,828 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:05:08,851 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:05:08,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:08,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:05:08,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:08,928 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:05:08,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:08,967 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:05:08,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29570675] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:08,968 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:08,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-03-15 22:05:08,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [148872872] [2022-03-15 22:05:08,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:08,969 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:08,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:05:08,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:09,322 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [4086#(or (<= N i) (< (+ i 1) N) (<= N k)), 4084#(or (<= N i) (< (+ i 1) N)), 4081#(< i N), 4082#(or (<= (+ N 1) k) (< i N)), 4085#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k)), 4083#(or (<= N k) (< i N))] [2022-03-15 22:05:09,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 22:05:09,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 22:05:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:05:09,323 INFO L87 Difference]: Start difference. First operand 256 states and 910 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:09,665 INFO L93 Difference]: Finished difference Result 385 states and 1236 transitions. [2022-03-15 22:05:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:05:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:05:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:09,667 INFO L225 Difference]: With dead ends: 385 [2022-03-15 22:05:09,667 INFO L226 Difference]: Without dead ends: 364 [2022-03-15 22:05:09,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=372, Invalid=1110, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:05:09,668 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:09,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:05:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-03-15 22:05:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 251. [2022-03-15 22:05:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 3.504) internal successors, (876), 250 states have internal predecessors, (876), 0 states have call successors, (0), 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:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 876 transitions. [2022-03-15 22:05:09,675 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 876 transitions. Word has length 15 [2022-03-15 22:05:09,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:09,676 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 876 transitions. [2022-03-15 22:05:09,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:09,676 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 876 transitions. [2022-03-15 22:05:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:05:09,678 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:09,678 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:09,697 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:05:09,883 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:05:09,883 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:05:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:09,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1442998130, now seen corresponding path program 2 times [2022-03-15 22:05:09,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:09,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354911278] [2022-03-15 22:05:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:09,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:10,228 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:05:10,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:10,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354911278] [2022-03-15 22:05:10,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354911278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:10,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320715538] [2022-03-15 22:05:10,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:05:10,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:10,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:10,229 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:05:10,230 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:05:10,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:05:10,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:05:10,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:05:10,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:10,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:05:10,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:10,594 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 89 treesize of output 65 [2022-03-15 22:05:10,835 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:05:10,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:11,618 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:05:11,618 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 347 treesize of output 269 [2022-03-15 22:05:21,318 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:05:21,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320715538] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:05:21,319 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:05:21,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-03-15 22:05:21,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332163993] [2022-03-15 22:05:21,319 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:05:21,320 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:05:21,324 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:05:21,324 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:35,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [5128#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ (select A j) 1) max3) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (= max3 max1) (<= max3 max2)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= max3 max1) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) max3) (= max2 max1))), 5126#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (= max1 0) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (= max2 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= max3 max2) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (select A i) (select A k)) (not (< max3 (select A k))) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N))), 5136#(and (or (not (< k N)) (<= (+ (select A k) 1) max1) (< (+ j 1) M) (= max1 0) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (= max1 0) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (<= (+ (select A i) 1) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< (+ j 1) M) (not (< max2 (select A j))) (= (select A j) (select A k)) (not (< max3 (select A k))) (not (< j M)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max3) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (< (+ j 1) M) (= max3 max2) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< (+ j 1) M) (= max2 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N) (= (select A j) max1)) (or (not (< k N)) (< (+ j 1) M) (<= (select A i) (select A k)) (not (< max3 (select A k))) (<= (+ (select A i) 1) max1) (not (< j M)) (< (+ k 1) N) (<= (+ 2 i) N))), 5137#(and (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= i max3)) (or (< (+ 2 i) N) (< j M) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (= max3 max2) (< (+ 2 i) N) (< j M) (<= (+ max1 1) (select A i)) (<= 1 max3)) (or (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= (select A i) max2)) (or (< j M) (<= (+ 2 i) N)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ i 1) (select A i))) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (= max1 0) (<= (+ max1 1) (select A i))) (or (<= (select A (+ (- 1) N)) max3) (<= (+ (select A (+ (- 1) N)) 1) (select A i)) (< (+ 2 i) N) (< j M))), 5115#(and (or (< j M) (<= (+ (select A i) 1) max1) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (= max2 max1)) (or (= max3 max2) (< j M) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< j M) (= max1 0) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3))), 5131#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< i N)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= max3 max1) (< i N) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (= max3 max1) (<= max3 max2) (< i N))), 5133#(and (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)) (< i N)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N) (<= max3 (select A j))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (< i N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< i N) (= max2 max1))), 5138#(and (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (< (+ j 1) M) (= max3 max2) (< (+ 2 i) N) (not (< j M)) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (<= 1 max3)) (or (< (+ j 1) M) (not (< j M)) (<= (+ 2 i) N)) (or (<= (+ 3 i) N) (< (+ j 1) M) (= max3 max2) (= max3 (select A (+ i 1))) (< max2 (select A j)) (< max1 (select A i)) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (+ 3 i) N) (< (+ j 1) M) (<= (+ (select A (+ i 1)) 1) (select A i)) (<= (select A (+ i 1)) max3) (<= M j)) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (< max1 (select A i))) (or (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 i) N) (not (< j M)) (= (select A j) max3) (<= (+ max1 1) (select A i)) (<= 1 max3)) (or (< (+ j 1) M) (< (+ 2 i) N) (= max1 0) (not (< j M)) (<= (+ max1 1) (select A i))) (or (<= (+ 3 i) N) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 3 i) N) (< (+ j 1) M) (= max3 (select A (+ i 1))) (= (select A j) max3) (< max1 (select A i)) (<= M j)) (or (= max3 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 i) N) (<= (select A i) max1) (not (< j M)) (= i max3)) (or (= max3 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 i) N) (not (< j M)) (= max3 max1) (<= (+ i 1) (select A i)))), 5118#(and (or (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< k N) (= max3 max1) (<= max3 max2) (< i N))), 5114#(and (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (<= (+ i 1) N) (= max3 max1) (<= max3 max2))), 5124#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N))), 5123#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 5117#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1))), 5120#(and (or (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (= max3 max2) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (= max1 0) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (<= (+ (select A i) 1) max1) (< k N) (<= (+ 2 i) N) (<= (select A i) max3))), 5121#(and (or (< j M) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (= max3 max2) (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< j M) (= max1 0) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< j M) (<= (+ (select A i) 1) max1) (< k N) (<= (+ 2 i) N) (<= (select A i) max3))), 5129#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (= max3 max1) (<= max3 max2)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= max3 max1) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ (select A j) 1) max3) (= (select A j) max1))), 5116#(and (or (< k N) (= max3 max1) (<= max3 max2)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1))), 5132#(and (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (not (< k N)) (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 (select A j))) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< max3 (select A k))) (not (< j M)) (< (+ k 1) N) (<= (select A k) (select A j))) (or (not (< k N)) (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ j 1) M) (= max1 (select A k)) (not (< max3 (select A k))) (not (< j M)) (< max2 (select A j)) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< (+ k 1) N) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< max3 (select A k)))), 5135#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (<= (+ 2 i) N) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ (select A i) 1) max1) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< (+ j 1) M) (= max1 0) (not (< j M)) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (= max3 max2) (not (< j M)) (< max2 (select A j)) (< k N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (< k N) (= (select A j) max3) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3))), 5134#(and (or (< (+ j 1) M) (= max1 0) (not (< j M)) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max3) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (= max2 max1)) (or (< (+ j 1) M) (<= (+ (select A i) 1) max1) (not (< j M)) (<= (+ 2 i) N) (<= (select A i) max3)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ 2 i) N) (= (select A j) max1)) (or (< (+ j 1) M) (= max3 max2) (not (< j M)) (< max2 (select A j)) (<= (+ 2 i) N) (<= (+ max3 1) max1) (= (select A i) max3))), 5127#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (select A i) (select A k)) (not (< max3 (select A k))) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (= max3 max2) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< j M) (= max1 0) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ (select A k) 1) max1) (< j M) (= max2 (select A k)) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (+ (select A i) 1) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (<= (select A i) max3)) (or (not (< k N)) (< j M) (= max1 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max3 1) max1) (< max3 (select A k)) (= (select A i) max3))), 5119#(and (or (< j M) (< k N) (= max3 max1) (<= max3 max2) (< i N)) (or (< j M) (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1))), 5122#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2)) (or (not (< k N)) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2))), 5125#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (select A k) max2) (< i N)) (or (not (< k N)) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= max3 max2) (< i N))), 5113#(and (or (< j M) (= max3 max1) (<= max3 max2)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1))), 5130#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= max3 max1) (< i N) (<= max3 (select A j))) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (= max3 max1) (<= max3 max2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (<= (+ (select A j) 1) max3) (= (select A j) max1) (< i N)))] [2022-03-15 22:05:35,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:05:35,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:05:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:05:35,901 INFO L87 Difference]: Start difference. First operand 251 states and 876 transitions. Second operand has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:11,051 INFO L93 Difference]: Finished difference Result 1094 states and 3040 transitions. [2022-03-15 22:06:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:06:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:06:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:11,056 INFO L225 Difference]: With dead ends: 1094 [2022-03-15 22:06:11,056 INFO L226 Difference]: Without dead ends: 1049 [2022-03-15 22:06:11,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8678 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=4495, Invalid=22565, Unknown=0, NotChecked=0, Total=27060 [2022-03-15 22:06:11,061 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 530 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:11,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [530 Valid, 0 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-03-15 22:06:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2022-03-15 22:06:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 298. [2022-03-15 22:06:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 3.6026936026936025) internal successors, (1070), 297 states have internal predecessors, (1070), 0 states have call successors, (0), 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:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1070 transitions. [2022-03-15 22:06:11,074 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 1070 transitions. Word has length 15 [2022-03-15 22:06:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:11,074 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 1070 transitions. [2022-03-15 22:06:11,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 33 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 1070 transitions. [2022-03-15 22:06:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:06:11,075 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:11,075 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:11,092 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:11,279 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:11,280 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:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1848560448, now seen corresponding path program 3 times [2022-03-15 22:06:11,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:11,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771888716] [2022-03-15 22:06:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:11,302 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:11,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:11,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771888716] [2022-03-15 22:06:11,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771888716] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:11,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510819060] [2022-03-15 22:06:11,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:06:11,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:11,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:11,311 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:11,312 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:11,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:06:11,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:11,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:06:11,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:11,386 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:11,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:11,430 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:11,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510819060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:11,430 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:11,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:06:11,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1977325280] [2022-03-15 22:06:11,430 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:11,431 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:11,435 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 147 transitions. [2022-03-15 22:06:11,435 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:11,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7162#(< i N), 7163#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:06:11,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 22:06:11,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:11,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 22:06:11,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:06:11,806 INFO L87 Difference]: Start difference. First operand 298 states and 1070 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:11,954 INFO L93 Difference]: Finished difference Result 436 states and 1461 transitions. [2022-03-15 22:06:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-15 22:06:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:06:11,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:11,956 INFO L225 Difference]: With dead ends: 436 [2022-03-15 22:06:11,956 INFO L226 Difference]: Without dead ends: 428 [2022-03-15 22:06:11,956 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:06:11,957 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:11,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:06:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-03-15 22:06:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 277. [2022-03-15 22:06:11,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.601449275362319) internal successors, (994), 276 states have internal predecessors, (994), 0 states have call successors, (0), 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:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 994 transitions. [2022-03-15 22:06:11,964 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 994 transitions. Word has length 15 [2022-03-15 22:06:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:11,964 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 994 transitions. [2022-03-15 22:06:11,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 994 transitions. [2022-03-15 22:06:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:11,965 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:11,965 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:11,983 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:12,179 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:12,179 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:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 40241449, now seen corresponding path program 6 times [2022-03-15 22:06:12,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:12,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798672661] [2022-03-15 22:06:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:12,228 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:12,229 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:12,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798672661] [2022-03-15 22:06:12,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798672661] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:12,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167361698] [2022-03-15 22:06:12,229 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:12,230 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:12,231 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:12,252 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:06:12,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:12,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:12,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:12,295 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:12,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:12,334 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:12,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167361698] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:12,334 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:12,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:06:12,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621445900] [2022-03-15 22:06:12,334 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:12,335 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:12,340 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:06:12,340 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:13,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [8282#(or (< j M) (<= N k) (< (+ k 1) N)), 8287#(or (<= N (+ i 1)) (< j M) (< k N)), 8289#(or (<= N (+ 2 i)) (< j M)), 8285#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 8275#(or (<= N k) (< (+ k 1) N)), 8290#(or (< j M) (<= k (+ 2 i))), 8273#(< j M), 8286#(or (<= N (+ i 1)) (< j M)), 8277#(or (<= N i) (< k N)), 8291#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 8283#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 8293#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 8274#(< k N), 8288#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 8294#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 8296#(or (< j M) (<= k (+ i 1))), 8292#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 8278#(or (<= N i) (< j M)), 8284#(or (<= N (+ i 1)) (< k N)), 8295#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 8266#(or (<= k i) (< j M)), 8279#(or (< j M) (< k N)), 8281#(or (<= N i) (<= N k) (< (+ k 1) N)), 8276#(or (<= N (+ k 1)) (< (+ 2 k) N)), 8280#(or (<= N i) (< j M) (< k N))] [2022-03-15 22:06:13,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-15 22:06:13,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-15 22:06:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:06:13,189 INFO L87 Difference]: Start difference. First operand 277 states and 994 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 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:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:15,115 INFO L93 Difference]: Finished difference Result 649 states and 2165 transitions. [2022-03-15 22:06:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:06:15,115 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have 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:15,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:15,118 INFO L225 Difference]: With dead ends: 649 [2022-03-15 22:06:15,118 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 22:06:15,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2726, Invalid=9264, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:06:15,120 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:15,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:06:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 22:06:15,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 354. [2022-03-15 22:06:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 3.7535410764872523) internal successors, (1325), 353 states have internal predecessors, (1325), 0 states have call successors, (0), 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:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1325 transitions. [2022-03-15 22:06:15,130 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1325 transitions. Word has length 16 [2022-03-15 22:06:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:15,130 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 1325 transitions. [2022-03-15 22:06:15,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 33 states have internal predecessors, (102), 0 states have call successors, (0), 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:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1325 transitions. [2022-03-15 22:06:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:15,131 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:15,131 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:15,148 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:15,343 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:15,343 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:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2020943604, now seen corresponding path program 7 times [2022-03-15 22:06:15,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:15,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880970113] [2022-03-15 22:06:15,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:15,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:15,390 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:15,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:15,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880970113] [2022-03-15 22:06:15,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880970113] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:15,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597565456] [2022-03-15 22:06:15,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:06:15,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:15,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:15,391 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:15,406 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:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:15,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:15,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:15,491 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:15,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:15,516 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:15,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597565456] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:15,517 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:15,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:06:15,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188313303] [2022-03-15 22:06:15,517 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:15,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:15,522 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:06:15,522 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:16,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [9917#(or (< k N) (<= (+ 2 i) N)), 9909#(< k N), 9920#(or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)), 9912#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 9915#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 9918#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 9916#(or (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)), 9914#(or (<= N k) (< (+ k 1) N) (< i N)), 9913#(or (< k N) (< i N)), 9910#(or (<= N k) (< (+ k 1) N)), 9911#(or (<= N (+ k 1)) (< (+ 2 k) N)), 9919#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N))] [2022-03-15 22:06:16,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:06:16,204 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:06:16,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-03-15 22:06:16,205 INFO L87 Difference]: Start difference. First operand 354 states and 1325 transitions. Second operand has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:16,954 INFO L93 Difference]: Finished difference Result 745 states and 2539 transitions. [2022-03-15 22:06:16,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 22:06:16,955 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:06:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:16,958 INFO L225 Difference]: With dead ends: 745 [2022-03-15 22:06:16,958 INFO L226 Difference]: Without dead ends: 745 [2022-03-15 22:06:16,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=850, Invalid=2572, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:06:16,959 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:16,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:06:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2022-03-15 22:06:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 469. [2022-03-15 22:06:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.7371794871794872) internal successors, (1749), 468 states have internal predecessors, (1749), 0 states have call successors, (0), 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:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1749 transitions. [2022-03-15 22:06:16,970 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1749 transitions. Word has length 16 [2022-03-15 22:06:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:16,970 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1749 transitions. [2022-03-15 22:06:16,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1749 transitions. [2022-03-15 22:06:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:16,971 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:16,971 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:16,987 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:17,187 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:17,187 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:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -578126427, now seen corresponding path program 4 times [2022-03-15 22:06:17,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:17,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608121179] [2022-03-15 22:06:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:17,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:17,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608121179] [2022-03-15 22:06:17,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608121179] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:17,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566648476] [2022-03-15 22:06:17,237 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:06:17,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:17,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:17,238 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:17,239 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:17,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:06:17,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:17,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:06:17,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:17,301 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:17,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:17,344 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:17,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566648476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:17,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:17,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:06:17,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1598701826] [2022-03-15 22:06:17,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:17,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:17,351 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 22:06:17,351 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:18,805 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [11787#(or (<= N (+ k 1)) (< (+ 2 k) N) (< i N)), 11789#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (< i N) (<= M j)), 11788#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (< i N)), 11775#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 11783#(or (< j M) (<= N k) (< (+ k 1) N) (< i N)), 11780#(or (< j M) (< i N)), 11792#(or (< k N) (<= (+ 2 i) N)), 11799#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N) (<= M j)), 11800#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= M j)), 11774#(or (< j M) (<= N k) (< (+ k 1) N)), 11795#(or (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11804#(or (< (+ j 1) M) (<= (+ 2 i) k) (<= M j)), 11776#(or (<= N (+ k 1)) (< (+ 2 k) N)), 11778#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 11777#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 11769#(< j M), 11773#(or (<= N k) (< (+ k 1) N)), 11772#(or (< (+ j 1) M) (< k N) (<= M j)), 11781#(or (< j M) (< k N) (< i N)), 11770#(or (< j M) (< k N)), 11771#(or (< (+ j 1) M) (<= M j)), 11790#(or (< j M) (<= (+ 2 i) N)), 11793#(or (< j M) (< k N) (<= (+ 2 i) N)), 11784#(or (< (+ j 1) M) (< i N) (<= M j)), 11801#(or (<= (+ 3 i) N) (< j M)), 11797#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N)), 11779#(or (< k N) (< i N)), 11782#(or (<= N k) (< (+ k 1) N) (< i N)), 11791#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 11794#(or (< (+ j 1) M) (< k N) (<= (+ 2 i) N) (<= M j)), 11802#(or (<= (+ 3 i) N) (< (+ j 1) M) (<= M j)), 11785#(or (< (+ j 1) M) (< k N) (< i N) (<= M j)), 11786#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (< i N) (<= M j)), 11798#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)), 11768#(< k N), 11796#(or (< j M) (<= N k) (< (+ k 1) N) (<= (+ 2 i) N)), 11803#(or (< j M) (<= (+ 2 i) k))] [2022-03-15 22:06:18,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:06:18,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:06:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2022-03-15 22:06:18,806 INFO L87 Difference]: Start difference. First operand 469 states and 1749 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 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:06:23,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:23,023 INFO L93 Difference]: Finished difference Result 1012 states and 3592 transitions. [2022-03-15 22:06:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:06:23,023 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 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 16 [2022-03-15 22:06:23,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:23,027 INFO L225 Difference]: With dead ends: 1012 [2022-03-15 22:06:23,027 INFO L226 Difference]: Without dead ends: 1000 [2022-03-15 22:06:23,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14180 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7971, Invalid=32229, Unknown=0, NotChecked=0, Total=40200 [2022-03-15 22:06:23,030 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 749 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:23,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 0 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:06:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2022-03-15 22:06:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 576. [2022-03-15 22:06:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 575 states have (on average 3.7704347826086955) internal successors, (2168), 575 states have internal predecessors, (2168), 0 states have call successors, (0), 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,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 2168 transitions. [2022-03-15 22:06:23,044 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 2168 transitions. Word has length 16 [2022-03-15 22:06:23,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:23,044 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 2168 transitions. [2022-03-15 22:06:23,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 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:06:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 2168 transitions. [2022-03-15 22:06:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:23,045 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:23,046 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:23,069 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:23,258 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:23,258 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:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:23,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1676567846, now seen corresponding path program 5 times [2022-03-15 22:06:23,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:23,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304941309] [2022-03-15 22:06:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:23,309 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:23,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304941309] [2022-03-15 22:06:23,309 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304941309] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:23,309 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052036099] [2022-03-15 22:06:23,309 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:06:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:23,310 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:23,311 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:23,331 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:06:23,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:23,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:06:23,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:23,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:06:23,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052036099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:23,471 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:23,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 22:06:23,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423398183] [2022-03-15 22:06:23,471 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:23,472 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:23,477 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 172 transitions. [2022-03-15 22:06:23,477 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:24,648 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [14410#(or (<= N (+ i 1)) (< (+ j 1) M) (< k N) (<= M j)), 14401#(or (<= N (+ 2 i)) (<= N k) (< (+ k 1) N)), 14400#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 14402#(or (<= (+ N j) (+ 2 M i)) (<= N k) (< (+ k 1) N)), 14407#(or (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 14409#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j)), 14391#(or (<= N (+ i 1)) (< j M)), 14394#(or (<= (+ N j) (+ 2 M i)) (< k N)), 14389#(or (<= N i) (< j M) (< k N)), 14390#(or (<= N (+ i 1)) (< k N)), 14386#(< j M), 14387#(or (<= N i) (< j M)), 14397#(or (< j M) (<= N k) (< (+ k 1) N)), 14405#(or (< (+ j 1) M) (< k N) (<= M j)), 14396#(or (<= N i) (<= N k) (< (+ k 1) N)), 14406#(or (< (+ j 1) M) (<= N i) (< k N) (<= M j)), 14385#(or (<= N i) (< k N)), 14408#(or (< (+ j 1) M) (<= N i) (<= N k) (< (+ k 1) N) (<= M j)), 14411#(or (<= N (+ i 1)) (< (+ j 1) M) (<= N k) (< (+ k 1) N) (<= M j)), 14393#(or (<= N (+ 2 i)) (< k N)), 14384#(< k N), 14395#(or (<= N k) (< (+ k 1) N)), 14392#(or (<= N (+ i 1)) (< j M) (< k N)), 14398#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 14404#(or (< (+ j 1) M) (<= N i) (<= M j)), 14399#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 14403#(or (< (+ j 1) M) (<= M j)), 14388#(or (< j M) (< k N))] [2022-03-15 22:06:24,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-03-15 22:06:24,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-03-15 22:06:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=1712, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:06:24,650 INFO L87 Difference]: Start difference. First operand 576 states and 2168 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 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) [2022-03-15 22:06:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:27,102 INFO L93 Difference]: Finished difference Result 934 states and 3191 transitions. [2022-03-15 22:06:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-03-15 22:06:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 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) Word has length 16 [2022-03-15 22:06:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:27,106 INFO L225 Difference]: With dead ends: 934 [2022-03-15 22:06:27,106 INFO L226 Difference]: Without dead ends: 929 [2022-03-15 22:06:27,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5044 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3474, Invalid=13818, Unknown=0, NotChecked=0, Total=17292 [2022-03-15 22:06:27,113 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:27,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 0 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:06:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-03-15 22:06:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 609. [2022-03-15 22:06:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 3.7878289473684212) internal successors, (2303), 608 states have internal predecessors, (2303), 0 states have call successors, (0), 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:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 2303 transitions. [2022-03-15 22:06:27,127 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 2303 transitions. Word has length 16 [2022-03-15 22:06:27,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:27,127 INFO L470 AbstractCegarLoop]: Abstraction has 609 states and 2303 transitions. [2022-03-15 22:06:27,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 36 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) [2022-03-15 22:06:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 2303 transitions. [2022-03-15 22:06:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:06:27,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:27,128 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:27,149 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:27,344 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:27,344 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:27,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -975824784, now seen corresponding path program 6 times [2022-03-15 22:06:27,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:27,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999538224] [2022-03-15 22:06:27,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:27,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:06:27,424 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:27,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999538224] [2022-03-15 22:06:27,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999538224] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:27,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869898553] [2022-03-15 22:06:27,424 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:06:27,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:27,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:27,425 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:27,426 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:27,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:06:27,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:27,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:06:27,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:27,494 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:27,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:27,544 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:27,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869898553] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:27,545 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:27,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-03-15 22:06:27,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1973549695] [2022-03-15 22:06:27,547 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:27,548 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:27,553 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 22:06:27,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:06:28,355 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [16841#(or (< (+ 2 j) M) (<= M (+ j 1))), 16840#(or (< (+ j 1) M) (<= M j)), 16847#(or (< (+ 2 j) M) (<= (+ 2 i) N) (<= M (+ j 1))), 16843#(or (< (+ j 1) M) (< i N) (<= M j)), 16845#(or (< j M) (<= (+ 2 i) N)), 16839#(< j M), 16846#(or (< (+ j 1) M) (<= (+ 2 i) N) (<= M j)), 16842#(or (< j M) (< i N)), 16844#(or (< (+ 2 j) M) (<= M (+ j 1)) (< i N))] [2022-03-15 22:06:28,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:06:28,355 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:06:28,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:06:28,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:06:28,356 INFO L87 Difference]: Start difference. First operand 609 states and 2303 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:06:28,767 INFO L93 Difference]: Finished difference Result 1081 states and 4109 transitions. [2022-03-15 22:06:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 22:06:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:06:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:06:28,775 INFO L225 Difference]: With dead ends: 1081 [2022-03-15 22:06:28,776 INFO L226 Difference]: Without dead ends: 1081 [2022-03-15 22:06:28,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=963, Unknown=0, NotChecked=0, Total=1332 [2022-03-15 22:06:28,776 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:06:28,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:06:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-03-15 22:06:28,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 727. [2022-03-15 22:06:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 3.84297520661157) internal successors, (2790), 726 states have internal predecessors, (2790), 0 states have call successors, (0), 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:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 2790 transitions. [2022-03-15 22:06:28,791 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 2790 transitions. Word has length 16 [2022-03-15 22:06:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:06:28,791 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 2790 transitions. [2022-03-15 22:06:28,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:06:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 2790 transitions. [2022-03-15 22:06:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:06:28,793 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:06:28,793 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:06:28,811 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:29,007 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:29,007 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:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:06:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1822388072, now seen corresponding path program 8 times [2022-03-15 22:06:29,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:06:29,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79464064] [2022-03-15 22:06:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:06:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:06:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:06:29,818 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:06:29,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:06:29,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79464064] [2022-03-15 22:06:29,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79464064] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:06:29,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245405101] [2022-03-15 22:06:29,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:06:29,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:06:29,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:06:29,820 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:29,821 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:29,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:06:29,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:06:29,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:06:29,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:06:30,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:30,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:30,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:30,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:06:30,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:06:30,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 153 [2022-03-15 22:06:30,789 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:06:30,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:06:33,396 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:06:33,396 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 1647 treesize of output 893 [2022-03-15 22:06:59,583 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:06:59,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245405101] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:06:59,583 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:06:59,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 22:06:59,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2074343811] [2022-03-15 22:06:59,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:06:59,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:06:59,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:06:59,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:57,051 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [19573#(and (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max1) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N)) (or (= max3 (select A (+ (- 1) N))) (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ max2 1) max1) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ 2 k) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (+ 2 i) N) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (= max2 max1))), 19578#(and (or (< j M) (= max2 max1)) (or (< j M) (= i 0)) (or (< j M) (= k 0)) (or (< j M) (= max3 max1)) (or (< j M) (= i max2))), 19566#(and (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (< (+ 2 i) N) (< j M) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (= (select A i) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< j M) (<= (+ 2 i) N)) (or (< (+ 2 i) N) (< j M) (<= (select A i) max1) (<= (+ max2 1) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 0) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)))), 19554#(and (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3))), 19572#(and (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (<= (+ max2 1) max1) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 0) (<= (+ max2 1) max1) (< (+ k 1) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ max2 1) max1) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (<= (+ max2 1) max1) (< (+ k 1) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (= max1 (select A k)) (< (+ 2 i) N) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (= max3 (select A (+ (- 1) N))) (not (< k N)) (< (+ 2 i) N) (< j M) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (< max3 (select A k)) (<= (select A (+ (- 1) N)) (select A i)))), 19571#(and (or (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< k N) (<= (+ max2 1) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (= max3 0) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< j M) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< j M) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1))), 19569#(and (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 i) N) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< (+ 2 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (<= (+ max2 1) max1) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ 2 k) N) (< max3 (select A k)) (= (select A i) max3)) (or (= max3 (select A (+ (- 1) N))) (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= N (+ k 1)) (< (+ 2 i) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N)) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ max2 1) max1) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max1 1) (select A (+ (- 1) N))) (< max3 (select A (+ k 1))) (< (+ 2 i) N) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max1) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (= max1 (select A k)) (< (+ 2 i) N) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 i) N))), 19555#(and (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1) (< i N)) (or (<= N (+ k 1)) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (< i N)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N))), 19557#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k))) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3))), 19562#(and (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (= (select A i) (select A (+ 2 k))) (<= (select A (+ 2 k)) (select A k)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (select A i) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k))) (= (select A i) max3)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (= (select A i) (select A (+ 2 k))) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (= (select A i) (select A (+ 2 k))) (<= (select A i) max1) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (select A k) (select A (+ 2 k))) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A i) max1) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (= (select A i) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1))), 19556#(and (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ 2 k) N) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N) (< max3 (select A k)))), 19550#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2) (< i N)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (not (< k N)) (= max1 (select A k)) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N))), 19576#(and (or (< j M) (<= (+ 2 i) k)) (or (< (+ 2 i) k) (< j M) (= i max3) (<= max3 (select A i)) (<= (+ (select A i) 1) (select A (+ (- 1) k)))) (or (< j M) (= (+ i (* (- 1) max2)) 0)) (or (< (+ 2 i) k) (< j M) (= max3 0) (not (= i max3))) (or (< (+ 2 i) k) (< j M) (<= (select A (+ (- 1) k)) i) (not (= i max3))) (or (< (+ 2 i) k) (< j M) (= i max1)) (or (< (+ 2 i) k) (<= (select A (+ (- 1) k)) (select A i)) (< j M) (= (select A (+ (- 1) k)) max3) (= i max3)) (or (< (+ 2 i) k) (< j M) (<= (+ i 1) max3) (= i max3)) (or (< (+ 2 i) k) (< j M) (<= (+ (select A i) i) (+ max3 max1)))), 19548#(and (or (< j M) (< k N) (<= (+ i 1) N) (<= 0 max2) (= max3 max1)) (or (< j M) (= max3 0) (< k N) (<= (+ i 1) N) (= max3 max1)) (or (< j M) (= max3 0) (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3)) (or (< j M) (< k N) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1))), 19568#(and (or (not (< k N)) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (+ max2 1) max1) (< (+ k 1) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (= max3 0) (<= (+ max2 1) max1) (< (+ k 1) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (= max3 (select A (+ (- 1) N))) (not (< k N)) (< (+ 2 i) N) (< (+ k 1) N) (<= (select A (+ (- 1) N)) max1) (< max3 (select A k)) (<= (select A (+ (- 1) N)) (select A i))) (or (not (< k N)) (< (+ 2 i) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (<= (+ max2 1) max1) (< (+ k 1) N) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (= max1 (select A k)) (< (+ 2 i) N) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (= (select A k) 0) (not (< max3 (select A k))) (<= (+ max2 1) max1) (< (+ k 1) N)) (or (not (< k N)) (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (not (< k N)) (< (+ 2 i) N) (<= (select A i) max1) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ k 1) N) (< max3 (select A k)) (= (select A i) max3))), 19565#(and (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (= (select A i) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= max2 max1)) (or (= (select A i) (select A (+ 2 k))) (<= (select A (+ 2 k)) (select A k)) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (= (select A i) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (= (select A i) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A i) max1) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k))) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A i) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k))) (= (select A i) max3)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i)) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= (+ max1 1) (select A i))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (<= 0 max2) (<= (+ max1 1) (select A i)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N) (= (select A (+ 2 k)) 0))), 19558#(and (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= 0 max2) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (< i N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (< i N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (< i N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (< i N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (< max3 (select A k)) (< i N)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (< max3 (select A k)) (= max3 max1) (< i N))), 19577#(and (or (< j M) (= i max1)) (or (< j M) (<= (select A i) max1) (= (select A i) max3)) (or (< j M) (= i max3) (<= (+ max1 1) (select A i))) (or (<= (+ i 1) k) (< j M)) (or (< j M) (= i max2)) (or (< j M) (= max3 0) (<= (+ max1 1) (select A i)))), 19560#(and (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2))), 19574#(and (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A i) max3)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< j M) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< (+ 2 i) N) (< j M) (<= N (+ 2 k)) (<= (select A (+ (- 1) N)) max1) (< (+ 3 k) N) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (< j M) (<= (select A (+ i 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< j M) (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (< j M) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< j M) (<= (select A i) max1) (= max3 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1))), 19567#(and (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (<= (+ max2 1) max1) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (<= (select A i) max1) (< k N) (<= (+ max2 1) max3)) (or (< k N) (<= (+ 2 i) N)) (or (= max3 (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i))) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ 2 i) N) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< k N) (= (select A i) max3)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (< k N) (= max3 max1) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ max1 1) (select A (+ (- 1) N))) (< (+ 2 i) N) (= max3 0) (< k N) (<= (+ max2 1) max1) (<= (+ max1 1) (select A i))) (or (< (+ 2 i) N) (< k N) (<= (select A (+ (- 1) N)) max1) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1))), 19559#(and (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ 2 i) N) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ 2 k) N) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (= max3 0) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (<= N (+ k 1)) (< max3 (select A (+ k 1))) (< j M) (< (+ 2 k) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (= (select A i) (select A k)) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A i) max1) (< (+ 2 k) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= (+ 2 i) N)) (or (<= N (+ k 1)) (< j M) (<= (select A i) max1) (< (+ 2 k) N) (<= (select A (+ k 1)) max3) (= (select A i) (select A (+ k 1))) (<= (+ 2 i) N) (< max3 (select A k))) (or (<= N (+ k 1)) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (<= (select A k) max3) (<= (+ 2 i) N) (= max2 max1)) (or (<= N (+ k 1)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 2 k) N) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= (+ 2 i) N) (<= (+ max1 1) (select A i)))), 19551#(and (or (< j M) (= max3 0) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (= max3 0) (<= (+ 2 i) N) (<= (+ max2 1) max3)) (or (< j M) (<= (select A i) max1) (<= (+ 2 i) N) (= (select A i) max3)) (or (< j M) (<= (+ 2 i) N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (<= (+ 2 i) N) (= max2 max1))), 19546#(and (or (< j M) (= max3 0) (< k N) (<= (+ max2 1) max3)) (or (< j M) (= max3 0) (< k N) (= max3 max1)) (or (< j M) (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (< k N) (<= 0 max2) (= max3 max1))), 19547#(and (or (< j M) (<= (+ i 1) N) (<= 0 max2) (= max3 max1)) (or (< j M) (= max3 0) (<= (+ i 1) N) (= max3 max1)) (or (< j M) (<= (+ i 1) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (= max3 0) (<= (+ i 1) N) (<= (+ max2 1) max3))), 19543#(and (or (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (= max3 0) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3)) (or (= max3 0) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< k N) (<= (+ 2 i) N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1))), 19552#(and (or (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< k N) (<= (+ 2 i) N) (= max2 max1)) (or (< j M) (<= (select A i) max1) (< k N) (<= (+ 2 i) N) (= (select A i) max3)) (or (< j M) (= max3 0) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3)) (or (< j M) (= max3 0) (< k N) (<= (+ 2 i) N) (= max3 max1) (<= (+ max1 1) (select A i))) (or (< j M) (< k N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (< k N) (<= (+ 2 i) N) (<= 0 max2) (= max3 max1) (<= (+ max1 1) (select A i)))), 19575#(and (or (< j M) (<= (+ (select A i) 1) (select A (+ (- 1) N))) (<= (select A i) max1) (< (+ 3 i) N) (<= (+ (select A i) 1) (select A (+ (- 2) N))) (= (select A i) max3)) (or (< j M) (< (+ 3 i) N) (= i max2)) (or (< j M) (= i max1) (< (+ 3 i) N)) (or (< j M) (<= (+ max1 1) (select A (+ (- 2) N))) (< (+ 3 i) N) (= max3 0) (<= (+ max1 1) (select A i)) (<= (+ i 1) (select A (+ (- 1) N)))) (or (<= 0 i) (< j M) (<= (+ max1 1) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (+ max1 1) (select A i)) (<= (+ i 1) (select A (+ (- 1) N)))) (or (<= (+ 3 i) N) (< j M)) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (= (select A (+ (- 2) N)) max3) (<= (select A (+ (- 2) N)) (select A i)) (< j M) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) i)) (or (= max3 (select A (+ (- 1) N))) (< j M) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (select A (+ (- 1) N)) (select A i)) (<= (select A (+ (- 1) N)) i))), 19545#(and (or (< j M) (= max3 0) (= max3 max1)) (or (< j M) (<= (+ max2 1) max3) (= max2 max1)) (or (< j M) (= max3 0) (<= (+ max2 1) max3)) (or (< j M) (<= 0 max2) (= max3 max1))), 19563#(and (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)))), 19564#(and (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (< max3 (select A (+ 2 k)))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (< j M) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (< j M) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< j M) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< max3 (select A (+ k 1))) (< j M) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (< j M) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< max3 (select A (+ k 1))) (< j M) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1))), 19541#(and (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2)) (or (not (< k N)) (= max1 (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1))), 19570#(and (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (<= (select A (+ i 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (< (+ 2 i) N) (<= N (+ 2 k)) (<= (select A (+ (- 1) N)) max1) (< (+ 3 k) N) (<= (select A (+ (- 1) N)) (select A i)) (<= (+ 2 max2) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (< (select A k) (select A (+ k 1))) (= (select A i) (select A k)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= N (+ 2 k)) (<= (+ 2 i) N) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (= max3 0) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k))) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (select A i) max1) (= max3 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (= (select A k) (select A (+ i 1))) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (< max3 (select A (+ k 1))) (<= (+ (select A i) 1) (select A (+ i 1))) (<= (select A i) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A i) max3)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ i 1)) max1) (= max3 (select A (+ i 1))) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (< max3 (select A (+ 2 k)))) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< max1 (select A i)) (< (+ 3 k) N) (<= 0 max2)) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max1 1) (select A (+ i 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max2 max1)) (or (<= (+ 3 i) N) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max1 1) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= (select A (+ 2 k)) max1)) (or (<= (+ 3 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= max2 max1))), 19549#(and (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1)) (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2)) (or (not (< k N)) (= max1 (select A k)) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (= max2 max1))), 19561#(and (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (= (select A (+ k 1)) 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (<= (+ max2 1) max3) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (< max3 (select A (+ 2 k)))) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N) (= (select A (+ 2 k)) max1)) (or (< max3 (select A (+ k 1))) (= max3 0) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (= max3 max1) (< i N) (< max3 (select A (+ 2 k)))) (or (< max3 (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= (+ max2 1) (select A (+ 2 k))) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (+ max2 1) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N) (= max2 max1)) (or (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (+ max2 1) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N)) (or (< (select A k) (select A (+ 2 k))) (= max1 (select A k)) (= (select A k) 0) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (+ max2 1) (select A (+ 2 k))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N)) (or (< max3 (select A (+ k 1))) (<= (select A (+ 2 k)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (<= (select A (+ 2 k)) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (= (select A (+ 2 k)) 0) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) max3) (= (select A (+ k 1)) 0) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (< max3 (select A k)) (< i N)) (or (< (select A (+ k 1)) (select A (+ 2 k))) (<= (select A (+ k 1)) (select A k)) (<= (select A k) max3) (= (select A (+ k 1)) max1) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< i N)) (or (<= (select A (+ 2 k)) (select A (+ k 1))) (<= (select A (+ k 1)) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (<= 0 max2) (< max3 (select A k)) (< i N) (= (select A (+ 2 k)) max1)) (or (< (select A k) (select A (+ 2 k))) (<= (+ max2 1) (select A k)) (< (select A k) (select A (+ k 1))) (<= (select A k) max3) (<= N (+ 2 k)) (< (+ 3 k) N) (< i N) (= max2 max1))), 19539#(and (or (< k N) (<= 0 max2) (= max3 max1)) (or (= max3 0) (< k N) (<= (+ max2 1) max3)) (or (< k N) (<= (+ max2 1) max3) (= max2 max1)) (or (= max3 0) (< k N) (= max3 max1))), 19553#(and (or (not (< k N)) (= max1 (select A k)) (< j M) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (< j M) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (< j M) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (= max1 (select A k)) (< j M) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< j M) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1))), 19544#(and (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max1 (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max1 1) (select A i))) (or (not (< k N)) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k)) (= max2 max1)) (or (not (< k N)) (<= (select A i) max1) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= (select A i) max3)) (or (not (< k N)) (<= (select A i) max1) (<= (+ 2 max2) (select A i)) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (<= (select A i) max1) (not (< max3 (select A k))) (= (select A i) (select A k)) (< (+ k 1) N) (<= (+ 2 i) N)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N) (<= 0 max2) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (< max3 (select A k)) (= max3 max1) (<= (+ max1 1) (select A i))) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ 2 i) N) (<= (+ max2 1) max3) (< max3 (select A k))) (or (not (< k N)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (<= (+ 2 i) N))), 19540#(and (or (< k N) (<= (+ max2 1) max3) (< i N) (= max2 max1)) (or (= max3 0) (< k N) (= max3 max1) (< i N)) (or (= max3 0) (< k N) (<= (+ max2 1) max3) (< i N)) (or (< k N) (<= 0 max2) (= max3 max1) (< i N))), 19542#(and (or (not (< k N)) (<= (+ max2 1) (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (< i N) (= max2 max1)) (or (not (< k N)) (= max1 (select A k)) (not (< max3 (select A k))) (< (+ k 1) N) (<= 0 max2) (< i N)) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= 0 max2) (< max3 (select A k)) (= max3 max1) (< i N)) (or (not (< k N)) (< (+ k 1) N) (<= (+ max2 1) max3) (< max3 (select A k)) (< i N) (= max2 max1)) (or (not (< k N)) (= max3 0) (< (+ k 1) N) (< max3 (select A k)) (= max3 max1) (< i N)) (or (not (< k N)) (<= (+ max2 1) (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)) (or (not (< k N)) (= max1 (select A k)) (= (select A k) 0) (not (< max3 (select A k))) (< (+ k 1) N) (< i N)))] [2022-03-15 22:08:57,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:08:57,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:08:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3779, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 22:08:57,052 INFO L87 Difference]: Start difference. First operand 727 states and 2790 transitions. Second operand has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 0 states have call successors, (0), 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:09:04,633 WARN L228 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 281 DAG size of output: 240 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:09:45,842 WARN L228 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 340 DAG size of output: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:09:54,039 WARN L228 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 198 DAG size of output: 189 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:10:29,198 WARN L228 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 302 DAG size of output: 175 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-15 22:12:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:36,844 INFO L93 Difference]: Finished difference Result 1304 states and 4500 transitions. [2022-03-15 22:12:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 22:12:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have 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:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:36,856 INFO L225 Difference]: With dead ends: 1304 [2022-03-15 22:12:36,856 INFO L226 Difference]: Without dead ends: 1277 [2022-03-15 22:12:36,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16729 ImplicationChecksByTransitivity, 226.8s TimeCoverageRelationStatistics Valid=7145, Invalid=41475, Unknown=0, NotChecked=0, Total=48620 [2022-03-15 22:12:36,859 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 761 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:36,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 0 Invalid, 3111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-03-15 22:12:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2022-03-15 22:12:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 814. [2022-03-15 22:12:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 3.896678966789668) internal successors, (3168), 813 states have internal predecessors, (3168), 0 states have call successors, (0), 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:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 3168 transitions. [2022-03-15 22:12:36,891 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 3168 transitions. Word has length 17 [2022-03-15 22:12:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:36,892 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 3168 transitions. [2022-03-15 22:12:36,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.8) internal successors, (140), 50 states have internal predecessors, (140), 0 states have call successors, (0), 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:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 3168 transitions. [2022-03-15 22:12:36,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:12:36,894 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:36,894 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:36,910 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:12:37,099 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:12:37,099 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:12:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -633677775, now seen corresponding path program 9 times [2022-03-15 22:12:37,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:37,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478124777] [2022-03-15 22:12:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:37,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:37,155 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:12:37,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:37,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478124777] [2022-03-15 22:12:37,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478124777] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:37,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227434761] [2022-03-15 22:12:37,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:12:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:37,156 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:12:37,158 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:12:37,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:12:37,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:12:37,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:12:37,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:37,271 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:12:37,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:37,310 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:12:37,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227434761] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:37,310 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:37,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-03-15 22:12:37,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [423324205] [2022-03-15 22:12:37,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:37,311 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:37,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:12:37,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:37,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [22938#(or (<= N (+ i 1)) (< (+ 2 i) N)), 22946#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 22947#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 22936#(< i N), 22945#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N 1) k)), 22939#(or (<= (+ N 1) k) (< i N)), 22943#(or (<= N i) (< (+ i 1) N) (<= N k)), 22937#(or (<= N i) (< (+ i 1) N)), 22940#(or (<= N k) (< i N)), 22941#(or (<= N (+ k 1)) (< i N)), 22944#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 22942#(or (<= N i) (< (+ i 1) N) (<= (+ N 1) k))] [2022-03-15 22:12:37,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:12:37,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:37,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:12:37,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:12:37,934 INFO L87 Difference]: Start difference. First operand 814 states and 3168 transitions. Second operand has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 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:12:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:38,714 INFO L93 Difference]: Finished difference Result 1409 states and 5086 transitions. [2022-03-15 22:12:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:12:38,715 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 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) Word has length 17 [2022-03-15 22:12:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:38,720 INFO L225 Difference]: With dead ends: 1409 [2022-03-15 22:12:38,721 INFO L226 Difference]: Without dead ends: 1345 [2022-03-15 22:12:38,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1114, Invalid=3442, Unknown=0, NotChecked=0, Total=4556 [2022-03-15 22:12:38,722 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:38,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:12:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2022-03-15 22:12:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 740. [2022-03-15 22:12:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 739 states have (on average 3.8403247631935047) internal successors, (2838), 739 states have internal predecessors, (2838), 0 states have call successors, (0), 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:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 2838 transitions. [2022-03-15 22:12:38,739 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 2838 transitions. Word has length 17 [2022-03-15 22:12:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:38,739 INFO L470 AbstractCegarLoop]: Abstraction has 740 states and 2838 transitions. [2022-03-15 22:12:38,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 21 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:12:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 2838 transitions. [2022-03-15 22:12:38,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:12:38,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:38,741 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:38,760 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:12:38,945 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:12:38,946 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:12:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -789180409, now seen corresponding path program 7 times [2022-03-15 22:12:38,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:38,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528288969] [2022-03-15 22:12:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:38,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:40,053 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:40,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:40,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528288969] [2022-03-15 22:12:40,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528288969] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:40,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341453254] [2022-03-15 22:12:40,053 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:12:40,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:40,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:40,054 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:12:40,058 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:12:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:40,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 35 conjunts are in the unsatisfiable core [2022-03-15 22:12:40,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:40,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:40,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:40,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:40,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:40,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:12:40,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:40,875 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 183 treesize of output 117 [2022-03-15 22:12:41,297 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:41,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:45,249 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:12:45,250 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 1655 treesize of output 975 [2022-03-15 22:16:31,794 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:31,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341453254] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:31,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:31,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 22:16:31,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [954753279] [2022-03-15 22:16:31,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:31,796 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:31,803 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 219 transitions. [2022-03-15 22:16:31,803 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider Received shutdown request... [2022-03-15 22:17:24,982 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-03-15 22:17:24,984 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:17:24,990 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:17:25,010 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:17:25,023 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:17:25,187 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:17:25,187 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 6ms.. [2022-03-15 22:17:25,189 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:17:25,189 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:17:25,189 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:17:25,190 INFO L732 BasicCegarLoop]: Path program histogram: [9, 7, 1, 1, 1] [2022-03-15 22:17:25,191 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:17:25,191 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:17:25,193 INFO L202 PluginConnector]: Adding new model max-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:17:25 BasicIcfg [2022-03-15 22:17:25,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:17:25,193 INFO L158 Benchmark]: Toolchain (without parser) took 782014.17ms. Allocated memory was 188.7MB in the beginning and 702.5MB in the end (delta: 513.8MB). Free memory was 152.9MB in the beginning and 407.3MB in the end (delta: -254.4MB). Peak memory consumption was 450.9MB. Max. memory is 8.0GB. [2022-03-15 22:17:25,193 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:17:25,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.06ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-15 22:17:25,193 INFO L158 Benchmark]: Boogie Preprocessor took 18.76ms. Allocated memory is still 188.7MB. Free memory was 151.3MB in the beginning and 150.3MB in the end (delta: 969.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:17:25,194 INFO L158 Benchmark]: RCFGBuilder took 205.32ms. Allocated memory is still 188.7MB. Free memory was 150.3MB in the beginning and 140.7MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:17:25,194 INFO L158 Benchmark]: TraceAbstraction took 781762.07ms. Allocated memory was 188.7MB in the beginning and 702.5MB in the end (delta: 513.8MB). Free memory was 140.2MB in the beginning and 407.3MB in the end (delta: -267.2MB). Peak memory consumption was 438.3MB. Max. memory is 8.0GB. [2022-03-15 22:17:25,194 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.10ms. Allocated memory is still 188.7MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.06ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 151.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.76ms. Allocated memory is still 188.7MB. Free memory was 151.3MB in the beginning and 150.3MB in the end (delta: 969.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 205.32ms. Allocated memory is still 188.7MB. Free memory was 150.3MB in the beginning and 140.7MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 781762.07ms. Allocated memory was 188.7MB in the beginning and 702.5MB in the end (delta: 513.8MB). Free memory was 140.2MB in the beginning and 407.3MB in the end (delta: -267.2MB). Peak memory consumption was 438.3MB. 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, 116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 116, positive conditional: 0, positive unconditional: 116, 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: 70, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 116, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , 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: 66]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 6ms.. - 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 analyzing trace of length 18 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 6ms.. - 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 analyzing trace of length 18 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 6ms.. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 18 with TraceHistMax 3,while SimplifyDDAWithTimeout was simplifying term of DAG size 5 for 6ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 781.7s, OverallIterations: 19, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 287.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4211 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4211 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3488 mSDsCounter, 2126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13156 IncrementalHoareTripleChecker+Invalid, 15282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2126 mSolverCounterUnsat, 0 mSDtfsCounter, 13156 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2179 GetRequests, 867 SyntacticMatches, 44 SemanticMatches, 1268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55696 ImplicationChecksByTransitivity, 294.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=814occurred in iteration=17, InterpolantAutomatonStates: 998, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 4125 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 47.6s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 674 ConstructedInterpolants, 3 QuantifiedInterpolants, 13026 SizeOfPredicates, 48 NumberOfNonLiveVariables, 980 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 48 InterpolantComputations, 3 PerfectInterpolantSequences, 134/305 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