/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:07:23,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:07:23,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:07:23,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:07:23,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:07:23,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:07:23,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:07:23,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:07:23,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:07:23,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:07:23,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:07:23,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:07:23,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:07:23,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:07:23,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:07:23,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:07:23,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:07:23,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:07:23,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:07:23,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:07:23,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:07:23,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:07:23,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:07:23,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:07:23,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:07:23,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:07:23,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:07:23,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:07:23,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:07:23,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:07:23,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:07:23,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:07:23,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:07:23,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:07:23,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:07:23,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:07:23,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:07:23,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:07:23,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:07:23,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:07:23,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:07:23,926 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:07:23,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:07:23,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:07:23,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:07:23,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:07:23,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:07:23,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:07:23,969 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:07:23,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:07:23,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:07:23,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:07:23,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:07:23,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:07:23,971 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:07:23,971 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:07:23,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:07:23,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:07:23,977 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:07:23,978 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:07:24,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:07:24,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:07:24,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:07:24,171 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:07:24,177 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:07:24,178 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun-alt.wvr.bpl [2022-03-15 22:07:24,178 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/min-fun-alt.wvr.bpl' [2022-03-15 22:07:24,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:07:24,212 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:07:24,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:07:24,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:07:24,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:07:24,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,240 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,247 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:07:24,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:07:24,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:07:24,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:07:24,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:07:24,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:07:24,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:07:24,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:07:24,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:07:24,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/1) ... [2022-03-15 22:07:24,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:07:24,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:24,357 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:07:24,359 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:07:24,389 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:07:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:07:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:07:24,389 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:07:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:07:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:07:24,389 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:07:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:07:24,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:07:24,390 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:07:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:07:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:07:24,390 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:07:24,428 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:07:24,430 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:07:24,493 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:07:24,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:07:24,516 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:07:24,517 INFO L202 PluginConnector]: Adding new model min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:07:24 BoogieIcfgContainer [2022-03-15 22:07:24,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:07:24,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:07:24,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:07:24,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:07:24,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:07:24" (1/2) ... [2022-03-15 22:07:24,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708302f5 and model type min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:07:24, skipping insertion in model container [2022-03-15 22:07:24,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:07:24" (2/2) ... [2022-03-15 22:07:24,534 INFO L111 eAbstractionObserver]: Analyzing ICFG min-fun-alt.wvr.bpl [2022-03-15 22:07:24,537 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:07:24,537 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:07:24,537 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:07:24,537 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:07:24,574 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:07:24,607 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:07:24,612 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:07:24,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:07:24,619 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:07:24,625 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:07:24,627 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:07:24,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:07:24,645 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:07:24,646 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:07:24,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:07:24,649 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:07:24,910 INFO L131 LiptonReduction]: Checked pairs total: 106 [2022-03-15 22:07:24,911 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:07:24,916 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:07:24,926 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:07:24,927 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:07:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:07:24,931 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:24,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:24,932 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:07:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:24,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1022751962, now seen corresponding path program 1 times [2022-03-15 22:07:24,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:24,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589810480] [2022-03-15 22:07:24,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:24,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:25,061 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:07:25,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:25,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589810480] [2022-03-15 22:07:25,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589810480] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:07:25,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:07:25,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:07:25,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [801727306] [2022-03-15 22:07:25,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:25,072 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:25,089 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:07:25,089 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:25,377 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:07:25,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:07:25,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:07:25,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:07:25,398 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:07:25,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:25,426 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:07:25,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:07:25,428 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:07:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:25,436 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:07:25,436 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:07:25,438 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:07:25,445 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:07:25,447 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:07:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:07:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:07:25,481 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:07:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:07:25,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:07:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:25,485 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:07:25,485 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:07:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:07:25,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:07:25,486 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:25,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:25,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:07:25,487 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:07:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1617420820, now seen corresponding path program 1 times [2022-03-15 22:07:25,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:25,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719683425] [2022-03-15 22:07:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:25,528 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:07:25,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:25,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719683425] [2022-03-15 22:07:25,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719683425] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:07:25,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:07:25,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:07:25,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [878816138] [2022-03-15 22:07:25,529 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:25,530 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:25,532 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:07:25,532 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:25,684 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:07:25,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:07:25,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:25,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:07:25,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:07:25,687 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:25,731 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:07:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:07:25,732 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:07:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:25,732 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:07:25,732 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:07:25,733 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:07:25,733 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:07:25,734 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:07:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:07:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:07:25,737 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:07:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:07:25,737 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:07:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:25,737 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:07:25,738 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:07:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:07:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:07:25,738 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:25,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:25,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:07:25,738 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:07:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1327324498, now seen corresponding path program 1 times [2022-03-15 22:07:25,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:25,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626110099] [2022-03-15 22:07:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:25,789 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:07:25,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:25,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626110099] [2022-03-15 22:07:25,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626110099] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:07:25,790 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:07:25,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:07:25,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [111559948] [2022-03-15 22:07:25,790 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:25,791 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:25,793 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:07:25,793 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:25,913 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:07:25,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:07:25,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:25,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:07:25,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:07:25,915 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:25,950 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:07:25,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:07:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:07:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:25,951 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:07:25,951 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:07:25,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:07:25,952 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:25,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:07:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:07:25,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:07:25,955 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:07:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:07:25,956 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:07:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:25,956 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:07:25,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:07:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:07:25,957 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:25,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:25,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:07:25,957 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:07:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1745317284, now seen corresponding path program 1 times [2022-03-15 22:07:25,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:25,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242173647] [2022-03-15 22:07:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:25,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:26,109 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:07:26,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:26,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242173647] [2022-03-15 22:07:26,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242173647] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:26,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285544841] [2022-03-15 22:07:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:26,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:26,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:26,128 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:07:26,133 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:07:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:26,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-15 22:07:26,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:26,360 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:07:26,402 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:07:26,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:26,475 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:07:26,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2022-03-15 22:07:26,569 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:07:26,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285544841] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:26,570 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:26,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:07:26,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1139856632] [2022-03-15 22:07:26,570 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:26,571 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:26,573 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:07:26,574 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:27,340 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [543#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< j M) (= k 0))), 545#(and (or (< j M) (= min1 min2) (< (select A i) min1)) (or (<= min1 (select A i)) (< j M) (= (select A i) min2))), 544#(and (or (<= min1 (select A i)) (= (select A i) min2)) (or (= min1 min2) (< (select A i) min1))), 546#(and (or (< j M) (= k i)) (or (< j M) (= i min2)) (or (< j M) (= min1 min2)) (or (< j M) (= k 0))), 542#(or (< j M) (= min1 min2))] [2022-03-15 22:07:27,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:07:27,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:27,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:07:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:07:27,342 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:07:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:27,551 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:07:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:07:27,551 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:07:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:27,552 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:07:27,552 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:07:27,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:07:27,553 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:27,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:07:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:07:27,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:07:27,557 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:07:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:07:27,558 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:07:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:27,558 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:07:27,558 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:07:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:07:27,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:07:27,559 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:27,559 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:27,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:07:27,771 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:07:27,772 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:07:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1818191762, now seen corresponding path program 2 times [2022-03-15 22:07:27,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:27,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181778316] [2022-03-15 22:07:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:27,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:27,818 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:07:27,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:27,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181778316] [2022-03-15 22:07:27,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181778316] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:27,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037033966] [2022-03-15 22:07:27,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:07:27,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:27,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:27,829 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:07:27,830 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:07:27,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:07:27,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:27,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:07:27,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:27,894 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:07:27,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:27,932 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:07:27,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037033966] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:27,933 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:27,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:07:27,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413887544] [2022-03-15 22:07:27,934 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:27,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:27,939 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:07:27,939 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:28,430 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [851#(or (<= N i) (< (+ i 1) N)), 843#(or (<= k i) (< j M)), 865#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 862#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 852#(or (<= N (+ i 1)) (< (+ 2 i) N)), 864#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 860#(or (< j M) (< k N) (< i N)), 850#(< i N), 853#(< j M), 861#(or (<= N i) (< (+ i 1) N) (< k N)), 855#(or (<= N i) (< (+ i 1) N) (< j M)), 859#(or (< k N) (< i N)), 863#(or (< j M) (<= (+ k 1) i)), 856#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 854#(or (< j M) (< i N)), 857#(or (<= (+ k 1) N) (< j M)), 858#(or (<= (+ 2 k) N) (< j M))] [2022-03-15 22:07:28,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:07:28,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:07:28,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:07:28,432 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:29,393 INFO L93 Difference]: Finished difference Result 171 states and 489 transitions. [2022-03-15 22:07:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:07:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:07:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:29,397 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:07:29,397 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 22:07:29,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:07:29,399 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:29,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:07:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 22:07:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2022-03-15 22:07:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.2989690721649483) internal successors, (320), 97 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:29,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 320 transitions. [2022-03-15 22:07:29,419 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 320 transitions. Word has length 14 [2022-03-15 22:07:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:29,420 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 320 transitions. [2022-03-15 22:07:29,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 320 transitions. [2022-03-15 22:07:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:07:29,421 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:29,421 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:29,440 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:07:29,640 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:07:29,641 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:07:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1729849712, now seen corresponding path program 3 times [2022-03-15 22:07:29,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:29,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873592718] [2022-03-15 22:07:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:29,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:29,688 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:07:29,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:29,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873592718] [2022-03-15 22:07:29,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873592718] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:29,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769309790] [2022-03-15 22:07:29,689 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:07:29,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:29,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:29,704 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:07:29,705 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:07:29,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:07:29,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:29,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:07:29,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:29,797 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:07:29,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:29,832 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:07:29,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769309790] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:29,832 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:29,832 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:07:29,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [877578166] [2022-03-15 22:07:29,832 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:29,833 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:29,858 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:07:29,859 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:30,165 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1389#(or (<= N k) (< i N)), 1391#(or (<= N i) (< (+ i 1) N) (<= N k)), 1388#(< i N), 1390#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:07:30,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:07:30,166 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:30,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:07:30,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:07:30,166 INFO L87 Difference]: Start difference. First operand 98 states and 320 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:30,494 INFO L93 Difference]: Finished difference Result 216 states and 644 transitions. [2022-03-15 22:07:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:07:30,494 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:07:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:30,495 INFO L225 Difference]: With dead ends: 216 [2022-03-15 22:07:30,495 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 22:07:30,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:07:30,496 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:30,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:07:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 22:07:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2022-03-15 22:07:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.335570469798658) internal successors, (497), 149 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:07:30,502 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:07:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:30,502 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:07:30,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:07:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:07:30,504 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:30,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:30,522 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:07:30,715 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:07:30,715 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:07:30,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1144577720, now seen corresponding path program 1 times [2022-03-15 22:07:30,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:30,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971857088] [2022-03-15 22:07:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:30,757 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:07:30,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:30,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971857088] [2022-03-15 22:07:30,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971857088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:30,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518039381] [2022-03-15 22:07:30,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:30,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:30,761 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:07:30,782 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:07:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:30,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:07:30,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:30,841 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:07:30,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:30,881 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:07:30,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518039381] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:30,881 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:30,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:07:30,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1844637393] [2022-03-15 22:07:30,882 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:30,883 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:30,885 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:07:30,885 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:31,204 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2034#(or (<= N i) (< (+ i 1) N) (< j M)), 2031#(or (<= N i) (<= (+ 2 i) N)), 2030#(or (< (+ j 1) M) (<= M j)), 2029#(< j M), 2033#(or (< (+ j 1) M) (< i N) (<= M j)), 2032#(or (< j M) (< i N))] [2022-03-15 22:07:31,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:07:31,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:31,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:07:31,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:07:31,205 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:31,365 INFO L93 Difference]: Finished difference Result 214 states and 714 transitions. [2022-03-15 22:07:31,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:07:31,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:07:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:31,366 INFO L225 Difference]: With dead ends: 214 [2022-03-15 22:07:31,366 INFO L226 Difference]: Without dead ends: 214 [2022-03-15 22:07:31,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:07:31,367 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:31,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:07:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-03-15 22:07:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 166. [2022-03-15 22:07:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.3333333333333335) internal successors, (550), 165 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:07:31,373 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:07:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:31,373 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:07:31,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:07:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:07:31,374 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:31,374 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:31,405 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:07:31,574 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:07:31,575 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:07:31,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash 529259106, now seen corresponding path program 4 times [2022-03-15 22:07:31,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:31,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429384437] [2022-03-15 22:07:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:31,844 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:07:31,845 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:31,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429384437] [2022-03-15 22:07:31,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429384437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:31,845 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479812714] [2022-03-15 22:07:31,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:07:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:31,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:31,846 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:07:31,847 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:07:31,875 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:07:31,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:31,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:07:31,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:32,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:07:32,258 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:07:32,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:32,539 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:07:32,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 149 [2022-03-15 22:07:33,007 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:07:33,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479812714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:33,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:33,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:07:33,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [270616917] [2022-03-15 22:07:33,008 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:33,009 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:33,012 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:07:33,013 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:37,976 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [2713#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 2697#(or (= min1 min2) (< k N) (< i N)), 2710#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 2699#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 2708#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 2716#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1))), 2715#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 2702#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 2703#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 2696#(or (= min1 min2) (< i N)), 2700#(or (< j M) (= min1 min2)), 2698#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 2712#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< j M) (= k 0)) (or (< j M) (<= (+ k 1) i))), 2705#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 2718#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 2711#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N)))) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (< j M) (= k 0)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N))))), 2704#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 2709#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 2714#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 2719#(and (or (< j M) (= k i)) (or (< j M) (= i min2)) (or (< j M) (= min1 min2)) (or (< j M) (= k 0))), 2701#(or (< j M) (= min1 min2) (< i N)), 2717#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2))), 2706#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)))), 2707#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)))] [2022-03-15 22:07:37,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:07:37,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:07:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:07:37,978 INFO L87 Difference]: Start difference. First operand 166 states and 550 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:45,800 INFO L93 Difference]: Finished difference Result 440 states and 1352 transitions. [2022-03-15 22:07:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 22:07:45,800 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:07:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:45,802 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:07:45,802 INFO L226 Difference]: Without dead ends: 423 [2022-03-15 22:07:45,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3219 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1746, Invalid=8966, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 22:07:45,804 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 499 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:45,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [499 Valid, 0 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:07:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-03-15 22:07:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 211. [2022-03-15 22:07:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.4571428571428573) internal successors, (726), 210 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 726 transitions. [2022-03-15 22:07:45,811 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 726 transitions. Word has length 15 [2022-03-15 22:07:45,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:45,811 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 726 transitions. [2022-03-15 22:07:45,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 726 transitions. [2022-03-15 22:07:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:07:45,812 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:45,812 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:45,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-15 22:07:46,029 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:07:46,029 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:07:46,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 689522916, now seen corresponding path program 5 times [2022-03-15 22:07:46,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:46,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261263420] [2022-03-15 22:07:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:46,084 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:07:46,084 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:46,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261263420] [2022-03-15 22:07:46,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261263420] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:46,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471314268] [2022-03-15 22:07:46,084 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:07:46,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:46,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:46,100 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:07:46,101 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:07:46,123 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:07:46,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:46,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:07:46,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:46,158 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:07:46,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:46,214 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:07:46,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471314268] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:46,214 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:46,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-03-15 22:07:46,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2028819805] [2022-03-15 22:07:46,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:46,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:46,219 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:07:46,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:46,861 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [3811#(or (< j M) (<= N k) (< (+ k 1) N)), 3808#(or (<= N i) (< k N)), 3806#(or (<= (+ N 1) i) (< k N)), 3810#(or (<= N k) (< (+ k 1) N)), 3802#(or (<= N i) (< j M)), 3800#(< j M), 3816#(or (<= k i) (< j M)), 3807#(or (< j M) (<= (+ N 1) i) (< k N)), 3805#(or (< j M) (< k N)), 3793#(or (< j M) (<= k (+ i 1))), 3815#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 3809#(or (<= N i) (< j M) (< k N)), 3813#(or (<= N i) (<= N k) (< (+ k 1) N)), 3814#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 3812#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 3801#(or (< j M) (<= (+ N 1) i)), 3804#(< k N), 3803#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:07:46,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:07:46,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:07:46,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-03-15 22:07:46,862 INFO L87 Difference]: Start difference. First operand 211 states and 726 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:47,773 INFO L93 Difference]: Finished difference Result 396 states and 1263 transitions. [2022-03-15 22:07:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:07:47,774 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:07:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:47,775 INFO L225 Difference]: With dead ends: 396 [2022-03-15 22:07:47,776 INFO L226 Difference]: Without dead ends: 390 [2022-03-15 22:07:47,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=962, Invalid=3460, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:07:47,777 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 241 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:47,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 0 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:07:47,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-03-15 22:07:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 243. [2022-03-15 22:07:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 3.4710743801652892) internal successors, (840), 242 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 840 transitions. [2022-03-15 22:07:47,783 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 840 transitions. Word has length 15 [2022-03-15 22:07:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:47,783 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 840 transitions. [2022-03-15 22:07:47,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 840 transitions. [2022-03-15 22:07:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:07:47,784 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:47,784 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:47,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 22:07:47,994 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:07:47,994 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:07:47,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:47,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1869207442, now seen corresponding path program 2 times [2022-03-15 22:07:47,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:47,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879039898] [2022-03-15 22:07:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:47,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:48,136 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:07:48,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:48,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879039898] [2022-03-15 22:07:48,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879039898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:48,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847946246] [2022-03-15 22:07:48,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:07:48,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:48,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:48,137 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:07:48,142 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:07:48,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:07:48,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:48,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:07:48,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:48,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:07:48,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:07:48,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:07:48,620 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:07:48,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:49,014 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:07:49,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 161 [2022-03-15 22:07:51,389 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:07:51,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847946246] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:51,389 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:51,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 22:07:51,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [915208263] [2022-03-15 22:07:51,389 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:51,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:51,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:07:51,393 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:54,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [4887#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< i N))), 4881#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 4877#(or (< j M) (= min1 min2)), 4888#(and (or (< j M) (not (= k i)) (= min1 min2)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 4882#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 4886#(and (or (< j M) (= min1 min2) (<= (+ i 1) N) (<= (+ (select A k) 1) min2)) (or (< j M) (<= min2 (select A k)) (<= (+ i 1) N) (= min1 (select A k)))), 4889#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 4884#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2))), 4885#(and (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (<= (select A j) (select A k)))), 4879#(or (< j M) (= min1 min2) (< i N)), 4880#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 4878#(or (= min1 min2) (< i N)), 4883#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1)))] [2022-03-15 22:07:54,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:07:54,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:07:54,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:07:54,202 INFO L87 Difference]: Start difference. First operand 243 states and 840 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:58,653 INFO L93 Difference]: Finished difference Result 710 states and 2042 transitions. [2022-03-15 22:07:58,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:07:58,654 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:07:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:58,657 INFO L225 Difference]: With dead ends: 710 [2022-03-15 22:07:58,657 INFO L226 Difference]: Without dead ends: 689 [2022-03-15 22:07:58,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=825, Invalid=5027, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:07:58,658 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 251 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:58,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 0 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:07:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-03-15 22:07:58,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 244. [2022-03-15 22:07:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.4979423868312756) internal successors, (850), 243 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:58,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 850 transitions. [2022-03-15 22:07:58,666 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 850 transitions. Word has length 15 [2022-03-15 22:07:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:58,666 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 850 transitions. [2022-03-15 22:07:58,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 850 transitions. [2022-03-15 22:07:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:07:58,667 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:58,667 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:58,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-15 22:07:58,883 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:07:58,884 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:07:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:07:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -764809232, now seen corresponding path program 3 times [2022-03-15 22:07:58,885 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:07:58,885 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266010128] [2022-03-15 22:07:58,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:07:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:07:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:07:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:07:58,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:07:58,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266010128] [2022-03-15 22:07:58,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266010128] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:07:58,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765712441] [2022-03-15 22:07:58,934 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:07:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:07:58,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:07:58,935 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:07:58,937 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:07:58,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:07:58,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:07:58,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:07:58,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:07:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 22:07:59,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:07:59,058 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:07:59,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765712441] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:07:59,059 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:07:59,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-03-15 22:07:59,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952091121] [2022-03-15 22:07:59,059 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:07:59,060 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:07:59,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 103 transitions. [2022-03-15 22:07:59,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:07:59,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6206#(< i N), 6276#(or (< (+ j 1) M) (<= M j)), 6282#(or (< (+ 2 j) M) (<= M (+ j 1))), 6281#(or (<= N i) (<= (+ 2 M i) (+ N j))), 6275#(< j M), 6278#(or (< j M) (< i N)), 6279#(or (<= N i) (< (+ i 1) N) (< j M)), 6280#(or (<= (+ 3 i) N) (<= N i)), 6277#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:07:59,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:07:59,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:07:59,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:07:59,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:07:59,395 INFO L87 Difference]: Start difference. First operand 244 states and 850 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:07:59,828 INFO L93 Difference]: Finished difference Result 560 states and 1826 transitions. [2022-03-15 22:07:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:07:59,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:07:59,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:07:59,831 INFO L225 Difference]: With dead ends: 560 [2022-03-15 22:07:59,831 INFO L226 Difference]: Without dead ends: 560 [2022-03-15 22:07:59,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=1062, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:07:59,832 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:07:59,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:07:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-03-15 22:07:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 349. [2022-03-15 22:07:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.5804597701149423) internal successors, (1246), 348 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1246 transitions. [2022-03-15 22:07:59,841 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 1246 transitions. Word has length 15 [2022-03-15 22:07:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:07:59,843 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 1246 transitions. [2022-03-15 22:07:59,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:07:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 1246 transitions. [2022-03-15 22:07:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:07:59,844 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:07:59,844 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:07:59,864 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:08:00,064 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:08:00,064 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:08:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash -519709146, now seen corresponding path program 4 times [2022-03-15 22:08:00,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:00,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729290984] [2022-03-15 22:08:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:00,304 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:08:00,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:00,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729290984] [2022-03-15 22:08:00,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729290984] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:00,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931689510] [2022-03-15 22:08:00,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:08:00,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:00,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:00,306 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:08:00,306 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:08:00,328 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:08:00,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:00,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:08:00,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:00,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:08:00,781 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:00,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:08:00,888 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:08:00,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:01,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:01,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:08:01,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:08:01,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 143 [2022-03-15 22:08:01,567 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:08:01,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931689510] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:01,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:01,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:08:01,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856808950] [2022-03-15 22:08:01,568 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:01,569 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:01,572 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:08:01,572 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:03,873 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7682#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 7691#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (< k N) (<= min2 (select A j))) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 7680#(or (= min1 min2) (< i N)), 7684#(or (= min1 min2) (< k N) (< i N)), 7683#(or (= min1 min2) (< k N)), 7688#(and (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= min2 (select A j))) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (select A i) min1))), 7686#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 7681#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 7687#(and (or (<= min2 (select A j)) (< i N) (= (select A j) min1)) (or (<= (+ (select A j) 1) min2) (= min1 min2) (< i N))), 7685#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 7692#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A j) (select A (+ i 1))) (< k N) (< (select A i) min1) (<= min2 (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= (select A j) (select A (+ i 1))) (< k N) (<= min2 (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A i) (select A j)) (< k N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 7690#(and (or (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< i N)) (or (<= (+ k 1) N) (<= min2 (select A j)) (< i N) (= (select A j) min1))), 7689#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A i) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (<= min2 (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= (select A j) (select A (+ i 1))) (<= min2 (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))))] [2022-03-15 22:08:03,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:08:03,873 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:08:03,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:08:03,874 INFO L87 Difference]: Start difference. First operand 349 states and 1246 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:07,638 INFO L93 Difference]: Finished difference Result 731 states and 2341 transitions. [2022-03-15 22:08:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:08:07,638 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:08:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:07,642 INFO L225 Difference]: With dead ends: 731 [2022-03-15 22:08:07,642 INFO L226 Difference]: Without dead ends: 723 [2022-03-15 22:08:07,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=962, Invalid=4294, Unknown=0, NotChecked=0, Total=5256 [2022-03-15 22:08:07,643 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 393 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:07,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 0 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:08:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-03-15 22:08:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 358. [2022-03-15 22:08:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.5910364145658265) internal successors, (1282), 357 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1282 transitions. [2022-03-15 22:08:07,662 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1282 transitions. Word has length 15 [2022-03-15 22:08:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:07,662 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 1282 transitions. [2022-03-15 22:08:07,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1282 transitions. [2022-03-15 22:08:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:07,663 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:07,663 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:07,681 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:08:07,863 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:08:07,864 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:08:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:07,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1842155728, now seen corresponding path program 6 times [2022-03-15 22:08:07,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:07,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767769139] [2022-03-15 22:08:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:07,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:07,920 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:08:07,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:07,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767769139] [2022-03-15 22:08:07,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767769139] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:07,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955912953] [2022-03-15 22:08:07,921 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:08:07,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:07,922 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:08:07,944 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:08:07,965 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:08:07,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:07,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:08:07,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:08,004 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:08:08,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:08,044 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:08:08,044 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955912953] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:08,044 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:08,044 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:08:08,044 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696780596] [2022-03-15 22:08:08,044 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:08,046 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:08,050 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:08:08,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:08,787 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [9344#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9331#(or (< j M) (< i N)), 9354#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9333#(or (<= N i) (< (+ i 1) N)), 9328#(or (< k N) (< i N)), 9337#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9336#(or (<= N (+ i 1)) (< (+ 2 i) N)), 9352#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9356#(or (< j M) (<= (+ k 1) i)), 9355#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 9351#(or (<= (+ 2 k) i) (< j M)), 9350#(or (<= (+ 3 k) N) (< j M)), 9320#(or (<= k i) (< j M)), 9330#(or (<= (+ k 1) N) (< j M)), 9340#(or (<= (+ 2 k) N) (< j M)), 9334#(or (<= N i) (< (+ i 1) N) (< j M)), 9345#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 9348#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9349#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 9332#(or (< j M) (< k N) (< i N)), 9353#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 9327#(< i N), 9343#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 9342#(or (<= (+ 2 k) N) (< j M) (< i N)), 9335#(or (<= N i) (< (+ i 1) N) (< k N)), 9347#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9339#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9329#(< j M), 9341#(or (<= (+ 2 k) N) (< i N)), 9338#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9346#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N))] [2022-03-15 22:08:08,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:08:08,787 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:08:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:08:08,788 INFO L87 Difference]: Start difference. First operand 358 states and 1282 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:10,138 INFO L93 Difference]: Finished difference Result 661 states and 2214 transitions. [2022-03-15 22:08:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:08:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:10,142 INFO L225 Difference]: With dead ends: 661 [2022-03-15 22:08:10,142 INFO L226 Difference]: Without dead ends: 661 [2022-03-15 22:08:10,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2472, Invalid=9518, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:08:10,145 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 418 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:10,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 0 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:08:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-03-15 22:08:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 411. [2022-03-15 22:08:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.624390243902439) internal successors, (1486), 410 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1486 transitions. [2022-03-15 22:08:10,156 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1486 transitions. Word has length 16 [2022-03-15 22:08:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:10,157 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 1486 transitions. [2022-03-15 22:08:10,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:10,157 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1486 transitions. [2022-03-15 22:08:10,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:10,158 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:10,158 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:10,177 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:08:10,371 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:08:10,371 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:08:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash -772947566, now seen corresponding path program 7 times [2022-03-15 22:08:10,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:10,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879381725] [2022-03-15 22:08:10,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:10,413 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:08:10,413 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:10,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879381725] [2022-03-15 22:08:10,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879381725] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:10,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840522905] [2022-03-15 22:08:10,414 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:08:10,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:10,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:10,415 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:08:10,422 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:08:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:10,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:08:10,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:10,548 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:08:10,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:10,577 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:08:10,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840522905] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:10,578 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:10,578 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:08:10,578 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410893889] [2022-03-15 22:08:10,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:10,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:10,583 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:08:10,583 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:11,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11085#(or (<= N (+ k 1)) (< i N)), 11091#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 11087#(or (<= N i) (< (+ i 1) N) (<= N k)), 11090#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 11086#(or (<= N i) (< (+ i 1) N)), 11084#(or (<= N k) (< i N)), 11089#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 11088#(or (<= N (+ i 1)) (< (+ 2 i) N)), 11083#(< i N)] [2022-03-15 22:08:11,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:08:11,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:08:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:08:11,014 INFO L87 Difference]: Start difference. First operand 411 states and 1486 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:11,543 INFO L93 Difference]: Finished difference Result 1132 states and 4011 transitions. [2022-03-15 22:08:11,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:08:11,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:11,557 INFO L225 Difference]: With dead ends: 1132 [2022-03-15 22:08:11,557 INFO L226 Difference]: Without dead ends: 1110 [2022-03-15 22:08:11,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=944, Invalid=2716, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:08:11,558 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 298 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:11,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 0 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:08:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-03-15 22:08:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 554. [2022-03-15 22:08:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.678119349005425) internal successors, (2034), 553 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:11,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 2034 transitions. [2022-03-15 22:08:11,590 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 2034 transitions. Word has length 16 [2022-03-15 22:08:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:11,591 INFO L470 AbstractCegarLoop]: Abstraction has 554 states and 2034 transitions. [2022-03-15 22:08:11,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:11,591 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 2034 transitions. [2022-03-15 22:08:11,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:11,592 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:11,592 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:11,609 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:08:11,807 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:08:11,807 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:08:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2110966522, now seen corresponding path program 5 times [2022-03-15 22:08:11,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:11,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121400535] [2022-03-15 22:08:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:11,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:11,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121400535] [2022-03-15 22:08:11,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121400535] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:11,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146143619] [2022-03-15 22:08:11,853 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:08:11,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:11,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:11,854 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:08:11,855 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:08:11,876 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:08:11,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:11,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:08:11,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:11,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:11,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146143619] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:11,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:11,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:08:11,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1713137596] [2022-03-15 22:08:11,967 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:11,968 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:11,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:08:11,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:12,695 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [13522#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 13507#(or (<= N k) (< i N)), 13506#(< i N), 13520#(or (<= N i) (< (+ i 1) N) (< j M)), 13515#(or (< j M) (< i N)), 13518#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 13510#(or (<= N (+ i 1)) (< (+ 2 i) N)), 13525#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 13523#(or (< j M) (<= i k)), 13511#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 13517#(or (< j M) (<= i (+ k 1))), 13513#(or (< j M) (<= N k)), 13508#(or (<= N i) (< (+ i 1) N)), 13512#(< j M), 13516#(or (< j M) (<= N k) (< i N)), 13521#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 13524#(or (< (+ j 1) M) (<= i k) (<= M j)), 13519#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 13509#(or (<= N i) (< (+ i 1) N) (<= N k)), 13514#(or (<= N (+ k 1)) (< j M))] [2022-03-15 22:08:12,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:08:12,695 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:12,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:08:12,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:08:12,696 INFO L87 Difference]: Start difference. First operand 554 states and 2034 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:14,573 INFO L93 Difference]: Finished difference Result 1411 states and 4886 transitions. [2022-03-15 22:08:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-15 22:08:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:14,579 INFO L225 Difference]: With dead ends: 1411 [2022-03-15 22:08:14,579 INFO L226 Difference]: Without dead ends: 1397 [2022-03-15 22:08:14,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4040 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2856, Invalid=10254, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 22:08:14,582 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 371 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:14,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:08:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-03-15 22:08:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 723. [2022-03-15 22:08:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 722 states have (on average 3.9265927977839334) internal successors, (2835), 722 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 2835 transitions. [2022-03-15 22:08:14,605 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 2835 transitions. Word has length 16 [2022-03-15 22:08:14,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:14,605 INFO L470 AbstractCegarLoop]: Abstraction has 723 states and 2835 transitions. [2022-03-15 22:08:14,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 2835 transitions. [2022-03-15 22:08:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:14,607 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:14,607 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:14,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-15 22:08:14,830 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:08:14,832 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:08:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash -687661098, now seen corresponding path program 6 times [2022-03-15 22:08:14,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:14,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127949337] [2022-03-15 22:08:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:14,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:14,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127949337] [2022-03-15 22:08:14,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127949337] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:14,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216471914] [2022-03-15 22:08:14,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:08:14,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:14,904 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:08:14,905 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:08:14,926 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:08:14,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:14,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:08:14,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:14,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:15,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216471914] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:15,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:15,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:08:15,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2058642690] [2022-03-15 22:08:15,057 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:15,058 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:15,062 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:08:15,062 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:15,745 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16659#(< i N), 16680#(or (<= (+ k j) (+ M i 1)) (<= N i)), 16663#(or (<= (+ 2 k) N) (< j M)), 16679#(or (<= N i) (<= k (+ i 1))), 16657#(< j M), 16665#(or (<= N i) (< (+ i 1) N)), 16669#(or (< j M) (<= (+ k 1) i)), 16670#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 16666#(or (<= N i) (< (+ i 1) N) (< j M)), 16674#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 16661#(or (< k N) (< i N)), 16662#(or (< j M) (< k N) (< i N)), 16668#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 16676#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16672#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16673#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 16678#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 16671#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16658#(or (<= (+ k 1) N) (< j M)), 16667#(or (<= N i) (< (+ i 1) N) (< k N)), 16677#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 16664#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 16660#(or (< j M) (< i N)), 16675#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 22:08:15,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:08:15,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:08:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:08:15,746 INFO L87 Difference]: Start difference. First operand 723 states and 2835 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:19,414 INFO L93 Difference]: Finished difference Result 2149 states and 7120 transitions. [2022-03-15 22:08:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:08:19,414 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:19,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:19,423 INFO L225 Difference]: With dead ends: 2149 [2022-03-15 22:08:19,423 INFO L226 Difference]: Without dead ends: 2148 [2022-03-15 22:08:19,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11785 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5679, Invalid=27993, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:08:19,426 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 532 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:19,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 0 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:08:19,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2022-03-15 22:08:19,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 988. [2022-03-15 22:08:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 4.053698074974671) internal successors, (4001), 987 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 4001 transitions. [2022-03-15 22:08:19,456 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 4001 transitions. Word has length 16 [2022-03-15 22:08:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:19,458 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 4001 transitions. [2022-03-15 22:08:19,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 4001 transitions. [2022-03-15 22:08:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:19,461 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:19,461 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:19,479 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:08:19,677 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:08:19,677 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:08:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash 416737112, now seen corresponding path program 7 times [2022-03-15 22:08:19,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:19,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515213056] [2022-03-15 22:08:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:19,705 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:08:19,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:19,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515213056] [2022-03-15 22:08:19,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515213056] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:19,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073110765] [2022-03-15 22:08:19,705 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:08:19,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:19,720 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:08:19,734 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:08:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:19,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:08:19,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:19,809 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:08:19,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:19,854 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:08:19,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073110765] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:19,854 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:19,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 22:08:19,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1062023441] [2022-03-15 22:08:19,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:19,857 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:19,862 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:08:19,862 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:20,195 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [21202#(or (<= N i) (<= (+ 2 i) N)), 21209#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M)), 21207#(or (< (+ 2 j) M) (<= M (+ j 1))), 21201#(< j M), 21210#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 21206#(or (< (+ j 1) M) (<= M j)), 21205#(or (<= N i) (<= (+ M i 1) (+ N j))), 21208#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 21204#(or (<= N i) (< (+ i 1) N) (< j M)), 21203#(or (< j M) (< i N))] [2022-03-15 22:08:20,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:08:20,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:20,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:08:20,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:08:20,197 INFO L87 Difference]: Start difference. First operand 988 states and 4001 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:20,766 INFO L93 Difference]: Finished difference Result 2796 states and 10220 transitions. [2022-03-15 22:08:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:08:20,766 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:20,787 INFO L225 Difference]: With dead ends: 2796 [2022-03-15 22:08:20,787 INFO L226 Difference]: Without dead ends: 2796 [2022-03-15 22:08:20,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:08:20,789 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:20,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:08:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2022-03-15 22:08:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 1188. [2022-03-15 22:08:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1187 states have (on average 4.176916596461668) internal successors, (4958), 1187 states have internal predecessors, (4958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 4958 transitions. [2022-03-15 22:08:20,856 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 4958 transitions. Word has length 16 [2022-03-15 22:08:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:20,856 INFO L470 AbstractCegarLoop]: Abstraction has 1188 states and 4958 transitions. [2022-03-15 22:08:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 4958 transitions. [2022-03-15 22:08:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:20,859 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:20,859 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:20,888 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:08:21,075 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:08:21,075 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:08:21,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash 661837198, now seen corresponding path program 8 times [2022-03-15 22:08:21,076 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:21,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563075156] [2022-03-15 22:08:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:21,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:21,125 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:21,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563075156] [2022-03-15 22:08:21,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563075156] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:21,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209520070] [2022-03-15 22:08:21,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:08:21,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:21,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:21,126 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:08:21,127 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:08:21,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:08:21,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:21,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:08:21,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:21,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:21,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:21,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:21,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209520070] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:21,310 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:21,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:08:21,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395248214] [2022-03-15 22:08:21,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:21,311 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:21,315 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:08:21,315 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:21,905 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [26550#(or (<= N (+ i 1)) (< (+ 2 i) N)), 26559#(or (<= (+ 2 j) M) (< i N)), 26565#(or (< k N) (<= (+ j 1) M)), 26560#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 26555#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 26567#(or (<= (+ 2 k j) (+ N M)) (< i N)), 26571#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 26552#(or (< k N) (< i N)), 26553#(or (<= N i) (< (+ i 1) N) (< k N)), 26554#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 26558#(or (<= N i) (< (+ i 1) N) (< j M)), 26570#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 26564#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N)), 26549#(or (<= N i) (< (+ i 1) N)), 26561#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 26572#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 26566#(or (< j M) (< k N) (< i N)), 26569#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 26551#(< k N), 26568#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 26557#(or (<= (+ j 1) M) (< i N)), 26563#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 26573#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 26556#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 26562#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 26548#(< i N)] [2022-03-15 22:08:21,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:08:21,905 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:08:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:08:21,906 INFO L87 Difference]: Start difference. First operand 1188 states and 4958 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:24,194 INFO L93 Difference]: Finished difference Result 2178 states and 8067 transitions. [2022-03-15 22:08:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:08:24,194 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:24,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:24,203 INFO L225 Difference]: With dead ends: 2178 [2022-03-15 22:08:24,203 INFO L226 Difference]: Without dead ends: 2178 [2022-03-15 22:08:24,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7421 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4412, Invalid=19768, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:08:24,205 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:24,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:08:24,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2022-03-15 22:08:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1361. [2022-03-15 22:08:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1360 states have (on average 4.268382352941177) internal successors, (5805), 1360 states have internal predecessors, (5805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 5805 transitions. [2022-03-15 22:08:24,237 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 5805 transitions. Word has length 16 [2022-03-15 22:08:24,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:24,237 INFO L470 AbstractCegarLoop]: Abstraction has 1361 states and 5805 transitions. [2022-03-15 22:08:24,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 5805 transitions. [2022-03-15 22:08:24,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:24,244 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:24,245 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:24,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-15 22:08:24,455 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:08:24,455 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:08:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1488485624, now seen corresponding path program 9 times [2022-03-15 22:08:24,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:24,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939577473] [2022-03-15 22:08:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:24,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:24,500 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:08:24,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:24,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939577473] [2022-03-15 22:08:24,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939577473] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:24,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624091307] [2022-03-15 22:08:24,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:08:24,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:24,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:24,502 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:08:24,503 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:08:24,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:08:24,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:24,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:08:24,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:24,591 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:08:24,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:24,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:24,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624091307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:24,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:24,641 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:08:24,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [602318765] [2022-03-15 22:08:24,641 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:24,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:24,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:08:24,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:25,049 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31805#(< i N), 31807#(or (<= N k) (< i N)), 31808#(or (<= (+ N M) (+ k j 1)) (< i N)), 31804#(< j M), 31816#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 31810#(or (<= N i) (< (+ i 1) N) (< j M)), 31813#(or (<= N i) (< (+ i 1) N) (<= N k)), 31811#(or (<= N (+ i 1)) (< (+ 2 i) N)), 31806#(or (< j M) (< i N)), 31814#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 31815#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 31809#(or (<= N i) (< (+ i 1) N)), 31812#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M))] [2022-03-15 22:08:25,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:08:25,049 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:25,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:08:25,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:08:25,049 INFO L87 Difference]: Start difference. First operand 1361 states and 5805 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:26,383 INFO L93 Difference]: Finished difference Result 4245 states and 17123 transitions. [2022-03-15 22:08:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:08:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:26,410 INFO L225 Difference]: With dead ends: 4245 [2022-03-15 22:08:26,410 INFO L226 Difference]: Without dead ends: 4190 [2022-03-15 22:08:26,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2286 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:08:26,414 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:26,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:08:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2022-03-15 22:08:26,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2019. [2022-03-15 22:08:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 4.581268582755203) internal successors, (9245), 2018 states have internal predecessors, (9245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 9245 transitions. [2022-03-15 22:08:26,505 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 9245 transitions. Word has length 16 [2022-03-15 22:08:26,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:26,505 INFO L470 AbstractCegarLoop]: Abstraction has 2019 states and 9245 transitions. [2022-03-15 22:08:26,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 9245 transitions. [2022-03-15 22:08:26,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:08:26,510 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:26,510 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:26,541 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:08:26,725 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:08:26,725 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:08:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:26,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2034886336, now seen corresponding path program 10 times [2022-03-15 22:08:26,726 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:26,726 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980307698] [2022-03-15 22:08:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:26,772 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:08:26,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:26,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980307698] [2022-03-15 22:08:26,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980307698] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:26,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787634117] [2022-03-15 22:08:26,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:08:26,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:26,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:26,783 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:08:26,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-15 22:08:26,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:08:26,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:26,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:08:26,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:26,864 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:08:26,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:08:26,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787634117] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:26,926 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:26,926 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:08:26,926 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [197819643] [2022-03-15 22:08:26,926 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:26,928 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:26,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:08:26,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:08:27,228 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [40324#(< i N), 40329#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 40328#(or (<= N (+ i 1)) (< (+ 2 i) N)), 40335#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 40336#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 40330#(< k N), 40334#(or (<= (+ N M) (+ k j 1)) (< i N)), 40331#(or (< k N) (< i N)), 40332#(or (<= N i) (< (+ i 1) N) (< k N)), 40325#(or (<= N i) (< (+ i 1) N)), 40326#(or (< i N) (<= M j)), 40333#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 40327#(or (<= N i) (< (+ i 1) N) (<= M j))] [2022-03-15 22:08:27,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:08:27,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:08:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:08:27,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:08:27,229 INFO L87 Difference]: Start difference. First operand 2019 states and 9245 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:08:28,530 INFO L93 Difference]: Finished difference Result 4152 states and 16909 transitions. [2022-03-15 22:08:28,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:08:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:08:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:08:28,545 INFO L225 Difference]: With dead ends: 4152 [2022-03-15 22:08:28,545 INFO L226 Difference]: Without dead ends: 4093 [2022-03-15 22:08:28,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2783, Invalid=11259, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:08:28,548 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 331 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:08:28,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:08:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-03-15 22:08:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 2154. [2022-03-15 22:08:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2153 states have (on average 4.626103111936833) internal successors, (9960), 2153 states have internal predecessors, (9960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 9960 transitions. [2022-03-15 22:08:28,604 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 9960 transitions. Word has length 16 [2022-03-15 22:08:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:08:28,604 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 9960 transitions. [2022-03-15 22:08:28,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:08:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 9960 transitions. [2022-03-15 22:08:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:08:28,609 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:08:28,609 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:08:28,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:08:28,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:28,826 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:08:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:08:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1272142052, now seen corresponding path program 8 times [2022-03-15 22:08:28,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:08:28,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406795701] [2022-03-15 22:08:28,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:08:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:08:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:08:29,398 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:08:29,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:08:29,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406795701] [2022-03-15 22:08:29,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406795701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:08:29,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916118476] [2022-03-15 22:08:29,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:08:29,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:08:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:08:29,400 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:08:29,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-15 22:08:29,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:08:29,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:08:29,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:08:29,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:08:29,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:08:30,135 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:08:30,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:08:31,229 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:08:31,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 967 treesize of output 509 [2022-03-15 22:08:42,361 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:08:42,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916118476] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:08:42,361 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:08:42,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:08:42,362 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [85547569] [2022-03-15 22:08:42,362 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:08:42,364 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:08:42,369 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:08:42,369 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:09:00,561 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [49109#(and (or (<= N (+ 2 i)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (not (< (select A i) min1)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1))), 49105#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 49124#(and (or (<= N (+ 2 i)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (not (< (select A i) min1)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 49118#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1))), 49111#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 49120#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 49099#(or (= min1 min2) (< i N)), 49098#(and (or (< j M) (= k 0) (< (+ 3 k) N)) (or (<= min2 (select A (+ (- 2) N))) (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= (+ (select A k) 1) min2) (< (+ 3 k) N) (= (select A (+ (- 2) N)) min1)) (or (< j M) (<= (+ (select A (+ (- 2) N)) 1) min2) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< (+ 3 k) N) (<= min2 (select A (+ (- 1) N)))) (or (<= (+ 3 k) N) (< j M)) (or (<= (+ (select A (+ (- 2) N)) 1) (select A k)) (< j M) (<= (select A k) (select A (+ (- 1) N))) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (< (+ 3 k) N)) (or (<= min2 (select A (+ (- 2) N))) (< j M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< (+ 3 k) N)) (or (< j M) (<= (select A (+ (- 2) N)) (select A (+ (- 1) N))) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (<= (select A k) (select A (+ (- 2) N))) (< (+ 3 k) N)) (or (< j M) (= min1 min2) (<= (+ (select A (+ (- 2) N)) 1) min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2) (< (+ 3 k) N)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (<= (+ (select A (+ (- 2) N)) 1) (select A k)) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (+ 3 k) N)) (or (< j M) (<= (+ (select A (+ (- 1) N)) 1) (select A (+ (- 2) N))) (<= min2 (select A k)) (<= (select A k) (select A (+ (- 2) N))) (< (+ 3 k) N) (= (select A (+ (- 2) N)) min1))), 49126#(and (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N)) (or (not (< (+ i 1) N)) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 i) N) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2))), 49132#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (select A k) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) min1) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)) (or (<= min1 (select A (+ 2 i))) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (select A k) min2) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (< (select A (+ 2 i)) min1))), 49107#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 49129#(and (or (< j M) (<= min2 min1) (<= (+ (select A k) 1) min2)) (or (< j M) (= k 0)) (or (< j M) (<= min2 (select A k)) (<= (select A k) min1)) (or (< j M) (<= min1 min2)) (or (< j M) (<= min1 (select A k))) (or (< j M) (<= (+ k 1) i))), 49116#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 49095#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 49122#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A i) min1) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (< (+ i 1) N) (< j M) (<= (select A k) (select A (+ (- 1) N))) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (= min1 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (= (select A i) (select A k)))), 49117#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 49103#(or (< j M) (= min1 min2) (< i N)), 49106#(and (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< i N) (<= min2 (select A (+ (- 1) N)))) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2) (< i N)) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (< i N)) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 49096#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)))), 49119#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 49131#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1))), 49101#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N))), 49102#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (< i N)) (or (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2) (< i N)) (or (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))) (< i N)) (or (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (< i N) (<= min2 (select A (+ (- 1) N))))), 49128#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (< (+ 2 k) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (not (< (+ i 1) N)) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N))))), 49110#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 49094#(or (< j M) (= min1 min2)), 49112#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 49133#(and (or (< j M) (= k i)) (or (< j M) (= i min1)) (or (< j M) (= min1 min2)) (or (< j M) (= k 0))), 49115#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 49121#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A i) min1) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (= (select A i) (select A k))) (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (< (+ i 1) N) (<= (select A k) (select A (+ (- 1) N))) (not (< i N)) (< (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (= min1 (select A (+ (- 1) N)))) (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A (+ (- 1) N)) 1) min2) (= (select A i) min2))), 49125#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1))), 49123#(and (or (< j M) (= k 0) (< (+ 2 k) i)) (or (< j M) (< (+ 2 k) i) (<= min1 (select A k))) (or (< j M) (<= (select A k) (select A (+ (- 1) i))) (<= min2 (select A k)) (< (+ 2 k) i) (= (select A (+ (- 1) i)) min1)) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (<= (+ (select A (+ (- 1) i)) 1) min2) (= min1 min2) (<= (+ (select A k) 1) min2) (< (+ 2 k) i)) (or (< j M) (<= (+ (select A k) 1) min2) (< (+ 2 k) i) (= (select A (+ (- 1) i)) min1) (<= min2 (select A (+ (- 1) i)))) (or (< j M) (<= (+ (select A (+ (- 1) i)) 1) (select A k)) (<= min2 (select A k)) (< (+ 2 k) i) (<= (select A k) min1))), 49100#(or (= min1 min2) (< k N) (< i N)), 49113#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2))), 49108#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 49114#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 49104#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 49127#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= min1 (select A (+ 2 i))) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= (select A (+ k 1)) min1) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (< (select A (+ 2 i)) min1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (select A k) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ (select A (+ k 1)) 1) min2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (select A k) min2) (< (+ 3 i) N) (<= (+ (select A (+ k 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= min2 (select A (+ k 1))) (< (select A k) min2) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A k) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (+ (select A (+ k 1)) 1) min2) (<= min1 (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= (select A (+ k 1)) min1) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) min1) (<= (select A k) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (<= (+ (select A (+ k 1)) 1) (select A k)) (< (select A (+ i 1)) (select A i)))), 49130#(and (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 49097#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A (+ (- 1) N)))) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) min2) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))))] [2022-03-15 22:09:00,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:09:00,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:09:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:09:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=3636, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:09:00,562 INFO L87 Difference]: Start difference. First operand 2154 states and 9960 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:09:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:09:49,980 INFO L93 Difference]: Finished difference Result 3049 states and 12890 transitions. [2022-03-15 22:09:49,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2022-03-15 22:09:49,981 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:09:49,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:09:50,019 INFO L225 Difference]: With dead ends: 3049 [2022-03-15 22:09:50,019 INFO L226 Difference]: Without dead ends: 3004 [2022-03-15 22:09:50,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 33 SyntacticMatches, 11 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18323 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=7348, Invalid=43954, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 22:09:50,022 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 914 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:09:50,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 0 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-03-15 22:09:50,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-03-15 22:09:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2258. [2022-03-15 22:09:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2258 states, 2257 states have (on average 4.609658839167036) internal successors, (10404), 2257 states have internal predecessors, (10404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:09:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 10404 transitions. [2022-03-15 22:09:50,087 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 10404 transitions. Word has length 17 [2022-03-15 22:09:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:09:50,088 INFO L470 AbstractCegarLoop]: Abstraction has 2258 states and 10404 transitions. [2022-03-15 22:09:50,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:09:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 10404 transitions. [2022-03-15 22:09:50,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:09:50,093 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:09:50,093 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:09:50,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-15 22:09:50,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:09:50,310 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:09:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:09:50,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2114457254, now seen corresponding path program 9 times [2022-03-15 22:09:50,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:09:50,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697313303] [2022-03-15 22:09:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:09:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:09:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:09:50,356 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:09:50,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:09:50,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697313303] [2022-03-15 22:09:50,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697313303] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:09:50,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590311282] [2022-03-15 22:09:50,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:09:50,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:09:50,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:09:50,357 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:09:50,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-15 22:09:50,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:09:50,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:09:50,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:09:50,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:09:50,421 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:09:50,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:09:50,476 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:09:50,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590311282] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:09:50,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:09:50,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-15 22:09:50,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1890125721] [2022-03-15 22:09:50,476 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:09:50,477 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:09:50,482 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:09:50,482 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:09:51,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [57156#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 57158#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 57147#(or (<= N i) (< j M)), 57161#(or (< j M) (<= k (+ 2 i))), 57142#(or (< j M) (< k N)), 57139#(or (<= N i) (<= N k) (< (+ k 1) N)), 57149#(or (<= N (+ 2 i)) (< j M)), 57143#(or (< j M) (<= N k) (< (+ k 1) N)), 57155#(or (<= N i) (< j M) (< k N)), 57134#(or (<= (+ N 1) i) (< k N)), 57138#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 57140#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 57153#(or (< j M) (<= (+ N 1) i) (< k N)), 57126#(or (< j M) (<= k (+ i 1))), 57163#(or (<= k i) (< j M)), 57157#(or (<= N (+ i 1)) (< j M) (< k N)), 57159#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 57137#(or (<= N k) (< (+ k 1) N)), 57154#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 57141#(< j M), 57146#(or (< j M) (<= (+ N 1) i)), 57144#(or (<= N (+ k 1)) (< (+ 2 k) N)), 57150#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 57151#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 57136#(or (<= N (+ i 1)) (< k N)), 57162#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 57145#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 57160#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 57133#(< k N), 57152#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 57135#(or (<= N i) (< k N)), 57148#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:09:51,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:09:51,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:09:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:09:51,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:09:51,644 INFO L87 Difference]: Start difference. First operand 2258 states and 10404 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:09:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:09:53,597 INFO L93 Difference]: Finished difference Result 3018 states and 13042 transitions. [2022-03-15 22:09:53,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:09:53,597 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:09:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:09:53,626 INFO L225 Difference]: With dead ends: 3018 [2022-03-15 22:09:53,627 INFO L226 Difference]: Without dead ends: 3004 [2022-03-15 22:09:53,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3590 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3071, Invalid=11209, Unknown=0, NotChecked=0, Total=14280 [2022-03-15 22:09:53,629 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 404 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:09:53,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 0 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:09:53,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-03-15 22:09:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 2359. [2022-03-15 22:09:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2359 states, 2358 states have (on average 4.592027141645462) internal successors, (10828), 2358 states have internal predecessors, (10828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:09:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 10828 transitions. [2022-03-15 22:09:53,683 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 10828 transitions. Word has length 17 [2022-03-15 22:09:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:09:53,683 INFO L470 AbstractCegarLoop]: Abstraction has 2359 states and 10828 transitions. [2022-03-15 22:09:53,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:09:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 10828 transitions. [2022-03-15 22:09:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:09:53,688 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:09:53,688 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:09:53,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-15 22:09:53,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:09:53,917 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:09:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:09:53,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2888034, now seen corresponding path program 11 times [2022-03-15 22:09:53,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:09:53,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295921012] [2022-03-15 22:09:53,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:09:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:09:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:09:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:09:54,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:09:54,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295921012] [2022-03-15 22:09:54,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295921012] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:09:54,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686337665] [2022-03-15 22:09:54,160 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:09:54,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:09:54,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:09:54,161 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:09:54,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-15 22:09:54,186 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:09:54,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:09:54,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:09:54,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:09:54,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:09:54,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:09:54,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:09:54,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:09:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:09:55,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:09:56,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:09:56,350 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:09:56,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 887 treesize of output 527 [2022-03-15 22:10:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:53,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686337665] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:10:53,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:10:53,273 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 22:10:53,273 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173797845] [2022-03-15 22:10:53,273 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:10:53,274 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:10:53,279 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:10:53,279 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:03,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [65179#(and (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j)))) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j)))) (or (not (< (+ j 1) M)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (< (select A (+ j 1)) min2)) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (<= (+ (select A k) 1) (select A j)) (< (+ 2 j) M) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< (+ j 1) M)) (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (<= (+ (select A k) 1) min2) (< (select A (+ j 1)) min2)) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A (+ j 1)) min2))) (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (select A j) min2) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A (+ j 1)) min2)))), 65175#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 65170#(or (< j M) (= min1 min2)), 65181#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k)) (< i N))), 65183#(and (or (< j M) (not (= k i)) (= min1 min2)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 65180#(and (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 65173#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 65185#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 65186#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 65176#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 65189#(and (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (not (= k i)) (< (select A j) min2) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (= k i)) (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (<= M (+ j 1))) (or (< (+ 2 j) M) (<= M (+ j 1)) (< i (+ k 1))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (not (= k i)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1))) (or (not (= k i)) (< (select A (+ j 1)) (select A j)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1)) (= (select A j) min1)) (or (<= (+ k 1) N) (<= k i) (< (+ 2 j) M) (<= M (+ j 1)))), 65178#(and (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (< (+ j 1) M) (< (select A j) min2) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k))) (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (<= (select A j) (select A k)))), 65184#(and (or (< j M) (= min1 min2) (<= (+ (select A i) 1) min1)) (or (<= (+ k 1) N) (< j M)) (or (<= (+ i 1) k) (< j M)) (or (<= min1 (select A i)) (< j M) (= (select A i) min2))), 65172#(or (< j M) (= min1 min2) (< i N)), 65188#(and (or (< (+ j 1) M) (not (< j M)) (<= (+ (select A i) 1) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= min1 (select A i)) (not (< j M)) (= (select A i) (select A j)) (not (< (select A j) min2))) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A i) 1) min1)) (or (< (+ j 1) M) (<= min1 (select A i)) (< (select A j) min2) (not (< j M)) (= (select A i) min2)) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M)))), 65182#(and (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j))) (< i N)) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (not (< (select A (+ j 1)) (select A j))) (< i N)) (or (not (< (+ j 1) M)) (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (<= (+ (select A k) 1) min2) (< (select A (+ j 1)) min2) (< i N)) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A j)) (<= (+ (select A k) 1) (select A j)) (< (+ 2 j) M) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (not (< (+ j 1) M)) (= (select A (+ j 1)) min1) (< (select A j) min2) (< (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ j 1))) (not (< (select A (+ j 1)) min2)) (< i N)) (or (not (< (+ j 1) M)) (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (= min1 (select A k)) (< (+ 2 j) M) (not (< (select A (+ j 1)) min2)) (< i N)) (or (not (< (+ j 1) M)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (< i N))), 65187#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (< (select A j) min2) (not (< j M)) (= min1 min2)) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 65177#(and (or (< j M) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (= min1 min2) (<= (+ (select A k) 1) min2))), 65174#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 65190#(and (or (<= (+ i 1) k) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (+ k 1) N) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= min1 (select A i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) (select A (+ j 1)))) (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (< (+ 2 j) M) (<= (+ (select A i) 1) min1) (<= M (+ j 1))) (or (<= (select A j) (select A (+ j 1))) (<= min1 (select A i)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1)) (= (select A i) (select A (+ j 1)))) (or (< (select A j) min2) (= min1 min2) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (<= (+ (select A i) 1) min1) (<= M (+ j 1))) (or (<= min1 (select A i)) (< (select A j) min2) (< (+ 2 j) M) (< (select A (+ j 1)) min2) (<= M (+ j 1)) (= (select A i) min2)) (or (<= min1 (select A i)) (< (select A (+ j 1)) (select A j)) (= (select A i) (select A j)) (< (+ 2 j) M) (<= min2 (select A j)) (<= M (+ j 1))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (< (+ 2 j) M) (<= (+ (select A i) 1) min1) (<= min2 (select A j)) (<= M (+ j 1))) (or (< (select A (+ j 1)) (select A j)) (< (+ 2 j) M) (<= (+ (select A i) 1) min1) (<= min2 (select A j)) (<= M (+ j 1)) (= (select A j) min1))), 65171#(or (= min1 min2) (< i N))] [2022-03-15 22:11:03,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:11:03,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:03,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:11:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1788, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:11:03,396 INFO L87 Difference]: Start difference. First operand 2359 states and 10828 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:11:23,644 INFO L93 Difference]: Finished difference Result 4006 states and 15508 transitions. [2022-03-15 22:11:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 22:11:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:11:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:11:23,653 INFO L225 Difference]: With dead ends: 4006 [2022-03-15 22:11:23,654 INFO L226 Difference]: Without dead ends: 3974 [2022-03-15 22:11:23,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4978 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=2323, Invalid=14707, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 22:11:23,655 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 369 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:11:23,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 0 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:11:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2022-03-15 22:11:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 2479. [2022-03-15 22:11:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 4.567393058918483) internal successors, (11318), 2478 states have internal predecessors, (11318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 11318 transitions. [2022-03-15 22:11:23,729 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 11318 transitions. Word has length 17 [2022-03-15 22:11:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:11:23,729 INFO L470 AbstractCegarLoop]: Abstraction has 2479 states and 11318 transitions. [2022-03-15 22:11:23,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:11:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 11318 transitions. [2022-03-15 22:11:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:11:23,734 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:11:23,734 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:11:23,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-15 22:11:23,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 22:11:23,947 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:11:23,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:11:23,948 INFO L85 PathProgramCache]: Analyzing trace with hash -778125788, now seen corresponding path program 12 times [2022-03-15 22:11:23,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:11:23,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859425294] [2022-03-15 22:11:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:11:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:11:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:11:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:11:24,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:11:24,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859425294] [2022-03-15 22:11:24,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859425294] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:11:24,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011508258] [2022-03-15 22:11:24,265 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:11:24,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:11:24,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:11:24,266 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:11:24,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-15 22:11:24,294 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-03-15 22:11:24,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:11:24,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:11:24,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:11:24,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:11:24,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:11:24,844 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:11:24,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 161 [2022-03-15 22:11:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:11:25,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:11:26,355 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:11:26,420 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:11:26,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 883 treesize of output 527 [2022-03-15 22:12:04,287 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:04,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011508258] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:12:04,288 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:12:04,288 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-03-15 22:12:04,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [80460636] [2022-03-15 22:12:04,288 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:12:04,289 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:12:04,293 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:12:04,293 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:12:11,626 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [74459#(and (or (< i (+ 2 j)) (not (< j M))) (or (<= (+ M 1) N) (not (< j M))) (or (not (= (+ j 1) i)) (not (< j M)) (<= (+ M i) (+ k j 1))) (or (not (= (+ j 1) i)) (not (< j M)) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ k 1) N) (not (= (+ j 1) i)) (not (< j M))) (or (not (= (+ j 1) i)) (< (select A j) min2) (not (< j M)) (= min1 min2))), 74450#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 74463#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 74448#(or (= min1 min2) (< i N)), 74455#(or (= min1 min2) (< k N) (< i N)), 74454#(or (= min1 min2) (< k N)), 74461#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1))), 74457#(and (or (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (+ (select A k) 1) (select A j)) (<= M (+ j 1)) (not (< (select A j) min2)) (< i N) (= (select A j) min1)) (or (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (<= M (+ j 1)) (< i N)) (or (< (select A j) min2) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ j 1)) 1) min2) (<= M (+ j 1)) (< i N)) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1)) (not (< (select A j) min2)) (< i N)) (or (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (<= M (+ j 1)) (not (< (select A j) min2)) (< i N) (<= (select A j) (select A k))) (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1)) (< i N))), 74452#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= min2 (select A j)) (<= M j)) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (select A i) min1) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1) (<= M j)) (or (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (<= M j) (= (select A i) min2))), 74453#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A i) (select A j)) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (< (select A (+ i 1)) (select A i)) (<= M j) (= (select A i) min2)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A j) (select A (+ i 1))) (not (< (select A j) min2)) (<= M j)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (= min2 (select A (+ i 1))) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (not (< (select A j) min2)) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A i) min1) (not (< (select A j) min2)) (= (select A j) min1) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A j) min2) (= min1 min2) (< (select A i) min1) (<= M j))), 74460#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 74456#(and (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (<= (+ (select A k) 1) (select A (+ j 1))) (<= M (+ j 1)) (not (< (select A j) min2))) (or (<= (select A (+ j 1)) (select A k)) (= min1 (select A k)) (<= M (+ j 1)) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (select A j) min2) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ j 1)) 1) min2) (<= M (+ j 1))) (or (<= (select A (+ j 1)) (select A k)) (< (select A j) min2) (<= min2 (select A k)) (= min1 (select A k)) (<= M (+ j 1))) (or (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (+ (select A k) 1) (select A j)) (<= M (+ j 1)) (not (< (select A j) min2)) (= (select A j) min1))), 74462#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 74464#(and (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (not (< (select A (+ 2 i)) (select A i))) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (not (< (select A (+ 2 i)) (select A i))) (= (select A (+ 2 i)) min2) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (+ 3 i) N) (< (select A i) min1) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (not (< (select A j) min2)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (< (select A j) min2) (not (< (select A (+ 2 i)) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= M j)) (or (< (select A (+ 2 i)) (select A i)) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A i) (select A j)) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (not (< (select A (+ 2 i)) (select A (+ i 1)))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (< (select A j) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (not (< (select A j) min2)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (not (< (select A (+ 2 i)) min1)) (< (+ 3 i) N) (< (select A i) min1) (not (< (select A j) min2)) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (not (< (+ 2 i) N)) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (select A (+ i 1)) min1) (not (< (+ 2 i) N)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (not (< (select A j) min2)) (= (select A j) min1) (<= M j)) (or (< (select A (+ 2 i)) (select A i)) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (<= M j) (= (select A i) min2)) (or (not (< (select A (+ i 1)) (select A i))) (not (< (+ 2 i) N)) (not (< (select A i) min1)) (< (select A j) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1))) (<= M j))), 74451#(and (or (<= min2 (select A j)) (< i N) (= (select A j) min1) (<= M j)) (or (<= (+ (select A j) 1) min2) (= min1 min2) (< i N) (<= M j))), 74449#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 74458#(and (or (<= (+ k 1) N) (<= k i) (<= (+ M i) (+ N j)) (not (< j M))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (not (< (select A j) min2))) (or (not (= k i)) (<= (+ M i) (+ N j)) (< (select A j) min2) (not (< j M)) (= min1 min2) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (+ M i) (+ 2 k j)) (<= (+ M i) (+ N j)) (not (< j M)) (< i (+ k 1))) (or (= (select A (+ j 1)) min1) (<= min2 (select A (+ j 1))) (not (= k i)) (<= (+ M i) (+ N j)) (< (select A j) min2) (not (< j M))))] [2022-03-15 22:12:11,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:12:11,627 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:12:11,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:12:11,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1549, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:12:11,627 INFO L87 Difference]: Start difference. First operand 2479 states and 11318 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:13:21,447 INFO L93 Difference]: Finished difference Result 7044 states and 26091 transitions. [2022-03-15 22:13:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-03-15 22:13:21,447 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:13:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:13:21,464 INFO L225 Difference]: With dead ends: 7044 [2022-03-15 22:13:21,464 INFO L226 Difference]: Without dead ends: 7007 [2022-03-15 22:13:21,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29082 ImplicationChecksByTransitivity, 69.2s TimeCoverageRelationStatistics Valid=11880, Invalid=59142, Unknown=0, NotChecked=0, Total=71022 [2022-03-15 22:13:21,471 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 731 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:13:21,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 0 Invalid, 2520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-03-15 22:13:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2022-03-15 22:13:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 2696. [2022-03-15 22:13:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2695 states have (on average 4.559925788497217) internal successors, (12289), 2695 states have internal predecessors, (12289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 12289 transitions. [2022-03-15 22:13:21,564 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 12289 transitions. Word has length 17 [2022-03-15 22:13:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:13:21,564 INFO L470 AbstractCegarLoop]: Abstraction has 2696 states and 12289 transitions. [2022-03-15 22:13:21,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:13:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 12289 transitions. [2022-03-15 22:13:21,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:13:21,570 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:13:21,570 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:13:21,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-03-15 22:13:21,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:13:21,783 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:13:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:13:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 157231774, now seen corresponding path program 13 times [2022-03-15 22:13:21,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:13:21,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314367898] [2022-03-15 22:13:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:13:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:13:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:22,042 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:13:22,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314367898] [2022-03-15 22:13:22,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314367898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:13:22,042 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882601163] [2022-03-15 22:13:22,042 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:13:22,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:13:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:13:22,043 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:13:22,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:13:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:13:22,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:13:22,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:13:22,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:22,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:22,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:13:22,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:13:22,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:13:22,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 153 [2022-03-15 22:13:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:22,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:13:24,063 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:13:24,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 907 treesize of output 527 [2022-03-15 22:13:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:13:55,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882601163] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:13:55,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:13:55,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2022-03-15 22:13:55,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1519426402] [2022-03-15 22:13:55,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:13:55,096 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:13:55,101 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:13:55,102 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:14:07,736 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [87497#(and (or (< (+ j 1) M) (< (select A j) min2) (not (< j M)) (= min1 min2) (= min1 (select A k))) (or (< (+ j 1) M) (<= (+ min1 1) (select A j)) (not (< j M)) (<= (select A j) (select A k))) (or (< (+ j 1) M) (<= (+ min1 1) min2) (<= min2 (select A k)) (not (< j M))) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (< (+ j 1) M) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= min1 min2) (not (< j M))) (or (< (+ j 1) M) (<= min1 (select A j)) (not (< j M)))), 87488#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1))), 87479#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)))), 87482#(or (= min1 min2) (< k N) (< i N)), 87492#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 87491#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 87474#(or (= min1 min2) (< i N)), 87505#(and (or (< i k) (not (< i N))) (or (not (= (+ i 1) k)) (not (< i N)) (= min1 min2) (< (select A i) min1)) (or (not (< (select A i) min1)) (not (= (+ i 1) k)) (not (< i N)) (= (select A i) min2)) (or (<= (+ k j) (+ M i 1)) (not (< i N)))), 87485#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 87499#(and (or (< i k) (not (< i N))) (or (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (not (< i N)) (<= k (+ i 1))) (or (not (< i N)) (= min1 min2) (< (select A i) min1))), 87503#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= min2 (select A k))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A (+ i 1)) min1)) (<= min2 (select A k)) (< (select A i) min1))), 87495#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 87496#(and (or (< j M) (<= (+ min1 1) min2) (<= min2 (select A k))) (or (< j M) (= min1 min2) (= min1 (select A k))) (or (< j M) (<= min1 min2)) (or (< j M) (<= (+ k 1) i))), 87490#(and (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A (+ i 1)) min1)) (<= min2 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k))) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1))), 87481#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A j)) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A k) 1) (select A j)) (not (< (select A j) min2)) (= (select A j) min1)) (or (< (+ j 1) M) (<= (select A k) (select A (+ (- 1) N))) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N)))) (or (< (+ j 1) M) (<= (select A j) (select A (+ (- 1) N))) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (not (< j M)) (= min1 (select A (+ (- 1) N))) (not (< (select A j) min2))) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (select A j) min2) (< (+ 2 k) N) (<= min2 (select A k)) (not (< j M)) (= min1 (select A k))) (or (< (+ j 1) M) (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< (+ 2 k) N) (not (< j M)) (= min1 (select A k)) (not (< (select A j) min2)) (<= (select A j) (select A k))) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M))) (or (< (+ j 1) M) (< (select A j) min2) (< (+ 2 k) N) (not (< j M)) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2))), 87498#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 87494#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 87501#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 87489#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 87477#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 87480#(and (or (<= (+ (select A (+ (- 1) N)) 1) (select A k)) (< j M) (< (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k))) (or (< j M) (< (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (<= (+ (select A (+ (- 1) N)) 1) min2)) (or (<= (+ 2 k) N) (< j M)) (or (< j M) (<= (select A k) (select A (+ (- 1) N))) (< (+ 2 k) N) (= min1 (select A (+ (- 1) N))) (<= min2 (select A (+ (- 1) N))))), 87502#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 87476#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 87483#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 87478#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 87493#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1))), 87473#(or (< j M) (= min1 min2)), 87500#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 87487#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 87486#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 87484#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N))), 87475#(or (< j M) (= min1 min2) (< i N)), 87504#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)))] [2022-03-15 22:14:07,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:14:07,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:14:07,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:14:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=3030, Unknown=0, NotChecked=0, Total=3422 [2022-03-15 22:14:07,737 INFO L87 Difference]: Start difference. First operand 2696 states and 12289 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:15:19,720 INFO L93 Difference]: Finished difference Result 5736 states and 21302 transitions. [2022-03-15 22:15:19,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2022-03-15 22:15:19,720 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:15:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:15:19,732 INFO L225 Difference]: With dead ends: 5736 [2022-03-15 22:15:19,732 INFO L226 Difference]: Without dead ends: 5591 [2022-03-15 22:15:19,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 38 SyntacticMatches, 10 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34327 ImplicationChecksByTransitivity, 71.0s TimeCoverageRelationStatistics Valid=12940, Invalid=81616, Unknown=0, NotChecked=0, Total=94556 [2022-03-15 22:15:19,736 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1023 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:15:19,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1023 Valid, 0 Invalid, 5028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-03-15 22:15:19,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2022-03-15 22:15:19,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 2769. [2022-03-15 22:15:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2769 states, 2768 states have (on average 4.575505780346821) internal successors, (12665), 2768 states have internal predecessors, (12665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 12665 transitions. [2022-03-15 22:15:19,877 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 12665 transitions. Word has length 17 [2022-03-15 22:15:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:15:19,877 INFO L470 AbstractCegarLoop]: Abstraction has 2769 states and 12665 transitions. [2022-03-15 22:15:19,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:15:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 12665 transitions. [2022-03-15 22:15:19,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:15:19,884 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:15:19,884 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:15:19,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-15 22:15:20,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:20,097 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:15:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:15:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -965868444, now seen corresponding path program 14 times [2022-03-15 22:15:20,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:15:20,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896657295] [2022-03-15 22:15:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:15:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:15:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:15:21,196 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:15:21,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:15:21,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896657295] [2022-03-15 22:15:21,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896657295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:15:21,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050843704] [2022-03-15 22:15:21,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:15:21,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:15:21,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:15:21,198 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:15:21,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:15:21,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:15:21,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:15:21,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:15:21,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:15:26,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:15:26,321 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:15:26,321 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 169 [2022-03-15 22:15:26,601 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:15:26,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:15:29,979 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:15:29,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 847 treesize of output 541 [2022-03-15 22:17:07,037 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:17:07,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050843704] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:07,037 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:07,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:17:07,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217193128] [2022-03-15 22:17:07,038 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:07,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:07,044 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 22:17:07,044 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:25,938 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [99412#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 99430#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 99428#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 99429#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (< k N) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1))), 99405#(or (= min1 min2) (<= (+ j 1) M) (< i N)), 99409#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))))), 99434#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A j) (select A (+ i 1))) (< k N) (<= min2 (select A j))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A i) (select A j)) (< k N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= (select A j) (select A (+ i 1))) (< k N) (< (select A i) min1) (<= min2 (select A j))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N) (< (select A i) min1))), 99433#(and (or (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= (+ k 1) N) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ 2 k) (+ N M))) (or (< (+ i 1) N) (not (< i N)) (= j 0) (< k N)) (or (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ i 1) N) (not (< (select A i) min1)) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (not (< i N)) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= (+ k 1) N) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (= (select A i) min2)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (<= (+ min2 1) (select A j))) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A j) min1) (<= (+ min2 1) (select A j)))), 99425#(and (or (< (+ i 1) N) (<= min2 (select A (+ j 1))) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (= (select A i) (select A (+ j 1)))) (or (= (select A (+ j 1)) min1) (< (+ i 1) N) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (< (select A i) min1)) (or (<= (select A j) (select A (+ j 1))) (< (+ i 1) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< i N)) (not (< (select A j) min2)) (= (select A i) (select A (+ j 1)))) (or (< (+ i 1) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (not (< i N)) (= j 0)) (or (< (+ i 1) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< i N)) (= (select A i) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2))) (or (< (+ i 1) N) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (<= (+ (select A (+ j 1)) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (< (select A j) min2) (<= (+ 3 j) M) (not (< i N)) (= min1 min2) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (< (select A i) min1) (not (< (select A j) min2)))), 99418#(or (= min1 min2) (< k N) (<= (+ j 1) M) (< i N)), 99423#(and (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1)) (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (< k N) (<= min2 (select A j))) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1))), 99432#(and (or (= (select A (+ j 1)) min1) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (<= N (+ 2 i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= (select A j) (select A (+ j 1))) (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1) (<= min2 (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A i) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= min2 (select A (+ j 1))) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1)))) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1))) (< (select A i) min1) (<= min2 (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2) (<= min1 (select A (+ i 1)))) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ j 1))) (<= min2 (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A (+ j 1)) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= 2 M)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (+ (select A (+ j 1)) 1) (select A j)) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A (+ j 1)) 1) min2)) (or (<= (select A j) (select A (+ j 1))) (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ j 1)) (select A (+ i 1))) (<= (select A i) (select A (+ i 1))) (<= (+ 3 j) M) (< (+ 3 i) N) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))))), 99408#(and (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (< (select A i) min1)) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= (+ 2 j) M) (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= min2 (select A j)))), 99426#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (= j 0)) (or (<= (select A j) (select A (+ j 1))) (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< (select A j) min2))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A j) min2) (<= (+ 3 j) M) (= min1 min2) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (<= (+ 3 j) M) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (<= min2 (select A (+ j 1))) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M)) (or (= (select A (+ j 1)) min1) (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= min2 (select A (+ j 1))) (< (select A j) min2) (<= (+ 3 j) M) (< (select A i) min1)) (or (<= (select A j) (select A (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< (select A j) min2) (<= (+ 3 j) M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (<= (+ 3 j) M) (= (select A i) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A j)) (not (< (select A j) min2)) (< (select A (+ i 1)) (select A i))) (or (<= (select A j) (select A (+ j 1))) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (not (< (select A (+ i 1)) min1)) (<= (+ 3 j) M) (< (select A i) min1) (not (< (select A j) min2))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= min2 (select A (+ j 1))) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (< (select A (+ i 1)) (select A i)) (= (select A i) (select A (+ j 1)))) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (= min2 (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (<= (+ 3 j) M) (= (select A j) (select A (+ i 1))) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (not (< (select A j) min2))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (<= (+ (select A (+ j 1)) 1) (select A j)) (< (select A i) min1) (not (< (select A j) min2)) (= (select A j) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A j) min2) (<= (+ 3 j) M) (<= (+ (select A (+ j 1)) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= (select A j) (select A (+ j 1))) (= (select A (+ j 1)) min1) (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 3 j) M) (< (select A i) min1) (not (< (select A j) min2))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 2 M))), 99419#(and (or (<= (+ 2 j) M) (< k N) (<= min2 (select A j)) (= (select A j) min1)) (or (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N))), 99417#(or (< j M) (= min1 min2) (< k N)), 99413#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 99403#(or (= min1 min2) (< i N)), 99437#(and (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= N (+ 2 i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (select A i) (select A (+ 2 i))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ 2 i)) (select A i)) (<= (+ k 1) N) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (< (+ 3 i) N) (<= (+ 2 k) (+ N M))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A (+ 2 i)) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< (select A (+ i 1)) (select A i)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (select A i) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0) (< k N)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2))), 99416#(or (= min1 min2) (< k N) (< i N)), 99422#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 99421#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 99424#(and (or (<= 2 M) (< i N)) (or (<= (+ (select A j) 1) min2) (= min1 min2) (<= (select A (+ (- 1) M)) min2) (< 2 M) (< i N)) (or (<= (+ min2 1) (select A (+ (- 1) M))) (< 2 M) (<= (select A j) (select A (+ (- 1) M))) (< i N) (= (select A (+ (- 1) M)) min1)) (or (= j 0) (< i N)) (or (< 2 M) (<= (+ (select A (+ (- 1) M)) 1) (select A j)) (< i N) (= (select A j) min1) (<= (+ min2 1) (select A j)))), 99436#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< k N) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A i) (select A j)) (< k N) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< k N) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)))), 99415#(or (= min1 min2) (< k N)), 99414#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (<= min2 (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= min2 (select A j)) (= (select A j) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (<= min2 (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (< (+ 3 i) N) (= (select A i) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) min1) (<= min2 (select A j)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 99411#(and (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A i) (select A j)) (<= min2 (select A j)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= (select A j) (select A (+ i 1))) (<= min2 (select A j))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= (select A j) (select A (+ i 1))) (< (select A i) min1) (<= min2 (select A j))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (< (select A i) min1) (<= min2 (select A j)) (= (select A j) min1))), 99406#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 99420#(and (or (<= (+ 2 j) M) (< k N) (<= min2 (select A j)) (< i N) (= (select A j) min1)) (or (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (= min1 min2) (< k N) (< i N))), 99427#(and (or (<= (+ k 1) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (+ 2 k) (+ N M)) (< i N) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< i N)) (or (= j 0) (< k N) (< i N)) (or (<= (+ k 1) N) (<= (+ 2 k) (+ N M)) (< i N)) (or (<= (+ k 1) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (< i N) (= (select A j) min1) (<= (+ min2 1) (select A j)))), 99407#(and (or (<= (+ 2 j) M) (<= min2 (select A j)) (< i N) (= (select A j) min1)) (or (<= (+ 2 j) M) (<= (+ (select A j) 1) min2) (= min1 min2) (< i N))), 99435#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< (+ 2 k) (+ N M)) (< (select A (+ i 1)) (select A i)) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (= (select A i) min2)) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ 2 k) (+ N M))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (< (+ 2 k) (+ N M)) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= j 0) (< k N)) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (= (select A (+ (- 1) (* (- 1) k) N M)) min1) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M)))) (or (<= N (+ i 1)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1))) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) (select A j)) (< (+ 2 k) (+ N M)) (< (select A i) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= min1 (select A i)) (<= (select A j) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ k 1) N) (< (+ 2 i) N) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (<= (+ min2 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) min2) (= min1 min2) (< (+ 2 k) (+ N M)) (< (select A i) min1) (<= (select A (+ (- 1) (* (- 1) k) N M)) min2))), 99431#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 99404#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 99410#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (= min2 (select A (+ i 1))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (< j M) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1)))] [2022-03-15 22:17:25,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:17:25,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:17:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=3568, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:17:25,940 INFO L87 Difference]: Start difference. First operand 2769 states and 12665 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:47,742 INFO L93 Difference]: Finished difference Result 4216 states and 17282 transitions. [2022-03-15 22:18:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-03-15 22:18:47,743 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:18:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:47,768 INFO L225 Difference]: With dead ends: 4216 [2022-03-15 22:18:47,768 INFO L226 Difference]: Without dead ends: 4195 [2022-03-15 22:18:47,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17939 ImplicationChecksByTransitivity, 83.8s TimeCoverageRelationStatistics Valid=7470, Invalid=43832, Unknown=0, NotChecked=0, Total=51302 [2022-03-15 22:18:47,770 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1204 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 2937 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:47,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1204 Valid, 0 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2937 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-03-15 22:18:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2022-03-15 22:18:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 2800. [2022-03-15 22:18:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2799 states have (on average 4.56734548052876) internal successors, (12784), 2799 states have internal predecessors, (12784), 0 states have call successors, (0), 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:18:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 12784 transitions. [2022-03-15 22:18:47,821 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 12784 transitions. Word has length 17 [2022-03-15 22:18:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:47,822 INFO L470 AbstractCegarLoop]: Abstraction has 2800 states and 12784 transitions. [2022-03-15 22:18:47,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:47,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 12784 transitions. [2022-03-15 22:18:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:18:47,827 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:47,827 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:47,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-15 22:18:48,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:48,041 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:18:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash 779712672, now seen corresponding path program 15 times [2022-03-15 22:18:48,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:48,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337365860] [2022-03-15 22:18:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:48,785 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:18:48,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:48,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337365860] [2022-03-15 22:18:48,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337365860] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:48,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113021706] [2022-03-15 22:18:48,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:18:48,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:48,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:48,787 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:18:48,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:18:48,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:18:48,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:48,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-15 22:18:48,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:49,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:49,714 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:18:49,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 249 treesize of output 197 [2022-03-15 22:18:56,077 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:18:56,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:58,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:58,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,454 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,455 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:18:58,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:18:58,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:18:58,467 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 355 treesize of output 213 [2022-03-15 22:18:59,062 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:18:59,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113021706] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:18:59,062 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:18:59,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-03-15 22:18:59,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [886285332] [2022-03-15 22:18:59,063 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:18:59,063 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:18:59,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 65 states and 121 transitions. [2022-03-15 22:18:59,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:53,732 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 30 new interpolants: [109714#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1))), 109706#(or (< j M) (= min1 min2) (< i N)), 109704#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< (select A i) min1))), 109713#(and (or (< (+ i 1) N) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 109710#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))))), 109719#(and (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< k N) (= min2 (select A (+ i 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< k N) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 109711#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1))))), 109720#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< j M) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 109708#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (= min1 min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2))), 109721#(and (or (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< i N)) (or (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N))), 109703#(or (= min1 min2) (< i N)), 109712#(or (= min1 min2) (< k N) (< i N)), 109732#(and (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (<= (select A j) (select A k)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (select A j) (select A k)) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (= (select A (+ 2 i)) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (< (select A (+ 2 i)) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A i) (select A j)) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (< (select A i) min1) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= j 0)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (select A i) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (= (select A (+ 2 i)) (select A j)) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= (select A j) (select A k)) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) min2) (<= (select A j) (select A k)) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (select A j) (select A k)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (<= (select A j) (select A k)) (= (select A i) min2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i)) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1) (<= (select A j) (select A k))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (< (+ 3 i) N) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= 2 M) (< (select A i) min1) (<= (select A j) (select A k)) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (select A (+ i 1)) (select A (+ 2 i))) (= (select A (+ 2 i)) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i)))), 109705#(or (< j M) (= min1 min2)), 109715#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= min1 min2) (< k N) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< k N) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (= min2 (select A (+ i 1))) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (< k N) (< (select A i) min1))), 109728#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (<= 2 M) (= (select A i) (select A k)) (<= (select A j) (select A k))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (not (< (select A i) min1)) (not (< i N)) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (= (select A i) (select A j)) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (+ min2 1) (select A j))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (select A j) (select A k))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (<= 2 M) (= min1 (select A k)) (< (select A i) min1) (<= (select A j) (select A k))) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= 2 M) (<= (+ (select A k) 1) min2) (<= (select A j) (select A k)) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (not (< i N)) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= j 0))), 109722#(and (or (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< i N))), 109724#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 109726#(and (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A (+ i 1)) min1)) (<= min2 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) min1)) (<= min2 (select A k))) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ 2 k) N) (not (< (select A i) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1))), 109725#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= (+ (select A k) 1) min2) (= (select A i) min2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (<= min2 (select A k)) (= (select A i) (select A k)))), 109723#(and (or (<= (+ 2 k) N) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) min2) (< i N) (<= (select A j) (select A k))) (or (<= (+ 2 k) N) (= j 0) (< i N)) (or (<= (+ 2 k) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< i N) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< i N)) (or (<= (+ 2 k) N) (<= min2 (select A k)) (<= 2 M) (= min1 (select A k)) (< i N) (<= (select A j) (select A k)))), 109731#(and (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< j M) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1))), 109729#(and (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (= (select A i) (select A j)) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A (+ i 1)) (select A i)) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= (select A j) (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (<= min1 (select A (+ i 1))) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (= (select A j) (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (select A j) (select A k)) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (<= 2 M) (= min1 (select A k)) (< (select A i) min1) (<= (select A j) (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (<= (select A j) (select A k)) (= (select A i) min2)) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) min2) (<= (select A j) (select A k))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1)) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (= (select A j) min1) (<= (+ min2 1) (select A j))) (or (<= N (+ i 1)) (< (select A (+ i 1)) min1) (< (+ 2 i) N) (<= (+ 2 k) N) (= min1 min2) (<= 2 M) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= (select A j) (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= min2 (select A k)) (<= 2 M) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i)) (<= (select A j) (select A k))) (or (<= N (+ i 1)) (<= min1 (select A i)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (<= 2 M) (<= (select A j) (select A k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ (select A j) 1) min2) (= min2 (select A (+ i 1))) (<= 2 M) (<= (+ (select A k) 1) (select A j)) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (<= 2 M) (< (select A i) min1) (<= (select A j) (select A k)) (<= min1 (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (= j 0))), 109717#(or (<= (+ k 1) N) (< j M) (= min1 min2) (< i N)), 109716#(or (<= (+ k 1) N) (< j M) (= min1 min2)), 109727#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= min2 (select A k)) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= min2 (select A k)) (= min1 (select A k)) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) min1)) (<= min2 (select A k))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A (+ i 1)) min1)) (<= min2 (select A k)) (< (select A i) min1))), 109707#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< (select A i) min1))), 109718#(and (or (< (+ i 1) N) (< j M) (not (< (select A i) min1)) (not (< i N)) (< k N) (= (select A i) min2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (= min1 min2) (< k N) (< (select A i) min1))), 109709#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not (< (select A (+ i 1)) min1)) (= min2 (select A (+ i 1))) (< (select A i) min1)) (or (not (< (+ i 1) N)) (not (< (select A (+ i 1)) (select A i))) (< (+ 2 i) N) (< j M) (not (< (select A i) min1)) (= min2 (select A (+ i 1)))) (or (< (select A (+ i 1)) min1) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (= min1 min2) (< (select A i) min1))), 109730#(and (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (< (select A i) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (+ (select A k) 1) min2) (< (select A (+ i 1)) (select A i)) (= (select A i) min2)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (< (select A (+ 2 i)) (select A i)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A k)) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (< (+ 3 i) N) (= min1 min2) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (= min1 (select A k)) (< (select A i) min1) (< (select A (+ 2 i)) min1)) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (+ (select A k) 1) min2) (<= (select A i) (select A (+ 2 i))) (< (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A (+ 2 i))) (< (select A i) min1) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (<= min1 (select A i)) (<= (+ 2 k) N) (<= (select A i) (select A (+ i 1))) (< (+ 3 i) N) (= (select A (+ 2 i)) min2) (<= (select A (+ i 1)) (select A (+ 2 i))) (<= (+ (select A k) 1) min2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N) (= min2 (select A (+ i 1))) (<= (+ (select A k) 1) min2) (< (select A i) min1) (< (select A (+ 2 i)) (select A (+ i 1))) (<= min1 (select A (+ i 1)))) (or (<= min1 (select A (+ 2 i))) (<= N (+ 2 i)) (< (select A (+ i 1)) min1) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= min2 (select A k)) (< (+ 3 i) N) (< (select A i) min1)))] [2022-03-15 22:19:53,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-03-15 22:19:53,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:53,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-03-15 22:19:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2943, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:19:53,733 INFO L87 Difference]: Start difference. First operand 2800 states and 12784 transitions. Second operand has 41 states, 40 states have (on average 2.5) internal successors, (100), 40 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:21:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2022-03-15 22:21:39,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 19 SyntacticMatches, 14 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13251 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=6164, Invalid=35248, Unknown=0, NotChecked=0, Total=41412 [2022-03-15 22:21:39,014 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 654 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 2905 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 2905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:21:39,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 0 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 2905 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-03-15 22:21:39,015 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:21:39,027 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:21:39,030 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:21:39,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:21:39,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 22:21:39,216 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (2800states) and FLOYD_HOARE automaton (currently 171 states, 41 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 204 known predicates. [2022-03-15 22:21:39,218 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:21:39,218 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:21:39,218 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:21:39,219 INFO L732 BasicCegarLoop]: Path program histogram: [15, 9, 1, 1, 1] [2022-03-15 22:21:39,220 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:21:39,221 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:21:39,222 INFO L202 PluginConnector]: Adding new model min-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:21:39 BasicIcfg [2022-03-15 22:21:39,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:21:39,222 INFO L158 Benchmark]: Toolchain (without parser) took 855010.41ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 162.4MB in the beginning and 246.7MB in the end (delta: -84.3MB). Peak memory consumption was 748.5MB. Max. memory is 8.0GB. [2022-03-15 22:21:39,222 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 197.1MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:21:39,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.77ms. Allocated memory is still 197.1MB. Free memory was 162.4MB in the beginning and 160.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:21:39,222 INFO L158 Benchmark]: Boogie Preprocessor took 39.81ms. Allocated memory is still 197.1MB. Free memory was 160.9MB in the beginning and 159.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:21:39,222 INFO L158 Benchmark]: RCFGBuilder took 222.71ms. Allocated memory is still 197.1MB. Free memory was 159.9MB in the beginning and 150.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:21:39,222 INFO L158 Benchmark]: TraceAbstraction took 854703.40ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 149.8MB in the beginning and 246.7MB in the end (delta: -96.8MB). Peak memory consumption was 735.9MB. Max. memory is 8.0GB. [2022-03-15 22:21:39,223 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.16ms. Allocated memory is still 197.1MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.77ms. Allocated memory is still 197.1MB. Free memory was 162.4MB in the beginning and 160.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.81ms. Allocated memory is still 197.1MB. Free memory was 160.9MB in the beginning and 159.9MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 222.71ms. Allocated memory is still 197.1MB. Free memory was 159.9MB in the beginning and 150.4MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 854703.40ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 832.6MB). Free memory was 149.8MB in the beginning and 246.7MB in the end (delta: -96.8MB). Peak memory consumption was 735.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2800states) and FLOYD_HOARE automaton (currently 171 states, 41 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 204 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2800states) and FLOYD_HOARE automaton (currently 171 states, 41 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 204 known predicates. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2800states) and FLOYD_HOARE automaton (currently 171 states, 41 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 204 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2800states) and FLOYD_HOARE automaton (currently 171 states, 41 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 204 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 854.6s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.1s, AutomataDifference: 433.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10013 SdHoareTripleChecker+Valid, 21.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10013 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 18.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7708 mSDsCounter, 3984 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32336 IncrementalHoareTripleChecker+Invalid, 36320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3984 mSolverCounterUnsat, 0 mSDtfsCounter, 32336 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4038 GetRequests, 1089 SyntacticMatches, 135 SemanticMatches, 2813 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165551 ImplicationChecksByTransitivity, 435.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2800occurred in iteration=26, InterpolantAutomatonStates: 2131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 22171 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 273.1s InterpolantComputationTime, 789 NumberOfCodeBlocks, 789 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1091 ConstructedInterpolants, 15 QuantifiedInterpolants, 34352 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1573 ConjunctsInSsa, 399 ConjunctsInUnsatCore, 75 InterpolantComputations, 3 PerfectInterpolantSequences, 147/536 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