/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/sorted.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:16:25,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:16:25,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:16:25,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:16:25,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:16:25,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:16:25,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:16:25,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:16:25,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:16:25,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:16:25,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:16:25,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:16:25,673 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:16:25,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:16:25,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:16:25,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:16:25,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:16:25,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:16:25,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:16:25,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:16:25,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:16:25,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:16:25,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:16:25,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:16:25,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:16:25,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:16:25,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:16:25,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:16:25,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:16:25,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:16:25,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:16:25,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:16:25,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:16:25,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:16:25,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:16:25,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:16:25,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:16:25,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:16:25,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:16:25,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:16:25,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:16:25,694 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:16:25,720 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:16:25,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:16:25,721 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:16:25,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:16:25,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:16:25,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:16:25,722 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:16:25,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:16:25,722 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:16:25,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:16:25,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:16:25,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:16:25,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:16:25,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:16:25,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:16:25,725 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:16:25,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:16:25,725 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:16:25,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:16:25,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:16:25,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:16:25,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:16:25,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:16:25,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:16:25,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:16:25,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:16:25,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:16:25,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:16:25,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:16:25,728 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:16:25,728 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:16:25,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:16:25,729 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:16:25,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:16:25,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:16:25,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:16:25,945 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:16:25,945 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:16:25,947 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/sorted.wvr.bpl [2022-03-15 22:16:25,947 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sorted.wvr.bpl' [2022-03-15 22:16:25,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:16:25,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:16:25,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:16:25,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:16:25,970 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:16:25,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:25,987 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:25,993 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:16:25,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:16:25,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:16:26,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:16:26,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:16:26,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:16:26,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:16:26,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:16:26,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:16:26,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/1) ... [2022-03-15 22:16:26,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:16:26,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:26,049 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:16:26,068 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:16:26,086 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:16:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:16:26,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:16:26,086 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:16:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:16:26,086 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:16:26,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:16:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:16:26,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:16:26,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:16:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:16:26,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:16:26,088 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:16:26,134 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:16:26,136 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:16:26,254 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:16:26,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:16:26,269 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:16:26,271 INFO L202 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:16:26 BoogieIcfgContainer [2022-03-15 22:16:26,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:16:26,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:16:26,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:16:26,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:16:26,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:16:25" (1/2) ... [2022-03-15 22:16:26,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6fca32 and model type sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:16:26, skipping insertion in model container [2022-03-15 22:16:26,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:16:26" (2/2) ... [2022-03-15 22:16:26,284 INFO L111 eAbstractionObserver]: Analyzing ICFG sorted.wvr.bpl [2022-03-15 22:16:26,288 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:16:26,288 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:16:26,289 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:16:26,289 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:16:26,336 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:16:26,383 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:16:26,389 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:16:26,390 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:16:26,399 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:16:26,407 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 22:16:26,409 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 32 transitions, 88 flow [2022-03-15 22:16:26,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 88 flow [2022-03-15 22:16:26,453 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2022-03-15 22:16:26,453 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:16:26,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 29 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2022-03-15 22:16:26,457 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:16:26,992 INFO L131 LiptonReduction]: Checked pairs total: 124 [2022-03-15 22:16:26,992 INFO L133 LiptonReduction]: Total number of compositions: 15 [2022-03-15 22:16:26,999 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:16:27,024 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:16:27,026 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:16:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:16:27,032 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:27,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:27,033 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:16:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash 653312300, now seen corresponding path program 1 times [2022-03-15 22:16:27,061 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:27,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794378232] [2022-03-15 22:16:27,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:27,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:27,215 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:16:27,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:27,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794378232] [2022-03-15 22:16:27,216 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794378232] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:27,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:27,217 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:16:27,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634220491] [2022-03-15 22:16:27,219 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:27,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:27,263 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:16:27,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:27,725 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:16:27,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:16:27,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:27,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:16:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:16:27,756 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:16:27,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:27,791 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:16:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:16:27,796 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:16:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:27,804 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:16:27,805 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:16:27,806 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:16:27,812 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:16:27,814 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:16:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:16:27,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:16:27,848 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:16:27,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:16:27,850 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:16:27,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:27,851 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:16:27,851 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:16:27,851 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:16:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:16:27,852 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:27,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:27,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:16:27,853 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:16:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1102128139, now seen corresponding path program 1 times [2022-03-15 22:16:27,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:27,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061068077] [2022-03-15 22:16:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:27,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:27,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061068077] [2022-03-15 22:16:27,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061068077] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:27,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:27,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:16:27,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [582664901] [2022-03-15 22:16:27,895 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:27,896 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:27,901 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:16:27,901 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:28,111 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [225#(or (<= N (+ k 1)) (< (+ 2 k) N)), 227#(or (<= N (+ k 1)) (< (+ i 1) N)), 224#(< (+ k 1) N), 226#(< (+ i 1) N)] [2022-03-15 22:16:28,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-15 22:16:28,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-15 22:16:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-15 22:16:28,114 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:28,255 INFO L93 Difference]: Finished difference Result 65 states and 164 transitions. [2022-03-15 22:16:28,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 22:16:28,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have 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:16:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:28,257 INFO L225 Difference]: With dead ends: 65 [2022-03-15 22:16:28,257 INFO L226 Difference]: Without dead ends: 61 [2022-03-15 22:16:28,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-03-15 22:16:28,258 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:28,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-15 22:16:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2022-03-15 22:16:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.795918367346939) internal successors, (137), 49 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:16:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 137 transitions. [2022-03-15 22:16:28,266 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 137 transitions. Word has length 12 [2022-03-15 22:16:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:28,267 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 137 transitions. [2022-03-15 22:16:28,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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:16:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 137 transitions. [2022-03-15 22:16:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:16:28,268 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:28,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:28,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:16:28,268 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:16:28,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1072223553, now seen corresponding path program 1 times [2022-03-15 22:16:28,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:28,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832067465] [2022-03-15 22:16:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:28,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:28,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832067465] [2022-03-15 22:16:28,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832067465] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:28,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:28,302 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:16:28,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189855205] [2022-03-15 22:16:28,302 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:28,303 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:28,306 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 56 transitions. [2022-03-15 22:16:28,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:28,530 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [408#(or (< (+ i 1) N) (<= M j)), 406#(or (< (+ i 1) N) (< j M)), 407#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 404#(or (< (+ j 1) M) (<= M j)), 403#(< j M), 405#(< (+ i 1) N)] [2022-03-15 22:16:28,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:16:28,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:28,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:16:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:16:28,534 INFO L87 Difference]: Start difference. First operand 50 states and 137 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:28,632 INFO L93 Difference]: Finished difference Result 49 states and 128 transitions. [2022-03-15 22:16:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-15 22:16:28,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:16:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:28,633 INFO L225 Difference]: With dead ends: 49 [2022-03-15 22:16:28,633 INFO L226 Difference]: Without dead ends: 43 [2022-03-15 22:16:28,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:16:28,634 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:28,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:28,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-15 22:16:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-03-15 22:16:28,639 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:16:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:16:28,639 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:16:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:28,639 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:16:28,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:16:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:16:28,641 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:28,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:28,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:16:28,642 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:16:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1372160518, now seen corresponding path program 1 times [2022-03-15 22:16:28,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:28,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13727804] [2022-03-15 22:16:28,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:28,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:28,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:28,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13727804] [2022-03-15 22:16:28,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13727804] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:28,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307981145] [2022-03-15 22:16:28,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:28,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:28,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:28,686 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:16:28,694 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:16:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:28,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:16:28,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:28,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:28,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307981145] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:28,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:28,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-03-15 22:16:28,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431563085] [2022-03-15 22:16:28,870 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:28,871 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:28,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:16:28,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:29,257 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 12 new interpolants: [608#(or (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 606#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 602#(or (< (+ i 1) N) (< (+ k 1) N)), 600#(< (+ i 1) N), 599#(< j M), 609#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 603#(or (<= N (+ i 1)) (< (+ 2 i) N)), 585#(or (<= (+ 2 k) N) (< j M)), 601#(or (< (+ i 1) N) (< j M)), 604#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N)), 605#(or (< (+ i 1) N) (< j M) (< (+ k 1) N)), 607#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< (+ k 1) N))] [2022-03-15 22:16:29,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 22:16:29,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 22:16:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:16:29,259 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 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:16:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:29,611 INFO L93 Difference]: Finished difference Result 84 states and 196 transitions. [2022-03-15 22:16:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-15 22:16:29,612 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 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 12 [2022-03-15 22:16:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:29,616 INFO L225 Difference]: With dead ends: 84 [2022-03-15 22:16:29,616 INFO L226 Difference]: Without dead ends: 84 [2022-03-15 22:16:29,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=810, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:16:29,620 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:29,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-03-15 22:16:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2022-03-15 22:16:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 2.830188679245283) internal successors, (150), 53 states have internal predecessors, (150), 0 states have call successors, (0), 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:16:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 150 transitions. [2022-03-15 22:16:29,640 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 150 transitions. Word has length 12 [2022-03-15 22:16:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:29,640 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 150 transitions. [2022-03-15 22:16:29,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 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:16:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 150 transitions. [2022-03-15 22:16:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:16:29,643 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:29,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:29,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:29,844 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:16:29,845 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:16:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:29,845 INFO L85 PathProgramCache]: Analyzing trace with hash 532723943, now seen corresponding path program 1 times [2022-03-15 22:16:29,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:29,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106940054] [2022-03-15 22:16:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:30,126 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:16:30,127 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:30,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106940054] [2022-03-15 22:16:30,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106940054] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:30,127 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762291151] [2022-03-15 22:16:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:30,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:30,129 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:16:30,133 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:16:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:30,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-15 22:16:30,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:30,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:30,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:30,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:30,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-03-15 22:16:30,613 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:16:30,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:31,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:31,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:31,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:31,062 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:16:31,062 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 71 [2022-03-15 22:16:31,355 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:16:31,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762291151] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:31,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:31,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-03-15 22:16:31,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963675911] [2022-03-15 22:16:31,356 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:31,357 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:31,361 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:16:31,361 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:35,260 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [918#(and (or sorted3 (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1)) (or (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1)) (or sorted2 (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1)))))), 924#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (= j 0) (not (= k 0))) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= k 0) (<= N 2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< 0 (+ k 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (select A i) (select A (+ i 1))) (not (= k 0))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0)))), 921#(and (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or (< (+ i 1) N) (< 0 (+ k 1))) (or (< (+ i 1) N) (<= k 0) (<= N 2)) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= k 0))) (or sorted3 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or sorted2 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0)))), 923#(and (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or (< (+ i 1) N) (< 0 (+ k 1))) (or (< (+ i 1) N) (<= k 0) (<= N 2)) (or (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (= j 0) (not (= k 0))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= k 0))) (or sorted3 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or sorted2 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0)))), 917#(and (or sorted3 (not sorted1) (< (+ k 1) N)) (or sorted2 (not sorted3) (< (+ k 1) N)) (or sorted1 (not sorted3) (< (+ k 1) N))), 919#(and (or sorted3 (< (+ i 1) N) (not sorted1)) (or sorted1 (not sorted3) (< (+ i 1) N)) (or sorted2 (< (+ i 1) N) (not sorted1))), 920#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 922#(and (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= k 0) (<= N 2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< 0 (+ k 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (select A i) (select A (+ i 1))) (not (= k 0))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (= k 0))))] [2022-03-15 22:16:35,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:16:35,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:35,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:16:35,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:16:35,262 INFO L87 Difference]: Start difference. First operand 54 states and 150 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 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:16:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:38,597 INFO L93 Difference]: Finished difference Result 253 states and 617 transitions. [2022-03-15 22:16:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-03-15 22:16:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 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 13 [2022-03-15 22:16:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:38,600 INFO L225 Difference]: With dead ends: 253 [2022-03-15 22:16:38,600 INFO L226 Difference]: Without dead ends: 237 [2022-03-15 22:16:38,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=430, Invalid=2326, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:16:38,602 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:38,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:16:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-03-15 22:16:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 88. [2022-03-15 22:16:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 3.1149425287356323) internal successors, (271), 87 states have internal predecessors, (271), 0 states have call successors, (0), 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:16:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 271 transitions. [2022-03-15 22:16:38,625 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 271 transitions. Word has length 13 [2022-03-15 22:16:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:38,625 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 271 transitions. [2022-03-15 22:16:38,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 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:16:38,626 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 271 transitions. [2022-03-15 22:16:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:16:38,626 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:38,627 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:38,651 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:16:38,847 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:16:38,848 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:16:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash 562628529, now seen corresponding path program 1 times [2022-03-15 22:16:38,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:38,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294339366] [2022-03-15 22:16:38,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:38,917 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:16:38,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:38,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294339366] [2022-03-15 22:16:38,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294339366] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:38,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615358596] [2022-03-15 22:16:38,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:38,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:38,920 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:16:38,921 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:16:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:38,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-15 22:16:38,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:39,042 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 43 treesize of output 27 [2022-03-15 22:16:39,137 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:16:39,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:39,373 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:16:39,373 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 66 treesize of output 78 [2022-03-15 22:16:39,712 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:16:39,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615358596] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:39,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:39,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-03-15 22:16:39,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1873452872] [2022-03-15 22:16:39,713 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:39,714 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:39,717 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 79 transitions. [2022-03-15 22:16:39,717 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:42,090 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1495#(and (or sorted2 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1)))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (not sorted2) (not (< (select A j) (select A (+ j 1)))))), 1494#(and (or (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted2 (not sorted1) (<= (select A (+ i 1)) (select A i))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted1 (not sorted2))), 1496#(and (or (<= (select A (+ j 1)) (select A j)) (< (select A i) (select A (+ i 1)))) (or sorted1 (<= (select A (+ j 1)) (select A j))) (or sorted2 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1)))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 1493#(and (or (not sorted1) (< (select A j) (select A (+ j 1)))) (or sorted3 (not sorted1)) (or sorted1 (<= (select A (+ j 1)) (select A j)) (not sorted2)) (or sorted2 (not sorted1)))] [2022-03-15 22:16:42,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 22:16:42,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 22:16:42,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:16:42,091 INFO L87 Difference]: Start difference. First operand 88 states and 271 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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:16:42,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:42,166 INFO L93 Difference]: Finished difference Result 121 states and 360 transitions. [2022-03-15 22:16:42,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-15 22:16:42,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have 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:16:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:42,168 INFO L225 Difference]: With dead ends: 121 [2022-03-15 22:16:42,168 INFO L226 Difference]: Without dead ends: 117 [2022-03-15 22:16:42,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 21 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:16:42,169 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:42,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-03-15 22:16:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 98. [2022-03-15 22:16:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.216494845360825) internal successors, (312), 97 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 312 transitions. [2022-03-15 22:16:42,174 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 312 transitions. Word has length 13 [2022-03-15 22:16:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:42,174 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 312 transitions. [2022-03-15 22:16:42,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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:16:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 312 transitions. [2022-03-15 22:16:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:16:42,175 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:42,175 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:42,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-15 22:16:42,395 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:16:42,396 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:16:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash 51557724, now seen corresponding path program 2 times [2022-03-15 22:16:42,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:42,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290687157] [2022-03-15 22:16:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:42,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:42,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290687157] [2022-03-15 22:16:42,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290687157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:42,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903642650] [2022-03-15 22:16:42,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:42,445 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:16:42,446 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:16:42,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:42,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:42,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:16:42,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:42,516 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:16:42,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:42,560 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:16:42,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903642650] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:42,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:42,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-15 22:16:42,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789099500] [2022-03-15 22:16:42,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:42,561 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:42,564 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 22:16:42,565 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:42,993 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [1903#(or (<= (+ 3 k) N) (< j M)), 1836#(< (+ k 1) N), 1898#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N)), 1897#(or (<= (+ 3 k) N) (< (+ i 1) N)), 1906#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 1900#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N)), 1907#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M)), 1908#(or (< j M) (<= (+ k 1) i)), 1910#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 1899#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 1896#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1904#(or (< (+ i 1) N) (< j M)), 1902#(or (< j M) (< (+ k 1) N)), 1909#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 1905#(or (<= (+ 3 k) N) (< (+ i 1) N) (< j M)), 1895#(< (+ i 1) N), 1901#(< j M)] [2022-03-15 22:16:42,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 22:16:42,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:42,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 22:16:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:16:42,995 INFO L87 Difference]: Start difference. First operand 98 states and 312 transitions. Second operand has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 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:16:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:43,901 INFO L93 Difference]: Finished difference Result 187 states and 543 transitions. [2022-03-15 22:16:43,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-15 22:16:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:16:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:43,903 INFO L225 Difference]: With dead ends: 187 [2022-03-15 22:16:43,903 INFO L226 Difference]: Without dead ends: 187 [2022-03-15 22:16:43,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=576, Invalid=2180, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:16:43,904 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 169 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:43,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 0 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:16:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-03-15 22:16:43,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 121. [2022-03-15 22:16:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 3.375) internal successors, (405), 120 states have internal predecessors, (405), 0 states have call successors, (0), 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:16:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 405 transitions. [2022-03-15 22:16:43,911 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 405 transitions. Word has length 13 [2022-03-15 22:16:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:43,912 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 405 transitions. [2022-03-15 22:16:43,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.608695652173913) internal successors, (60), 22 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:16:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 405 transitions. [2022-03-15 22:16:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:43,913 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:43,913 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:43,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-15 22:16:44,119 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:16:44,119 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:16:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:44,120 INFO L85 PathProgramCache]: Analyzing trace with hash -545399910, now seen corresponding path program 2 times [2022-03-15 22:16:44,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:44,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904295571] [2022-03-15 22:16:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:44,156 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:16:44,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:44,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904295571] [2022-03-15 22:16:44,157 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904295571] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:44,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550110700] [2022-03-15 22:16:44,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:44,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:44,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:44,158 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:16:44,159 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:16:44,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:44,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:44,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:16:44,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:44,258 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:16:44,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:44,290 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:16:44,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550110700] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:44,290 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:44,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-15 22:16:44,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607590635] [2022-03-15 22:16:44,290 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:44,291 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:44,295 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:16:44,295 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:44,681 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [2491#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 2487#(< (+ k 1) N), 2485#(< (+ i 1) N), 2489#(or (<= N (+ i 1)) (< (+ 2 i) N)), 2488#(or (<= N (+ k 1)) (< (+ 2 k) N)), 2486#(or (<= N (+ k 1)) (< (+ i 1) N)), 2493#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 2492#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 2490#(or (< (+ i 1) N) (<= N (+ 2 k)))] [2022-03-15 22:16:44,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:16:44,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:16:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:16:44,682 INFO L87 Difference]: Start difference. First operand 121 states and 405 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:45,113 INFO L93 Difference]: Finished difference Result 239 states and 748 transitions. [2022-03-15 22:16:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-15 22:16:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:16:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:45,115 INFO L225 Difference]: With dead ends: 239 [2022-03-15 22:16:45,115 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 22:16:45,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=367, Invalid=1039, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:16:45,116 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:45,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:45,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 22:16:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 153. [2022-03-15 22:16:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 3.335526315789474) internal successors, (507), 152 states have internal predecessors, (507), 0 states have call successors, (0), 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:16:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 507 transitions. [2022-03-15 22:16:45,126 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 507 transitions. Word has length 14 [2022-03-15 22:16:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:45,126 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 507 transitions. [2022-03-15 22:16:45,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 507 transitions. [2022-03-15 22:16:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:45,128 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:45,128 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:45,153 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:16:45,341 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:16:45,341 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:16:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:45,342 INFO L85 PathProgramCache]: Analyzing trace with hash 411546842, now seen corresponding path program 2 times [2022-03-15 22:16:45,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:45,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659655278] [2022-03-15 22:16:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:45,381 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:16:45,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:45,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659655278] [2022-03-15 22:16:45,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659655278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:45,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116044499] [2022-03-15 22:16:45,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:16:45,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:45,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:45,383 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:16:45,393 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:16:45,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:16:45,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:45,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:16:45,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:45,473 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:16:45,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:45,514 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:16:45,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116044499] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:45,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:45,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 22:16:45,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803773020] [2022-03-15 22:16:45,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:45,515 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:45,523 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 105 transitions. [2022-03-15 22:16:45,524 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:46,078 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [3171#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 3163#(< j M), 3167#(or (< (+ i 1) N) (< j M)), 3175#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 3168#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 3170#(or (<= N (+ i 1)) (< (+ 2 i) N)), 3164#(or (< (+ j 1) M) (<= M j)), 3174#(or (< (+ i 1) N) (<= M j)), 3165#(or (< (+ 2 j) M) (<= M (+ j 1))), 3169#(or (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 3172#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 3155#(or (< (+ i 1) N) (<= M (+ j 1))), 3173#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 3176#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 3166#(< (+ i 1) N)] [2022-03-15 22:16:46,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:16:46,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:16:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:16:46,079 INFO L87 Difference]: Start difference. First operand 153 states and 507 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:46,454 INFO L93 Difference]: Finished difference Result 338 states and 1107 transitions. [2022-03-15 22:16:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 22:16:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:16:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:46,457 INFO L225 Difference]: With dead ends: 338 [2022-03-15 22:16:46,457 INFO L226 Difference]: Without dead ends: 322 [2022-03-15 22:16:46,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=873, Unknown=0, NotChecked=0, Total=1190 [2022-03-15 22:16:46,458 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:46,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:16:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-03-15 22:16:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 188. [2022-03-15 22:16:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 3.443850267379679) internal successors, (644), 187 states have internal predecessors, (644), 0 states have call successors, (0), 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:16:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 644 transitions. [2022-03-15 22:16:46,463 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 644 transitions. Word has length 14 [2022-03-15 22:16:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:46,464 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 644 transitions. [2022-03-15 22:16:46,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 20 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 644 transitions. [2022-03-15 22:16:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:46,465 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:46,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:46,490 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:16:46,687 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:16:46,688 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:16:46,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:46,688 INFO L85 PathProgramCache]: Analyzing trace with hash 206756834, now seen corresponding path program 1 times [2022-03-15 22:16:46,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:46,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611932005] [2022-03-15 22:16:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:46,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:46,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611932005] [2022-03-15 22:16:46,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611932005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:46,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212689395] [2022-03-15 22:16:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:46,737 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:16:46,738 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:16:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:46,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:16:46,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:46,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:46,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212689395] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:46,910 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:46,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-03-15 22:16:46,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365705430] [2022-03-15 22:16:46,912 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:46,913 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:46,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 110 transitions. [2022-03-15 22:16:46,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:47,661 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [4006#(or (<= N (+ k 1)) (< (+ 2 k) N)), 4008#(< (+ i 1) N), 4020#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 2 k j))), 4003#(< (+ k 1) N), 4012#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N)), 4015#(or (< (+ j 1) M) (<= M j)), 4005#(or (< j M) (< (+ k 1) N)), 4019#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 4017#(or (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 4013#(or (< (+ i 1) N) (<= M j)), 4009#(or (< (+ i 1) N) (< (+ k 1) N)), 4007#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 4016#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 4018#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N)), 4004#(< j M), 4014#(or (< (+ i 1) N) (<= (+ N M) (+ 2 k j))), 4010#(or (<= N (+ k 1)) (< (+ i 1) N) (< (+ 2 k) N)), 4011#(or (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:16:47,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:16:47,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:47,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:16:47,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:16:47,662 INFO L87 Difference]: Start difference. First operand 188 states and 644 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:50,146 INFO L93 Difference]: Finished difference Result 419 states and 1321 transitions. [2022-03-15 22:16:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-03-15 22:16:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:16:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:50,149 INFO L225 Difference]: With dead ends: 419 [2022-03-15 22:16:50,149 INFO L226 Difference]: Without dead ends: 402 [2022-03-15 22:16:50,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3126 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2171, Invalid=8749, Unknown=0, NotChecked=0, Total=10920 [2022-03-15 22:16:50,152 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:50,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:16:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-03-15 22:16:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 187. [2022-03-15 22:16:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 3.3978494623655915) internal successors, (632), 186 states have internal predecessors, (632), 0 states have call successors, (0), 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:16:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 632 transitions. [2022-03-15 22:16:50,160 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 632 transitions. Word has length 14 [2022-03-15 22:16:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:50,161 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 632 transitions. [2022-03-15 22:16:50,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 632 transitions. [2022-03-15 22:16:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:50,162 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:50,162 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:50,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:50,375 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:16:50,375 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:16:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -296564481, now seen corresponding path program 3 times [2022-03-15 22:16:50,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:50,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568434598] [2022-03-15 22:16:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:16:50,441 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:50,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568434598] [2022-03-15 22:16:50,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568434598] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:50,441 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348216927] [2022-03-15 22:16:50,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:16:50,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:50,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:50,443 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:16:50,455 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:16:50,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:16:50,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:50,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:16:50,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:50,547 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:16:50,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:50,634 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:16:50,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348216927] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:50,634 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:50,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-03-15 22:16:50,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2093468533] [2022-03-15 22:16:50,634 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:50,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:50,639 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 102 transitions. [2022-03-15 22:16:50,639 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:51,589 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 28 new interpolants: [5074#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 5079#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ k 1) N)), 5062#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 5078#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 5072#(or (<= (+ 3 k j) (+ N M)) (< (+ i 1) N)), 5059#(< j M), 5061#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 5064#(or (< (+ i 1) N) (< (+ k 1) N)), 5076#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 5057#(< (+ i 1) N), 5058#(or (<= N (+ i 1)) (< (+ 2 i) N)), 5066#(or (< (+ i 1) N) (< j M) (< (+ k 1) N)), 5065#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N)), 5063#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 5071#(or (< (+ j 1) M) (< (+ i 1) N) (< (+ k 1) N) (<= M j)), 5073#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< (+ k 1) N)), 5067#(or (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 5068#(or (< (+ j 1) M) (<= M j)), 5080#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< (+ k 1) N)), 5069#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 5077#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 5070#(or (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 5083#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 5082#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (< (+ k 1) N) (<= M j)), 5060#(or (< (+ i 1) N) (< j M)), 5075#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (< (+ k 1) N) (<= M j)), 5035#(or (<= (+ 2 k) N) (< j M)), 5081#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N))] [2022-03-15 22:16:51,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:16:51,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:16:51,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=1463, Unknown=0, NotChecked=0, Total=1722 [2022-03-15 22:16:51,591 INFO L87 Difference]: Start difference. First operand 187 states and 632 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:55,144 INFO L93 Difference]: Finished difference Result 484 states and 1439 transitions. [2022-03-15 22:16:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-03-15 22:16:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:16:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:55,148 INFO L225 Difference]: With dead ends: 484 [2022-03-15 22:16:55,148 INFO L226 Difference]: Without dead ends: 484 [2022-03-15 22:16:55,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6467 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3912, Invalid=17844, Unknown=0, NotChecked=0, Total=21756 [2022-03-15 22:16:55,153 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:55,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 0 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:16:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2022-03-15 22:16:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 277. [2022-03-15 22:16:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.5942028985507246) internal successors, (992), 276 states have internal predecessors, (992), 0 states have call successors, (0), 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:16:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 992 transitions. [2022-03-15 22:16:55,165 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 992 transitions. Word has length 14 [2022-03-15 22:16:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:55,165 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 992 transitions. [2022-03-15 22:16:55,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 34 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 992 transitions. [2022-03-15 22:16:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:55,166 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:55,166 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:55,190 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:16:55,383 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:16:55,383 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:16:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1236874310, now seen corresponding path program 3 times [2022-03-15 22:16:55,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:55,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003213003] [2022-03-15 22:16:55,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:55,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 22:16:55,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:55,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003213003] [2022-03-15 22:16:55,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003213003] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:16:55,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:16:55,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-15 22:16:55,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1126624957] [2022-03-15 22:16:55,410 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:55,411 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:55,414 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 83 transitions. [2022-03-15 22:16:55,414 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:55,653 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [6340#(< j M), 6339#(< (+ k 1) N), 6342#(or (< j M) (< (+ k 1) N)), 6343#(or (<= k i) (< j M)), 6341#(or (<= N (+ i 1)) (< j M))] [2022-03-15 22:16:55,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:16:55,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:55,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:16:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-03-15 22:16:55,654 INFO L87 Difference]: Start difference. First operand 277 states and 992 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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:16:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:55,856 INFO L93 Difference]: Finished difference Result 326 states and 1104 transitions. [2022-03-15 22:16:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:16:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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 14 [2022-03-15 22:16:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:55,858 INFO L225 Difference]: With dead ends: 326 [2022-03-15 22:16:55,858 INFO L226 Difference]: Without dead ends: 325 [2022-03-15 22:16:55,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:16:55,859 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:55,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:16:55,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-03-15 22:16:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 277. [2022-03-15 22:16:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 3.5833333333333335) internal successors, (989), 276 states have internal predecessors, (989), 0 states have call successors, (0), 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:16:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 989 transitions. [2022-03-15 22:16:55,868 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 989 transitions. Word has length 14 [2022-03-15 22:16:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:55,868 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 989 transitions. [2022-03-15 22:16:55,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 9 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:16:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 989 transitions. [2022-03-15 22:16:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:16:55,869 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:55,869 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:55,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-15 22:16:55,869 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:16:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash 808471973, now seen corresponding path program 3 times [2022-03-15 22:16:55,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:55,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807523741] [2022-03-15 22:16:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:55,905 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:16:55,906 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:55,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807523741] [2022-03-15 22:16:55,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807523741] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:55,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829276937] [2022-03-15 22:16:55,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:16:55,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:55,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:55,907 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:16:55,908 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:16:55,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:16:55,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:55,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:16:55,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:55,965 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:16:55,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:56,000 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:16:56,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829276937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:56,001 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:56,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:16:56,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155435883] [2022-03-15 22:16:56,001 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:56,001 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:56,004 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:16:56,004 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:16:56,445 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7332#(or (<= N (+ k 1)) (< (+ 2 k) N)), 7322#(or (<= k i) (< j M)), 7337#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 7329#(< j M), 7338#(or (<= N (+ i 1)) (< j M) (< (+ k 1) N)), 7335#(or (<= N (+ 2 i)) (< j M)), 7331#(or (< j M) (< (+ k 1) N)), 7330#(< (+ k 1) N), 7333#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 7334#(or (<= N (+ i 1)) (< j M)), 7340#(or (< j M) (<= k (+ i 1))), 7339#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 7336#(or (<= N (+ i 1)) (< (+ k 1) N))] [2022-03-15 22:16:56,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-15 22:16:56,445 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:16:56,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-15 22:16:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-03-15 22:16:56,446 INFO L87 Difference]: Start difference. First operand 277 states and 989 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:57,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:16:57,237 INFO L93 Difference]: Finished difference Result 487 states and 1591 transitions. [2022-03-15 22:16:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-15 22:16:57,237 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:16:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:16:57,240 INFO L225 Difference]: With dead ends: 487 [2022-03-15 22:16:57,240 INFO L226 Difference]: Without dead ends: 481 [2022-03-15 22:16:57,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=818, Invalid=2722, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:16:57,241 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:57,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:16:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-15 22:16:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 316. [2022-03-15 22:16:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.6317460317460317) internal successors, (1144), 315 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1144 transitions. [2022-03-15 22:16:57,253 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 1144 transitions. Word has length 14 [2022-03-15 22:16:57,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:16:57,253 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 1144 transitions. [2022-03-15 22:16:57,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:16:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 1144 transitions. [2022-03-15 22:16:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:16:57,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:16:57,254 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:16:57,278 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:16:57,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:16:57,467 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:16:57,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:16:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1410579444, now seen corresponding path program 4 times [2022-03-15 22:16:57,468 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:16:57,468 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275248989] [2022-03-15 22:16:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:16:57,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:16:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:16:57,831 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:16:57,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:16:57,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275248989] [2022-03-15 22:16:57,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275248989] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:16:57,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413552060] [2022-03-15 22:16:57,831 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:16:57,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:16:57,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:16:57,833 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:16:57,834 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:16:57,860 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:16:57,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:16:57,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 25 conjunts are in the unsatisfiable core [2022-03-15 22:16:57,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:16:58,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:58,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:58,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:58,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:58,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:58,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:16:58,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:58,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:16:58,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 52 [2022-03-15 22:16:58,297 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:16:58,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:16:58,785 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:16:58,785 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 109 treesize of output 137 [2022-03-15 22:16:59,940 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:16:59,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413552060] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:16:59,941 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:16:59,941 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-03-15 22:16:59,941 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376631618] [2022-03-15 22:16:59,941 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:16:59,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:16:59,946 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:16:59,946 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:06,391 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [8660#(and (or (not sorted3) (< j M) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1))))) (or (< j M) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k))) (or sorted2 (not sorted3) (< j M)) (or sorted3 (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))))), 8662#(and (or (<= (select A (+ k 1)) (select A k)) (= j 0)) (or sorted1 (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (not (< (select A k) (select A (+ k 1))))) (or (< j M) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (not sorted1) (= j 0) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or sorted3 (< j M) (<= (select A (+ k 1)) (select A k))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or (< j M) (< 0 (+ k 1))) (or (< j M) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (= j 0) (< 0 (+ k 1))) (or sorted2 (< j M) (not (< (select A k) (select A (+ k 1)))))), 8651#(and (or sorted2 (not sorted3)) (or (not sorted3) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (not sorted3) (<= (select A (+ k 1)) (select A k))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 8646#(and (or sorted1 (not sorted3) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or sorted3 (not sorted1)) (or (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted2 (not sorted3) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (not sorted1))), 8661#(and (or sorted1 (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (not (< (select A k) (select A (+ k 1))))) (or (< j M) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or sorted3 (< j M) (<= (select A (+ k 1)) (select A k))) (or (< j M) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or (< j M) (< 0 (+ k 1))) (or (< j M) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or sorted2 (< j M) (not (< (select A k) (select A (+ k 1)))))), 8648#(and (or (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or sorted3 (< j M) (<= (select A (+ k 1)) (select A k))) (or (< j M) (< 0 (+ k 1))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (< j M) (not sorted1)) (or sorted1 (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or sorted2 (< j M) (<= (select A (+ k 1)) (select A k)))), 8658#(and (or sorted2 (not (< (select A k) (select A (+ k 1))))) (or (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or sorted1 (<= (select A (+ 2 k)) (select A (+ k 1))) (not (< (select A k) (select A (+ k 1))))) (< 0 (+ k 1)) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or sorted3 (<= (select A (+ k 1)) (select A k))) (or (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k)))))), 8654#(and (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or sorted3 (< j M) (<= (select A (+ k 1)) (select A k))) (or (< j M) (< 0 (+ k 1))) (or (< j M) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or sorted1 (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (< j M) (not (< (select A k) (select A (+ k 1)))))), 8656#(and (or sorted2 (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i)))) (or (not sorted3) (< (select A i) (select A (+ i 1)))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or sorted1 (not sorted3))), 8647#(and (or (< j M) (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted1 (not sorted3) (< j M) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< j M) (not sorted1)) (or sorted2 (not sorted3) (< j M) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or sorted3 (< j M) (not sorted1))), 8657#(and (or sorted2 (not sorted3)) (or (not sorted3) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1))))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or sorted1 (not sorted3) (<= (select A (+ k 1)) (select A k))) (or (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i))))) (or (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (not (< (select A k) (select A (+ k 1)))))), 8655#(and (or (<= (select A (+ k 1)) (select A k)) (= j 0)) (or (< j M) (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or (not sorted1) (= j 0) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (< j M) (<= (select A (+ k 1)) (select A k))) (or (< j M) (< 0 (+ k 1))) (or (< j M) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k))))) (or sorted1 (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (<= 1 M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (= j 0) (< 0 (+ k 1))) (or sorted2 (< j M) (not (< (select A k) (select A (+ k 1)))))), 8643#(and (or sorted3 (not sorted1)) (or sorted1 (not sorted3) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (not sorted3) (not (< (select A k) (select A (+ k 1))))) (or (< (select A k) (select A (+ k 1))) (not sorted1))), 8642#(and (or sorted1 (not sorted3) (< j M)) (or sorted2 (< j M) (not sorted1)) (or sorted3 (< j M) (not sorted1))), 8652#(and (or sorted3 (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not sorted3) (< j M) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k))) (or sorted2 (not sorted3) (< j M)) (or (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 8644#(and (or (< j M) (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted1 (not sorted3) (< j M) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (not sorted3) (< j M) (not (< (select A k) (select A (+ k 1))))) (or sorted3 (< j M) (not sorted1))), 8649#(and (or (not sorted3) (< (select A i) (select A (+ i 1)))) (or sorted2 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted1 (not sorted3))), 8653#(and (or sorted2 (not (< (select A k) (select A (+ k 1))))) (or (<= (select A (+ k 1)) (select A k)) (<= k 0)) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (< 0 (+ k 1)) (or sorted1 (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1)))) (or (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (<= (select A (+ k 1)) (select A k))) (or (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))) (not (< (select A (+ k 1)) (select A (+ 2 k)))))), 8650#(and (or sorted3 (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted1 (not sorted3) (< j M)) (or (not sorted3) (< j M) (< (select A i) (select A (+ i 1)))) (or sorted2 (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 8659#(and (or sorted2 (< j M) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i)))) (or sorted1 (not sorted3) (< j M)) (or (not sorted3) (< j M) (< (select A i) (select A (+ i 1)))) (or sorted3 (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))))), 8645#(and (or (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or sorted1 (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k))) (or sorted2 (not sorted3) (< j M)) (or sorted3 (< j M) (not sorted1)))] [2022-03-15 22:17:06,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:17:06,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:06,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:17:06,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1484, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:17:06,392 INFO L87 Difference]: Start difference. First operand 316 states and 1144 transitions. Second operand has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:17:07,665 INFO L93 Difference]: Finished difference Result 409 states and 1412 transitions. [2022-03-15 22:17:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-15 22:17:07,665 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:17:07,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:17:07,667 INFO L225 Difference]: With dead ends: 409 [2022-03-15 22:17:07,667 INFO L226 Difference]: Without dead ends: 393 [2022-03-15 22:17:07,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=239, Invalid=2211, Unknown=0, NotChecked=0, Total=2450 [2022-03-15 22:17:07,669 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:17:07,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-15 22:17:07,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-03-15 22:17:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 348. [2022-03-15 22:17:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 3.5706051873198845) internal successors, (1239), 347 states have internal predecessors, (1239), 0 states have call successors, (0), 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:17:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1239 transitions. [2022-03-15 22:17:07,679 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1239 transitions. Word has length 15 [2022-03-15 22:17:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:17:07,679 INFO L470 AbstractCegarLoop]: Abstraction has 348 states and 1239 transitions. [2022-03-15 22:17:07,679 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:17:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1239 transitions. [2022-03-15 22:17:07,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:17:07,681 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:17:07,681 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:17:07,704 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:17:07,899 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,SelfDestructingSolverStorable13 [2022-03-15 22:17:07,899 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:17:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:17:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash -483537278, now seen corresponding path program 2 times [2022-03-15 22:17:07,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:17:07,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483489295] [2022-03-15 22:17:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:17:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:17:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:17:08,243 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:17:08,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:17:08,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483489295] [2022-03-15 22:17:08,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483489295] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:17:08,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352736262] [2022-03-15 22:17:08,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:17:08,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:17:08,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:17:08,244 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:17:08,245 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:17:08,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:17:08,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:17:08,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjunts are in the unsatisfiable core [2022-03-15 22:17:08,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:17:08,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:08,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:08,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:08,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:08,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:17:08,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:08,614 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 84 treesize of output 48 [2022-03-15 22:17:08,713 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:17:08,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:17:09,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:17:09,303 INFO L353 Elim1Store]: treesize reduction 58, result has 72.0 percent of original size [2022-03-15 22:17:09,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 105 treesize of output 201 [2022-03-15 22:17:22,181 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:17:22,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352736262] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:17:22,182 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:17:22,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:17:22,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1582837481] [2022-03-15 22:17:22,182 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:17:22,183 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:17:22,188 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 141 transitions. [2022-03-15 22:17:22,188 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:17:34,289 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 38 new interpolants: [9908#(and (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 9917#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2))), 9898#(and (or sorted1 (not sorted3) (< (+ i 1) N) (not sorted2) (< (+ k 1) N)) (or sorted3 (< (+ i 1) N) (not sorted1) (< (+ k 1) N)) (or sorted2 (< (+ i 1) N) (not sorted1) (< (+ k 1) N))), 9900#(and (or sorted3 (< (+ i 1) N) (< j M) (not sorted1)) (or sorted2 (< (+ i 1) N) (< j M) (not sorted1)) (or sorted1 (not sorted3) (< (+ i 1) N) (< j M) (not sorted2))), 9909#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not sorted2)) (or sorted2 (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (<= N (+ i 1)) sorted3 (<= (+ 3 k) N) (< (+ 2 i) N))), 9902#(and (or sorted1 (<= (+ 3 k) N) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not sorted2) (<= (+ j 1) M)) (or sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= (+ j 1) M)) (or sorted3 (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ j 1) M)) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= (+ j 1) M))), 9923#(and (or sorted2 (<= (+ 3 k) N) (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted3 (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (not sorted2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2))), 9904#(and (or sorted2 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (+ k 1) N)) (or sorted1 (< (+ j 1) M) (not sorted3) (< (+ i 1) N) (not (< j M)) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (< (+ k 1) N) (<= M j)) (or (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (+ k 1) N) (< (select A j) (select A (+ j 1))))), 9912#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted2 (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (<= N (+ i 1)) sorted3 (<= (+ 3 k) N) (< (+ 2 i) N) (< j M)) (or sorted1 (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (not sorted2)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 9916#(and (or sorted3 (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= 2 M)) (or sorted2 (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (<= 2 M) (not (< (select A i) (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= 2 M) (not (< (select A i) (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= j 0)) (or sorted1 (<= (+ 3 k) N) (<= (select A (+ j 1)) (select A j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= 2 M)) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (<= 2 M) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= (+ 3 k) N) (<= (select A (+ j 1)) (select A j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (select A i) (select A (+ i 1))) (<= 2 M))), 9914#(and (or sorted3 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 9899#(and (or sorted1 (<= (+ 3 k) N) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not sorted2)) (or sorted3 (<= (+ 3 k) N) (< (+ i 1) N)) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1))), 9907#(and (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 9913#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1))))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1))))), 9911#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (not sorted2) (< (+ k 1) N)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N))), 9919#(and (or sorted1 (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (not sorted2) (<= M j)) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j)) (or sorted2 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or sorted3 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (<= M j)) (or (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (<= M j))), 9897#(and (or sorted1 (not sorted3) (< (+ i 1) N) (not sorted2)) (or sorted3 (< (+ i 1) N) (not sorted1)) (or sorted2 (< (+ i 1) N) (not sorted1))), 9925#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ j 1) M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 9906#(and (or sorted1 (<= (+ 3 k) N) (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= 2 M)) (or (<= (+ 3 k) N) (< (+ i 1) N) (= j 0)) (or sorted3 (<= (+ 3 k) N) (< (+ i 1) N) (<= 2 M)) (or (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= 2 M) (<= (+ (select A j) 1) (select A (+ j 1)))) (or sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= 2 M)) (or (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= 2 M))), 9903#(and (or (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M))) (or sorted3 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (<= M j)) (or sorted1 (< (+ j 1) M) (not sorted3) (< (+ i 1) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1)))))), 9924#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2)) (or sorted3 (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (not sorted2))), 9921#(and (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 9920#(and (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 9891#(and (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (not sorted1)) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted1 (<= (+ 3 k) N) (not (< (+ k 1) N)) (not sorted3) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or sorted3 (<= (+ 3 k) N) (not (< (+ k 1) N)) (not sorted1))), 9893#(and (or sorted1 (< (+ j 1) M) (not sorted3) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ j 1) M) (not sorted1) (not (< j M))) (or sorted3 (< (+ j 1) M) (not sorted1) (<= M j))), 9922#(and (or (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N) (<= M j)) (or sorted3 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j)) (or (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (<= M j)) (or sorted2 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or sorted1 (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N) (<= M j))), 9890#(and (or sorted1 (not sorted3) (<= (+ 2 k) N) (< j M) (not sorted2)) (or sorted2 (<= (+ 2 k) N) (< j M) (not sorted1)) (or sorted3 (<= (+ 2 k) N) (< j M) (not sorted1))), 9915#(and (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j)) (or sorted3 (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= M j)) (or sorted2 (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1)))) (or sorted1 (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= (+ 3 k) N) (not (< (+ i 1) N)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1)))))), 9918#(and (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2))), 9901#(and (or sorted3 (< (+ i 1) N) (< j M) (not sorted1) (< (+ k 1) N)) (or sorted1 (not sorted3) (< (+ i 1) N) (< j M) (not sorted2) (< (+ k 1) N)) (or sorted2 (< (+ i 1) N) (< j M) (not sorted1) (< (+ k 1) N))), 9896#(and (or sorted3 (<= (+ 3 k) N) (<= (+ 2 j) M) (<= M j)) (or (<= (+ 3 k) N) (<= (+ 2 j) M) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (<= (+ 3 k) N) (<= (+ 2 j) M) (not sorted1) (not (< j M))) (or sorted1 (<= (+ 3 k) N) (<= (+ 2 j) M) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= (+ 3 k) N) (<= (+ 2 j) M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= M j))), 9895#(and (or sorted1 (< (+ j 1) M) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (not (< j M)) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (not (< j M))) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1) (<= M j)) (or sorted3 (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (<= M j)) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1))))), 9926#(and (or sorted1 (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (<= 2 M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= 2 M) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0)) (or sorted3 (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N) (<= 2 M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= 2 M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (+ (select A j) 1) (select A (+ j 1)))) (or sorted2 (<= (+ 3 k) N) (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= 2 M) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= 2 M)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= 2 M))), 9905#(and (or sorted3 (<= (+ 3 k) N) (<= (+ 2 j) M) (< (+ i 1) N) (<= M j)) (or (<= (+ 3 k) N) (<= (+ 2 j) M) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= M j)) (or sorted1 (<= (+ 3 k) N) (<= (+ 2 j) M) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (<= (+ 3 k) N) (<= (+ 2 j) M) (< (+ i 1) N) (not sorted1) (not (< j M))) (or (<= (+ 3 k) N) (<= (+ 2 j) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1))))), 9892#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted3 (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (not sorted1)) (or sorted1 (<= (+ 3 k) N) (not (< (+ k 1) N)) (not sorted3) (< j M) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< j M) (not sorted1))), 9910#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (not sorted2)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 9894#(and (or sorted3 (< (+ j 1) M) (not sorted1) (< (+ k 1) N) (<= M j)) (or sorted2 (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ k 1) N)) (or sorted1 (< (+ j 1) M) (not sorted3) (not (< j M)) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ k 1) N) (< (select A j) (select A (+ j 1))))), 9889#(and (or sorted1 (not sorted3) (< j M) (not sorted2)) (or sorted2 (< j M) (not sorted1)) (or sorted3 (< j M) (not sorted1)))] [2022-03-15 22:17:34,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:17:34,290 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:17:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:17:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2944, Unknown=0, NotChecked=0, Total=3192 [2022-03-15 22:17:34,291 INFO L87 Difference]: Start difference. First operand 348 states and 1239 transitions. Second operand has 47 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 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:18:58,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:18:58,088 INFO L93 Difference]: Finished difference Result 1430 states and 3961 transitions. [2022-03-15 22:18:58,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-03-15 22:18:58,089 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 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 15 [2022-03-15 22:18:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:18:58,095 INFO L225 Difference]: With dead ends: 1430 [2022-03-15 22:18:58,096 INFO L226 Difference]: Without dead ends: 1374 [2022-03-15 22:18:58,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33503 ImplicationChecksByTransitivity, 83.9s TimeCoverageRelationStatistics Valid=11260, Invalid=80246, Unknown=0, NotChecked=0, Total=91506 [2022-03-15 22:18:58,111 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1275 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:18:58,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1275 Valid, 0 Invalid, 3891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-03-15 22:18:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-03-15 22:18:58,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 398. [2022-03-15 22:18:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 3.6851385390428213) internal successors, (1463), 397 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:18:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1463 transitions. [2022-03-15 22:18:58,152 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1463 transitions. Word has length 15 [2022-03-15 22:18:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:18:58,154 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 1463 transitions. [2022-03-15 22:18:58,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 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:18:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1463 transitions. [2022-03-15 22:18:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:18:58,156 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:18:58,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:18:58,183 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:18:58,375 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,SelfDestructingSolverStorable14 [2022-03-15 22:18:58,375 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:18:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:18:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -453632692, now seen corresponding path program 4 times [2022-03-15 22:18:58,377 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:18:58,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142934005] [2022-03-15 22:18:58,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:18:58,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:18:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:18:58,600 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:18:58,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:18:58,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142934005] [2022-03-15 22:18:58,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142934005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:18:58,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273741405] [2022-03-15 22:18:58,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:18:58,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:18:58,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:18:58,601 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:18:58,602 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:18:58,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:18:58,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:18:58,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 22:18:58,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:18:58,853 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 88 treesize of output 56 [2022-03-15 22:18:58,963 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:18:58,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:18:59,393 INFO L353 Elim1Store]: treesize reduction 76, result has 52.8 percent of original size [2022-03-15 22:18:59,394 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 109 treesize of output 137 [2022-03-15 22:19:00,908 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:19:00,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273741405] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:00,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:00,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-03-15 22:19:00,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391387156] [2022-03-15 22:19:00,911 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:00,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:00,917 INFO L252 McrAutomatonBuilder]: Finished intersection with 66 states and 136 transitions. [2022-03-15 22:19:00,917 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:10,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [12760#(and (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ 2 i)) (< (+ j 1) M) (< (select A (+ i 1)) (select A (+ 2 i))) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (<= N (+ 2 i)) (< (+ j 1) M) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted3 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 12749#(and (or sorted1 (< (+ i 1) N) (< j M) (not sorted2)) (or sorted2 (< (+ i 1) N) (< j M) (not sorted1)) (or sorted3 (< (+ i 1) N) (< j M) (not sorted2))), 12757#(and (or sorted2 (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M) (< (select A j) (select A (+ j 1))))), 12764#(and (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1))) (<= M j)) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j))), 12751#(and (or (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M))) (or sorted1 (< (+ j 1) M) (< (+ i 1) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (< (+ i 1) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1)))))), 12759#(and (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (not sorted2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 12761#(and (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ 2 i)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)))), 12747#(and (or sorted1 (< j M) (not sorted2)) (or sorted2 (< j M) (not sorted1)) (or sorted3 (< j M) (not sorted1))), 12755#(and (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted2)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1))) (not sorted2))), 12765#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ i 1)) sorted3 (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= M (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= M (+ 2 j))) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (<= M (+ j 1)) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< M (+ 2 j))) (or (<= N (+ i 1)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= M (+ j 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (select A i) (select A (+ i 1))) (<= M (+ j 1)) (not (< (select A j) (select A (+ j 1)))))), 12756#(and (or sorted3 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j)) (or sorted2 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1))))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1))))), 12753#(and (or sorted3 (not (< (+ j 1) M)) (< (+ i 1) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (not (< (+ j 1) M)) (< (+ i 1) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (< (select A j) (select A (+ j 1)))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M)) (or sorted2 (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M))), 12766#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j)) (or sorted1 (<= N (+ 2 i)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j))), 12767#(and (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= M (+ j 1))) (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or sorted2 (<= N (+ 2 i)) (< (+ 3 i) N) (< M (+ 2 j))) (or (<= N (+ 2 i)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ 2 i)) (<= M (+ 2 j)) (< (+ 3 i) N)) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (+ 3 i) N) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= M (+ j 1)))), 12754#(and (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2))), 12763#(and (or sorted3 (< (+ i 1) N) (not sorted1) (< M (+ 2 j))) (or (< (+ i 1) N) (<= M (+ 2 j))) (or (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (select A j) (select A (+ j 1)))) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (< M (+ 2 j))) (or sorted2 (< (+ i 1) N) (< M (+ 2 j))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ i 1) N) (not sorted1))), 12748#(and (or sorted3 (< (+ i 1) N) (not sorted2)) (or sorted2 (< (+ i 1) N) (not sorted1)) (or sorted1 (< (+ i 1) N) (not sorted2))), 12750#(and (or sorted1 (< (+ j 1) M) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ j 1) M) (not sorted1) (not (< j M)))), 12762#(and (or sorted2 (< (+ i 1) N) (not sorted1) (<= M j)) (or sorted3 (< (+ i 1) N) (not sorted1) (<= M j)) (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (not sorted2) (<= M j)) (or (< (+ i 1) N) (not sorted1) (<= (+ (select A j) 1) (select A (+ j 1))) (<= M j))), 12752#(and (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 2 j) M)) (or sorted2 (not (< (+ j 1) M)) (not sorted1) (< (+ 2 j) M)) (or sorted3 (not (< (+ j 1) M)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ j 1) M)) (not sorted1) (< (+ 2 j) M) (< (select A j) (select A (+ j 1)))) (or sorted1 (not (< (+ j 1) M)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1)))))), 12758#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (< (+ 3 i) N) (not sorted2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2)))] [2022-03-15 22:19:10,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-03-15 22:19:10,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-03-15 22:19:10,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:19:10,723 INFO L87 Difference]: Start difference. First operand 398 states and 1463 transitions. Second operand has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 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:19:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:24,414 INFO L93 Difference]: Finished difference Result 920 states and 2971 transitions. [2022-03-15 22:19:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-03-15 22:19:24,415 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 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:19:24,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:24,420 INFO L225 Difference]: With dead ends: 920 [2022-03-15 22:19:24,420 INFO L226 Difference]: Without dead ends: 892 [2022-03-15 22:19:24,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 38 SyntacticMatches, 9 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2631 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=1750, Invalid=6992, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:19:24,422 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 392 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:24,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 0 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:19:24,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-03-15 22:19:24,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 474. [2022-03-15 22:19:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 3.697674418604651) internal successors, (1749), 473 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1749 transitions. [2022-03-15 22:19:24,437 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1749 transitions. Word has length 15 [2022-03-15 22:19:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:24,438 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1749 transitions. [2022-03-15 22:19:24,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 28 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:19:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1749 transitions. [2022-03-15 22:19:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:19:24,439 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:24,439 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:24,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:24,664 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,SelfDestructingSolverStorable15 [2022-03-15 22:19:24,664 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:19:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:24,665 INFO L85 PathProgramCache]: Analyzing trace with hash 306387245, now seen corresponding path program 5 times [2022-03-15 22:19:24,665 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:24,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963584986] [2022-03-15 22:19:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:24,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:24,711 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:19:24,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:24,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963584986] [2022-03-15 22:19:24,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963584986] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:24,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286530530] [2022-03-15 22:19:24,711 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:19:24,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:24,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:24,713 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:19:24,719 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:19:24,743 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:19:24,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:24,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:19:24,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:24,798 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:19:24,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:24,862 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:19:24,862 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286530530] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:24,862 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:24,862 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-15 22:19:24,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831639846] [2022-03-15 22:19:24,863 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:24,864 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:24,868 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 125 transitions. [2022-03-15 22:19:24,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:25,561 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [14848#(or (< j M) (< (+ k 1) N)), 14854#(or (<= N (+ 2 i)) (< (+ k 1) N)), 14851#(or (< (+ j 1) M) (<= M j)), 14858#(or (< (+ j 1) M) (<= N i) (< (+ k 1) N) (<= M j)), 14855#(or (<= N (+ i 1)) (< j M)), 14847#(< (+ k 1) N), 14859#(or (<= (+ N j) (+ 2 M i)) (< (+ k 1) N)), 14850#(or (<= N i) (< j M) (< (+ k 1) N)), 14852#(or (< (+ j 1) M) (<= N i) (<= M j)), 14849#(or (<= N i) (< (+ k 1) N)), 14853#(or (<= N (+ i 1)) (< (+ k 1) N)), 14857#(or (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 14861#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 14846#(or (<= N i) (< j M)), 14856#(or (<= N (+ i 1)) (< j M) (< (+ k 1) N)), 14845#(< j M), 14860#(or (<= N (+ i 1)) (< (+ j 1) M) (<= M j))] [2022-03-15 22:19:25,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-15 22:19:25,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:25,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-15 22:19:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2022-03-15 22:19:25,562 INFO L87 Difference]: Start difference. First operand 474 states and 1749 transitions. Second operand has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 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:19:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:26,358 INFO L93 Difference]: Finished difference Result 642 states and 2170 transitions. [2022-03-15 22:19:26,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-03-15 22:19:26,358 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:19:26,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:26,361 INFO L225 Difference]: With dead ends: 642 [2022-03-15 22:19:26,361 INFO L226 Difference]: Without dead ends: 638 [2022-03-15 22:19:26,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=763, Invalid=2897, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:19:26,363 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:26,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:19:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-03-15 22:19:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 468. [2022-03-15 22:19:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 3.6937901498929335) internal successors, (1725), 467 states have internal predecessors, (1725), 0 states have call successors, (0), 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:19:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1725 transitions. [2022-03-15 22:19:26,377 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 1725 transitions. Word has length 15 [2022-03-15 22:19:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:26,377 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 1725 transitions. [2022-03-15 22:19:26,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.2) internal successors, (80), 24 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:19:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 1725 transitions. [2022-03-15 22:19:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:26,378 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:26,378 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:26,395 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:19:26,583 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,SelfDestructingSolverStorable16 [2022-03-15 22:19:26,583 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:19:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:26,584 INFO L85 PathProgramCache]: Analyzing trace with hash -658262763, now seen corresponding path program 5 times [2022-03-15 22:19:26,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:26,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719205021] [2022-03-15 22:19:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:26,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:26,622 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:19:26,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:26,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719205021] [2022-03-15 22:19:26,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719205021] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:26,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987386920] [2022-03-15 22:19:26,622 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:19:26,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:26,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:26,623 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:19:26,624 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:19:26,647 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:19:26,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:26,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:19:26,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:26,725 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:19:26,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:26,760 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:19:26,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987386920] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:26,760 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:26,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-15 22:19:26,761 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716369890] [2022-03-15 22:19:26,761 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:26,761 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:26,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:19:26,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:27,490 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 16 new interpolants: [16607#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16612#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 16609#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 16615#(or (< (+ i 1) N) (<= N (+ 3 k))), 16604#(< (+ i 1) N), 16605#(or (<= N (+ k 1)) (< (+ i 1) N)), 16606#(or (<= N (+ k 1)) (< (+ 2 k) N)), 16610#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 16617#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= N (+ 3 k))), 16608#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 16613#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= N (+ 2 k))), 16603#(< (+ k 1) N), 16618#(or (< (+ k 4) N) (<= N (+ 3 k))), 16614#(or (<= N (+ 2 k)) (< (+ 3 k) N)), 16616#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 3 k))), 16611#(or (< (+ i 1) N) (<= N (+ 2 k)))] [2022-03-15 22:19:27,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:19:27,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:19:27,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:19:27,490 INFO L87 Difference]: Start difference. First operand 468 states and 1725 transitions. Second operand has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:28,619 INFO L93 Difference]: Finished difference Result 1004 states and 3536 transitions. [2022-03-15 22:19:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:19:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:19:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:28,624 INFO L225 Difference]: With dead ends: 1004 [2022-03-15 22:19:28,624 INFO L226 Difference]: Without dead ends: 981 [2022-03-15 22:19:28,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1421, Invalid=4279, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:19:28,625 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 166 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:28,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:19:28,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-03-15 22:19:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 584. [2022-03-15 22:19:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 3.795883361921098) internal successors, (2213), 583 states have internal predecessors, (2213), 0 states have call successors, (0), 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:19:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 2213 transitions. [2022-03-15 22:19:28,646 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 2213 transitions. Word has length 16 [2022-03-15 22:19:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:28,646 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 2213 transitions. [2022-03-15 22:19:28,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 23 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:28,646 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 2213 transitions. [2022-03-15 22:19:28,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:28,648 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:28,648 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:28,674 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:19:28,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:28,867 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:19:28,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1984726689, now seen corresponding path program 3 times [2022-03-15 22:19:28,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:28,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588093646] [2022-03-15 22:19:28,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:28,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:28,914 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:19:28,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:28,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588093646] [2022-03-15 22:19:28,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588093646] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:28,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473379306] [2022-03-15 22:19:28,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:19:28,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:28,916 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:19:28,939 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:19:28,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:19:28,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:28,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:19:28,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:29,015 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:19:29,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:29,084 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:19:29,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473379306] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:29,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:29,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:19:29,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [472054011] [2022-03-15 22:19:29,084 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:29,085 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:29,091 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 180 transitions. [2022-03-15 22:19:29,091 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:30,878 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 45 new interpolants: [19017#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (<= N (+ 2 k))), 19011#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N (+ 2 k))), 19029#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 19007#(or (<= N (+ k 1)) (< (+ i 1) N) (< j M)), 18999#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 19006#(or (< (+ i 1) N) (<= N (+ 2 k))), 18995#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 19013#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 3 i) N)), 19004#(or (<= N (+ k 1)) (< j M)), 18991#(or (< (+ i 1) N) (< j M)), 19030#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= N (+ 2 k)) (<= M j)), 18997#(or (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 19001#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 18993#(or (< j M) (< (+ k 1) N)), 19021#(or (< (+ j 1) M) (<= N (+ 2 k)) (<= M j)), 19003#(or (< j M) (<= N (+ 2 k)) (< (+ 3 k) N)), 19023#(or (< (+ j 1) M) (< (+ i 1) N) (<= N (+ 2 k)) (<= M j)), 19020#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 19014#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= N (+ 2 k))), 19010#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 18992#(< (+ k 1) N), 18994#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 19022#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 18998#(or (<= N (+ k 1)) (< (+ 2 k) N)), 19012#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 19018#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 19015#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 18988#(or (< (+ j 1) M) (<= M j)), 19024#(or (< (+ i 1) N) (<= (+ N M) (+ 3 k j))), 18996#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 19026#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= N (+ 2 k)) (<= M j)), 19005#(or (< j M) (<= N (+ 2 k))), 19008#(or (< (+ i 1) N) (< j M) (<= N (+ 2 k))), 19027#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 3 k j))), 19031#(or (<= N (+ 2 i)) (<= (+ N M) (+ 3 k j)) (< (+ 3 i) N)), 18987#(< j M), 19028#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 19016#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 18990#(or (<= N (+ i 1)) (< (+ 2 i) N)), 19019#(or (< (+ j 1) M) (<= N (+ 2 k)) (< (+ 3 k) N) (<= M j)), 19000#(or (<= N (+ k 1)) (< (+ i 1) N)), 19025#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 19009#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 k))), 18989#(< (+ i 1) N), 19002#(or (<= N (+ 2 k)) (< (+ 3 k) N))] [2022-03-15 22:19:30,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 22:19:30,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:30,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 22:19:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=3275, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:19:30,880 INFO L87 Difference]: Start difference. First operand 584 states and 2213 transitions. Second operand has 53 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 52 states have internal predecessors, (152), 0 states have call successors, (0), 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:19:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:40,817 INFO L93 Difference]: Finished difference Result 3316 states and 12886 transitions. [2022-03-15 22:19:40,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2022-03-15 22:19:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 52 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:19:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:40,836 INFO L225 Difference]: With dead ends: 3316 [2022-03-15 22:19:40,837 INFO L226 Difference]: Without dead ends: 3232 [2022-03-15 22:19:40,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32468 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17976, Invalid=69936, Unknown=0, NotChecked=0, Total=87912 [2022-03-15 22:19:40,843 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 612 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:40,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [612 Valid, 0 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-15 22:19:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2022-03-15 22:19:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 917. [2022-03-15 22:19:40,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 916 states have (on average 4.25764192139738) internal successors, (3900), 916 states have internal predecessors, (3900), 0 states have call successors, (0), 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:19:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 3900 transitions. [2022-03-15 22:19:40,893 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 3900 transitions. Word has length 16 [2022-03-15 22:19:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:40,894 INFO L470 AbstractCegarLoop]: Abstraction has 917 states and 3900 transitions. [2022-03-15 22:19:40,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.8679245283018866) internal successors, (152), 52 states have internal predecessors, (152), 0 states have call successors, (0), 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:19:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 3900 transitions. [2022-03-15 22:19:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:40,897 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:40,897 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:40,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-15 22:19:41,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:41,120 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:19:41,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1268723753, now seen corresponding path program 4 times [2022-03-15 22:19:41,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:41,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720896211] [2022-03-15 22:19:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:41,166 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:19:41,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:41,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720896211] [2022-03-15 22:19:41,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720896211] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:41,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772227666] [2022-03-15 22:19:41,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:19:41,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:41,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:41,168 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:19:41,171 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:19:41,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:19:41,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:41,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:19:41,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:41,264 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:19:41,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:41,340 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:19:41,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772227666] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:41,342 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:41,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-03-15 22:19:41,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379746080] [2022-03-15 22:19:41,342 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:41,343 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:41,350 INFO L252 McrAutomatonBuilder]: Finished intersection with 87 states and 189 transitions. [2022-03-15 22:19:41,350 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:42,929 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 37 new interpolants: [24769#(or (< (+ i 1) N) (<= M j)), 24771#(or (< (+ j 1) M) (<= M j)), 24778#(or (<= N (+ k 1)) (< (+ 2 k) N)), 24789#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N) (< (+ 3 i) N) (<= M j)), 24793#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ 3 k j))), 24774#(or (< (+ i 1) N) (< (+ k 1) N) (<= M j)), 24783#(or (< (+ 2 j) M) (<= M (+ j 1))), 24781#(or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N) (< (+ 3 i) N)), 24762#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 24760#(< (+ i 1) N), 24790#(or (< (+ i 1) N) (<= M (+ j 1))), 24791#(or (< (+ i 1) N) (<= (+ N M) (+ 3 k j))), 24784#(or (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 24767#(< j M), 24776#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M j)), 24779#(or (<= N (+ k 1)) (< (+ i 1) N) (< (+ 2 k) N)), 24782#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 24780#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N)), 24775#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N) (<= M j)), 24792#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M (+ j 1))), 24763#(< (+ k 1) N), 24772#(or (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 24785#(or (<= N (+ k 1)) (< (+ j 1) M) (< (+ 2 k) N) (<= M j)), 24796#(or (<= N (+ k 1)) (< (+ 2 k) N) (< (+ 2 j) M) (<= M (+ j 1))), 24770#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j)), 24794#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= M (+ j 1))), 24773#(or (< (+ k 1) N) (<= M j)), 24768#(or (< j M) (< (+ k 1) N)), 24777#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ k 1) N) (<= M j)), 24766#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ k 1) N)), 24764#(or (< (+ i 1) N) (< (+ k 1) N)), 24787#(or (<= N (+ k 1)) (< (+ i 1) N) (< (+ 2 k) N) (<= M j)), 24795#(or (<= N (+ 2 i)) (<= (+ N M) (+ 3 k j)) (< (+ 3 i) N)), 24765#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N)), 24761#(or (<= N (+ i 1)) (< (+ 2 i) N)), 24786#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= M j)), 24788#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 k) N) (<= M j))] [2022-03-15 22:19:42,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-03-15 22:19:42,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-03-15 22:19:42,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2022-03-15 22:19:42,931 INFO L87 Difference]: Start difference. First operand 917 states and 3900 transitions. Second operand has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:52,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:19:52,710 INFO L93 Difference]: Finished difference Result 2062 states and 7609 transitions. [2022-03-15 22:19:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2022-03-15 22:19:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:19:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:19:52,722 INFO L225 Difference]: With dead ends: 2062 [2022-03-15 22:19:52,722 INFO L226 Difference]: Without dead ends: 2018 [2022-03-15 22:19:52,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30539 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15754, Invalid=65756, Unknown=0, NotChecked=0, Total=81510 [2022-03-15 22:19:52,728 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 398 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:19:52,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [398 Valid, 0 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-15 22:19:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2022-03-15 22:19:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 830. [2022-03-15 22:19:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 4.1761158021712905) internal successors, (3462), 829 states have internal predecessors, (3462), 0 states have call successors, (0), 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:19:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 3462 transitions. [2022-03-15 22:19:52,761 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 3462 transitions. Word has length 16 [2022-03-15 22:19:52,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:19:52,761 INFO L470 AbstractCegarLoop]: Abstraction has 830 states and 3462 transitions. [2022-03-15 22:19:52,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.0444444444444443) internal successors, (137), 44 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:19:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 3462 transitions. [2022-03-15 22:19:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:19:52,764 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:19:52,764 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:19:52,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-15 22:19:52,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:52,972 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:19:52,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:19:52,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1833626074, now seen corresponding path program 6 times [2022-03-15 22:19:52,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:19:52,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547317771] [2022-03-15 22:19:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:19:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:19:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:19:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:19:53,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:19:53,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547317771] [2022-03-15 22:19:53,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547317771] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:19:53,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432616204] [2022-03-15 22:19:53,022 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:19:53,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:19:53,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:19:53,023 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:19:53,025 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:19:53,046 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:19:53,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:19:53,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:19:53,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:19:53,121 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:19:53,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:19:53,197 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:19:53,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432616204] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:19:53,198 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:19:53,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-03-15 22:19:53,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213678701] [2022-03-15 22:19:53,198 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:19:53,199 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:19:53,203 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:19:53,203 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:19:54,746 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 44 new interpolants: [29134#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= (+ k j 4) (+ N M))), 29118#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 29125#(or (<= N (+ 2 k)) (<= (+ k 4) N)), 29109#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< (+ k 1) N)), 29099#(or (< (+ i 4) N) (<= N (+ 3 i)) (< (+ k 1) N)), 29130#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ k j 4) (+ N M))), 29115#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N)), 29098#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ k 1) N)), 29132#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ k j 4) (+ N M))), 29114#(or (<= (+ 3 k) N) (< (+ i 1) N) (< j M)), 29127#(or (< (+ i 1) N) (< j M) (<= (+ k 4) N)), 29131#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (<= (+ k 4) N)), 29117#(or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N)), 29122#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ k 4) N)), 29104#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 29108#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< (+ k 1) N)), 29120#(or (<= (+ 3 k) N) (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 29096#(or (< (+ i 1) N) (< (+ k 1) N)), 29093#(or (<= N (+ i 1)) (< (+ 2 i) N)), 29070#(or (< j M) (<= (+ k 4) N)), 29111#(or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M)), 29119#(or (<= (+ 3 k) N) (< (+ i 4) N) (<= N (+ 3 i))), 29097#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N)), 29128#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (+ k 4) N)), 29100#(< j M), 29121#(or (< (+ i 1) N) (<= (+ k 4) N)), 29107#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< (+ k 1) N)), 29133#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (+ k 4) N)), 29103#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 29094#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 29105#(or (<= (+ 2 k) N) (< j M)), 29113#(or (<= (+ 3 k) N) (< (+ i 1) N)), 29095#(or (< (+ i 4) N) (<= N (+ 3 i))), 29110#(or (<= N (+ k 1)) (<= (+ 3 k) N)), 29092#(< (+ i 1) N), 29112#(or (<= (+ 3 k) N) (< j M)), 29129#(or (< (+ i 1) N) (<= (+ k j 4) (+ N M))), 29124#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= (+ k 4) N)), 29126#(or (< j M) (<= N (+ 2 k)) (<= (+ k 4) N)), 29101#(or (< (+ i 1) N) (< j M)), 29102#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 29123#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ k 4) N)), 29106#(or (< (+ i 1) N) (< j M) (< (+ k 1) N)), 29116#(or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M))] [2022-03-15 22:19:54,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 22:19:54,746 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:19:54,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 22:19:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=3053, Unknown=0, NotChecked=0, Total=3540 [2022-03-15 22:19:54,747 INFO L87 Difference]: Start difference. First operand 830 states and 3462 transitions. Second operand has 53 states, 53 states have (on average 2.490566037735849) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 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:20:03,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:03,379 INFO L93 Difference]: Finished difference Result 2214 states and 7824 transitions. [2022-03-15 22:20:03,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-03-15 22:20:03,379 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.490566037735849) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have 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:20:03,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:03,390 INFO L225 Difference]: With dead ends: 2214 [2022-03-15 22:20:03,390 INFO L226 Difference]: Without dead ends: 2204 [2022-03-15 22:20:03,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31247 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14608, Invalid=71534, Unknown=0, NotChecked=0, Total=86142 [2022-03-15 22:20:03,395 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 788 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 2372 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 2372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:03,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 0 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 2372 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-15 22:20:03,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2022-03-15 22:20:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1228. [2022-03-15 22:20:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1227 states have (on average 4.1711491442542785) internal successors, (5118), 1227 states have internal predecessors, (5118), 0 states have call successors, (0), 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:20:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 5118 transitions. [2022-03-15 22:20:03,435 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 5118 transitions. Word has length 16 [2022-03-15 22:20:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:03,436 INFO L470 AbstractCegarLoop]: Abstraction has 1228 states and 5118 transitions. [2022-03-15 22:20:03,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.490566037735849) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 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:20:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 5118 transitions. [2022-03-15 22:20:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:20:03,440 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:03,440 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:03,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-03-15 22:20:03,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:03,660 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:20:03,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1504394470, now seen corresponding path program 6 times [2022-03-15 22:20:03,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:03,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521098599] [2022-03-15 22:20:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:03,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:20:03,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:03,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521098599] [2022-03-15 22:20:03,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521098599] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:03,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206970902] [2022-03-15 22:20:03,712 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:20:03,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:03,714 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:20:03,715 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:20:03,746 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:20:03,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:20:03,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:20:03,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:03,898 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:20:03,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:04,005 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:20:04,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206970902] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:04,005 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:04,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-03-15 22:20:04,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1065576424] [2022-03-15 22:20:04,006 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:04,006 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:04,012 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 167 transitions. [2022-03-15 22:20:04,012 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:05,964 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 50 new interpolants: [34424#(or (< (+ i 1) N) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 34406#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i))), 34390#(< j M), 34401#(or (< (+ i 1) N) (< (+ 2 j) M) (<= M (+ j 1))), 34410#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (<= M j)), 34415#(or (<= (+ 3 k j) (+ N M)) (<= N (+ 2 i)) (< (+ 3 i) N)), 34400#(or (< (+ 2 j) M) (<= M (+ j 1))), 34420#(or (< (+ i 4) N) (<= (+ 2 k j) (+ N M)) (<= N (+ 3 i))), 34426#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 34393#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 34414#(or (<= (+ 3 k j) (+ N M)) (<= N (+ i 1)) (< (+ 2 i) N)), 34395#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< (+ k 1) N)), 34416#(or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= M j)), 34404#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 34385#(or (< (+ i 1) N) (< (+ k 1) N)), 34411#(or (<= N (+ 2 i)) (< (+ j 1) M) (< (+ 3 i) N) (< (+ k 1) N) (<= M j)), 34431#(or (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 34425#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 34408#(or (< (+ j 1) M) (< (+ i 1) N) (< (+ k 1) N) (<= M j)), 34412#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 34429#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ k j 4) (+ N M))), 34398#(or (< (+ j 1) M) (< (+ i 1) N) (<= M j)), 34386#(or (<= N (+ i 1)) (< (+ 2 i) N)), 34354#(or (<= (+ 2 k) N) (< j M)), 34392#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 34405#(or (< (+ i 4) N) (<= N (+ 3 i))), 34413#(or (<= (+ 3 k j) (+ N M)) (< (+ i 1) N)), 34421#(or (<= (+ 3 k j) (+ N M)) (< (+ i 4) N) (<= N (+ 3 i))), 34399#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (<= M j)), 34403#(or (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 34397#(or (< (+ j 1) M) (<= M j)), 34418#(or (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< (+ k 1) N)), 34432#(or (< (+ i 4) N) (<= N (+ 3 i)) (<= (+ k j 4) (+ N M))), 34384#(< (+ i 1) N), 34387#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ k 1) N)), 34419#(or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ k 1) N) (<= M j)), 34402#(or (<= N (+ i 1)) (< (+ 2 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 34417#(or (< (+ i 4) N) (<= N (+ 3 i)) (< (+ k 1) N)), 34391#(or (< (+ i 1) N) (< j M)), 34394#(or (< (+ i 1) N) (< j M) (< (+ k 1) N)), 34388#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 34423#(or (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))), 34427#(or (< (+ i 1) N) (<= (+ k j 4) (+ N M))), 34407#(or (< (+ j 1) M) (< (+ k 1) N) (<= M j)), 34389#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ k 1) N)), 34409#(or (<= N (+ i 1)) (< (+ j 1) M) (< (+ 2 i) N) (< (+ k 1) N) (<= M j)), 34422#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< (+ 2 j) M) (<= M (+ j 1))), 34428#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ k j 4) (+ N M))), 34396#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< (+ k 1) N)), 34430#(or (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 j) M) (<= M (+ j 1)))] [2022-03-15 22:20:05,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-03-15 22:20:05,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-03-15 22:20:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=4248, Unknown=0, NotChecked=0, Total=4830 [2022-03-15 22:20:05,966 INFO L87 Difference]: Start difference. First operand 1228 states and 5118 transitions. Second operand has 59 states, 59 states have (on average 2.5762711864406778) internal successors, (152), 58 states have internal predecessors, (152), 0 states have call successors, (0), 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:20:20,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:20:20,746 INFO L93 Difference]: Finished difference Result 2361 states and 8399 transitions. [2022-03-15 22:20:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 312 states. [2022-03-15 22:20:20,747 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.5762711864406778) internal successors, (152), 58 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have 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:20:20,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:20:20,756 INFO L225 Difference]: With dead ends: 2361 [2022-03-15 22:20:20,756 INFO L226 Difference]: Without dead ends: 2359 [2022-03-15 22:20:20,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50032 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=21534, Invalid=114996, Unknown=0, NotChecked=0, Total=136530 [2022-03-15 22:20:20,760 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1048 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 3363 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 3363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:20:20,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1048 Valid, 0 Invalid, 4042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 3363 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:20:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2022-03-15 22:20:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 1307. [2022-03-15 22:20:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 1306 states have (on average 4.136294027565084) internal successors, (5402), 1306 states have internal predecessors, (5402), 0 states have call successors, (0), 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:20:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 5402 transitions. [2022-03-15 22:20:20,803 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 5402 transitions. Word has length 16 [2022-03-15 22:20:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:20:20,803 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 5402 transitions. [2022-03-15 22:20:20,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.5762711864406778) internal successors, (152), 58 states have internal predecessors, (152), 0 states have call successors, (0), 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:20:20,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 5402 transitions. [2022-03-15 22:20:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:20:20,807 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:20:20,807 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:20:20,831 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:20:21,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:21,027 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:20:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:20:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1127860487, now seen corresponding path program 7 times [2022-03-15 22:20:21,028 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:20:21,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834702781] [2022-03-15 22:20:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:20:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:20:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:21,493 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:20:21,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:20:21,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834702781] [2022-03-15 22:20:21,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834702781] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:20:21,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540071375] [2022-03-15 22:20:21,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:20:21,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:20:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:20:21,494 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:20:21,495 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:20:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:20:21,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 28 conjunts are in the unsatisfiable core [2022-03-15 22:20:21,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:20:22,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:22,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,115 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:22,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:20:22,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:22,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:20:22,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 67 [2022-03-15 22:20:22,257 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:20:22,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:20:23,144 INFO L353 Elim1Store]: treesize reduction 156, result has 49.5 percent of original size [2022-03-15 22:20:23,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 196 treesize of output 238 [2022-03-15 22:20:29,922 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:20:29,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540071375] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:20:29,923 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:20:29,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-03-15 22:20:29,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358307610] [2022-03-15 22:20:29,923 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:20:29,924 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:20:29,930 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:20:29,930 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:20:50,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 51 new interpolants: [40163#(and (or sorted1 (not (< (+ 2 i) N)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or (not (< (+ 2 i) N)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))) (not (= N (+ k 4)))) (or sorted3 (not (< (+ 2 i) N)) (not sorted1) (< (+ 3 i) N) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))) (not (= N (+ k 4)))) (or sorted2 (not (< (+ 2 i) N)) (not sorted1) (< (+ 3 i) N) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))) (not (= N (+ k 4))))), 40142#(and (or sorted2 (<= (+ 2 k) N) (< j M) (not sorted1)) (or sorted3 (<= (+ 2 k) N) (< j M) (not sorted1)) (or sorted1 (not sorted3) (<= (+ 2 k) N) (< j M))), 40170#(and (or sorted3 (< (+ i 4) N) (not (< (+ k 1) N)) (< j M) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (< (+ i 4) N) (not (< (+ k 1) N)) (< j M) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (< j M) (<= N (+ 3 i)) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (< j M) (<= N (+ 3 i)) (< (+ 2 k) N) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))))), 40177#(and (or sorted2 (< j M) (not (< (+ 2 i) N)) (not sorted1) (< (+ 3 i) N) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))) (not (= N (+ k 4)))) (or sorted1 (< j M) (not (< (+ 2 i) N)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted3 (< j M) (not (< (+ 2 i) N)) (not sorted1) (< (+ 3 i) N) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))) (not (= N (+ k 4)))) (or (< j M) (not (< (+ 2 i) N)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (not (< (select A i) (select A (+ i 1)))) (not (< (select A (+ i 1)) (select A (+ 2 i)))) (not (= N (+ k 4))))), 40172#(and (or sorted1 (not sorted3) (<= (select A (+ 2 k)) (select A (+ k 1))) (not (< (select A k) (select A (+ k 1)))) (<= (select A (+ (- 1) N)) (select A (+ 2 k))) (<= (+ 5 k) N) (<= N (+ 3 k))) (or sorted3 (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k))) (or (not sorted1) (<= (+ 5 k) N) (<= (+ (select A (+ 2 k)) 1) (select A (+ (- 1) N))) (<= N (+ 3 k))) (or (< (select A k) (select A (+ k 1))) (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k))) (or sorted2 (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k)))), 40160#(and (or (<= N (+ k 1)) sorted1 (<= (+ 3 k) N) (not sorted3) (< (+ i 1) N) (< j M) (<= (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (not sorted1)) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or (<= N (+ k 1)) sorted3 (<= (+ 3 k) N) (< (+ i 1) N) (< j M) (not sorted1))), 40157#(and (or sorted2 (<= N (+ 2 i)) (not sorted3) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or sorted1 (<= N (+ 2 i)) (not sorted3) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N))), 40137#(and (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (+ k 1) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 40143#(and (or sorted3 (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not sorted1)) (or sorted1 (not sorted3) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)) (or sorted2 (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not sorted1))), 40133#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 40176#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4)))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4)))) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4))))), 40147#(and (or sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i))) (or sorted1 (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i))) (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (select A (+ 2 i)) (select A (+ 3 i))))), 40178#(and (or sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted1 (< (+ i 4) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4))))), 40164#(and (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted1 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4))))), 40181#(and (or sorted3 (<= N (+ 2 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (= N (+ k 4))) (not (= k 0))) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= k M) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< 0 (+ k 1)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (= j 0) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= k M) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (< 0 (+ k 1)) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< 0 (+ k 1)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< 0 (+ k 1)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= k M) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4))) (not (= k 0))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= k M) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (= j 0) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted2 (<= N (+ 2 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (= N (+ k 4))) (not (= k 0))) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (= j 0) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (= j 0) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< (+ 3 i) N) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4))) (not (= k 0)))), 40139#(and (or sorted1 (not sorted3) (< (+ i 1) N) (< j M)) (or sorted3 (< (+ i 1) N) (< j M) (not sorted1)) (or sorted2 (< (+ i 1) N) (< j M) (not sorted1))), 40153#(and (or sorted1 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 i) N) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 40134#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N))), 40144#(and (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 40148#(and (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or sorted1 (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (+ k 1) N)) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i))))), 40152#(and (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1)) (or (<= N (+ k 1)) sorted3 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1)) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or (<= N (+ k 1)) sorted1 (<= (+ 3 k) N) (not sorted3) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)))), 40140#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 40180#(and (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= k 0))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= k 0))) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (= j 0) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1)))) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= k M) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1)))) (not (= k 0))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1)))) (< 0 (+ k 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1)))) (< 0 (+ k 1))) (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1)) (<= (select A (+ (- 2) N)) (select A (+ k 1)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1)))) (< 0 (+ k 1))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1)))) (not (= k 0))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (< (select A i) (select A (+ i 1)))) (< 0 (+ k 1)))), 40146#(and (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i))) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)))), 40182#(and (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (= j 0) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= k M) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4))) (not (= k 0))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (= j 0) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (< 0 (+ k 1)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= k M) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (< 0 (+ k 1)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4)))) (or sorted1 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= k M) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted1 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4))) (not (= k 0))) (or sorted1 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (= j 0) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted1 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (< 0 (+ k 1)) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (= N (+ k 4))) (not (= k 0)))), 40174#(and (or (< j M) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= N (+ k 4)))) (or sorted1 (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted3 (< j M) (not sorted1) (not (= N (+ k 4)))) (or (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= N (+ k 4)))) (or sorted2 (< j M) (not sorted1) (not (= N (+ k 4)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< j M) (not sorted1) (not (= N (+ k 4))))), 40179#(and (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1)))) (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1)) (<= (select A (+ (- 2) N)) (select A (+ k 1)))) (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1))) (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= k M) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1)))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1)))) (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= k 0))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1)))) (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (= j 0) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1)))) (or sorted2 (< (+ i 1) N) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (= k 0))) (or sorted2 (< (+ i 1) N) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1)))) (or sorted3 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= k 0))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1)))) (or sorted3 (< (+ i 1) N) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1))) (or sorted3 (< (+ i 1) N) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1))) (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (= k 0))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1)))) (or sorted3 (< (+ i 1) N) (not sorted1) (= j 0) (not (= (+ N (- 3)) (+ k 1)))) (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (<= k M) (not (= (+ N (- 3)) (+ k 1)))) (or sorted2 (< (+ i 1) N) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (not (= k 0))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= (+ N (- 3)) (+ k 1))) (< 0 (+ k 1))) (or sorted2 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not (= (+ N (- 3)) (+ k 1))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= k 0)))), 40169#(and (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (<= N (+ 2 i)) (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N))), 40138#(and (or sorted1 (not sorted3) (< j M)) (or sorted2 (< j M) (not sorted1)) (or sorted3 (< j M) (not sorted1))), 40165#(and (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted1 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 40151#(and (or sorted1 (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted3 (< j M) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (<= (+ (select A (+ k 1)) 1) (select A (+ (- 1) N))) (< j M) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted2 (< j M) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N))), 40166#(and (or sorted3 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< j M) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< j M) (< (+ 2 k) N) (< (+ 3 i) N) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< j M) (< (+ 2 k) N) (< (+ 3 i) N) (not (< (select A k) (select A (+ k 1))))) (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< j M) (< (+ 2 k) N) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1)))))), 40159#(and (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or (< (+ i 4) N) (not sorted3) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted1 (< (+ i 4) N) (not sorted3) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N))), 40136#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 40168#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N))), 40161#(and (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (not (= N (+ k 4)))) (or sorted3 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or (< (+ i 1) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= N (+ k 4)))) (or sorted2 (< (+ i 1) N) (not sorted1) (not (= N (+ k 4)))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= N (+ k 4)))) (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4))))), 40141#(and (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1)))) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N))), 40154#(and (or sorted3 (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted1 (not sorted3) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (<= (+ (select A (+ k 1)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted2 (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N))), 40145#(and (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< (+ k 1) N)) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 40175#(and (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (< j M) (not sorted1) (not (= N (+ k 4)))) (or sorted1 (< (+ i 1) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or (< (+ i 1) N) (< j M) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (= N (+ k 4)))) (or (< (+ i 1) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (= N (+ k 4)))) (or sorted2 (< (+ i 1) N) (< j M) (not sorted1) (not (= N (+ k 4)))) (or sorted3 (< (+ i 1) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4))))), 40150#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or (<= N (+ k 1)) sorted1 (<= (+ 3 k) N) (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< j M) (not sorted1)) (or (<= N (+ k 1)) sorted3 (<= (+ 3 k) N) (< j M) (not sorted1))), 40173#(and (or (< j M) (< (select A k) (select A (+ k 1))) (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k))) (or (< j M) (not sorted1) (<= (+ 5 k) N) (<= (+ (select A (+ 2 k)) 1) (select A (+ (- 1) N))) (<= N (+ 3 k))) (or sorted3 (< j M) (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ 2 k))) (< j M) (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k))) (or sorted1 (not sorted3) (< j M) (<= (select A (+ 2 k)) (select A (+ k 1))) (not (< (select A k) (select A (+ k 1)))) (<= (select A (+ (- 1) N)) (select A (+ 2 k))) (<= (+ 5 k) N) (<= N (+ 3 k))) (or sorted2 (< j M) (not sorted1) (<= (+ 5 k) N) (<= N (+ 3 k)))), 40167#(and (or sorted2 (< (+ i 1) N) (< j M) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted3 (< (+ i 1) N) (< j M) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (< (+ i 1) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (<= (+ (select A (+ k 1)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (< j M) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted1 (not sorted3) (< (+ i 1) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1))))), 40132#(and (or sorted3 (< (+ i 1) N) (not sorted1)) (or sorted1 (not sorted3) (< (+ i 1) N)) (or sorted2 (< (+ i 1) N) (not sorted1))), 40171#(and (or sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or (< (+ i 4) N) (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) (select A (+ i 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted1 (< (+ i 4) N) (not sorted3) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N))), 40155#(and (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1))))), 40158#(and (or sorted3 (< (+ i 4) N) (not (< (+ k 1) N)) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (<= N (+ 3 i)) (< (+ 2 k) N) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (<= N (+ 3 i)) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (< (+ 2 k) N) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (< (+ i 4) N) (not (< (+ k 1) N)) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 40135#(and (or sorted3 (< (+ i 1) N) (not sorted1) (< (+ k 1) N)) (or sorted1 (not sorted3) (< (+ i 1) N) (< (+ k 1) N)) (or sorted2 (< (+ i 1) N) (not sorted1) (< (+ k 1) N))), 40156#(and (or sorted3 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (not (< (select A k) (select A (+ k 1))))) (or sorted1 (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (not (< (select A k) (select A (+ k 1)))))), 40162#(and (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A (+ k 1))) (not (= N (+ k 4)))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4)))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A (+ k 1)) 1) (select A (+ (- 2) N))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (not (= N (+ k 4))))), 40149#(and (or sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))))] [2022-03-15 22:20:50,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-03-15 22:20:50,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:20:50,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-03-15 22:20:50,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=5684, Unknown=0, NotChecked=0, Total=6162 [2022-03-15 22:20:50,823 INFO L87 Difference]: Start difference. First operand 1307 states and 5402 transitions. Second operand has 63 states, 62 states have (on average 2.5) internal successors, (155), 62 states have internal predecessors, (155), 0 states have call successors, (0), 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:22:46,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:22:46,457 INFO L93 Difference]: Finished difference Result 2661 states and 9442 transitions. [2022-03-15 22:22:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:22:46,457 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.5) internal successors, (155), 62 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have 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:22:46,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:22:46,465 INFO L225 Difference]: With dead ends: 2661 [2022-03-15 22:22:46,465 INFO L226 Difference]: Without dead ends: 2601 [2022-03-15 22:22:46,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18662 ImplicationChecksByTransitivity, 118.9s TimeCoverageRelationStatistics Valid=9328, Invalid=49964, Unknown=0, NotChecked=0, Total=59292 [2022-03-15 22:22:46,468 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1374 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:22:46,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1374 Valid, 0 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-03-15 22:22:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-03-15 22:22:46,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 1485. [2022-03-15 22:22:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1484 states have (on average 4.0889487870619945) internal successors, (6068), 1484 states have internal predecessors, (6068), 0 states have call successors, (0), 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:22:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 6068 transitions. [2022-03-15 22:22:46,514 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 6068 transitions. Word has length 17 [2022-03-15 22:22:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:22:46,515 INFO L470 AbstractCegarLoop]: Abstraction has 1485 states and 6068 transitions. [2022-03-15 22:22:46,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.5) internal successors, (155), 62 states have internal predecessors, (155), 0 states have call successors, (0), 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:22:46,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 6068 transitions. [2022-03-15 22:22:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:22:46,518 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:22:46,518 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:22:46,538 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:22:46,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:46,730 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:22:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:22:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash -198603439, now seen corresponding path program 5 times [2022-03-15 22:22:46,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:22:46,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237689220] [2022-03-15 22:22:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:22:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:22:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:22:47,131 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:22:47,131 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:22:47,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237689220] [2022-03-15 22:22:47,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237689220] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:22:47,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953625001] [2022-03-15 22:22:47,132 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:22:47,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:22:47,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:22:47,135 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:22:47,136 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:22:47,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:22:47,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:22:47,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 29 conjunts are in the unsatisfiable core [2022-03-15 22:22:47,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:22:47,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:22:47,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:47,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 77 [2022-03-15 22:22:47,957 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:22:47,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:22:48,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:22:48,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:22:48,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 13 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 190 treesize of output 330 [2022-03-15 22:23:35,958 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:23:35,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953625001] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:23:35,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:23:35,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:23:35,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1981756416] [2022-03-15 22:23:35,959 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:23:35,960 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:23:35,968 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 219 transitions. [2022-03-15 22:23:35,968 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:23:56,822 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 42 new interpolants: [46290#(and (or (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N))), 46276#(and (or (< (select A (+ k 1)) (select A (+ 2 k))) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted1 (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (select A k) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (<= N (+ 2 k)) (<= (+ k 4) N)) (or (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1))))), 46270#(and (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 46302#(and (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1)))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted1 (<= (select A (+ j 1)) (select A j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N))), 46296#(and (or sorted2 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ i 1)) sorted3 (not (= (+ 2 k) N)) (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i))) (or (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1))))), 46283#(and (or sorted3 (not (= (+ 2 k) N)) (< (+ i 1) N) (not sorted1)) (or sorted2 (not (= (+ 2 k) N)) (< (+ i 1) N) (not sorted1)) (or (not (= (+ 2 k) N)) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or sorted1 (not (= (+ 2 k) N)) (not sorted3) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not sorted2))), 46304#(and (or (<= N (+ k 1)) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (< (+ 2 k) N) (not sorted2)) (or (<= N (+ k 1)) sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ k 1)) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (+ 2 k) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or (<= N (+ k 1)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (+ 2 k) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (+ 2 k) N) (not sorted2)) (or (<= N (+ k 1)) sorted2 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (+ 2 k) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 46281#(and (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 46266#(and (or sorted3 (not sorted1) (< (+ k 1) N)) (or sorted2 (not sorted1) (< (+ k 1) N)) (or (not sorted1) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or sorted1 (not sorted3) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1)))))), 46285#(and (or (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (<= (+ (select A (+ k 1)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted1 (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not sorted2) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or sorted2 (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted3 (< (+ i 1) N) (<= N (+ 2 k)) (<= (+ k 4) N))), 46275#(and (or sorted2 (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (not sorted1) (< (select A j) (select A (+ j 1))) (not (= N (+ 3 k)))) (or sorted3 (not sorted1) (not (= N (+ 3 k)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (not sorted1) (not (= N (+ 3 k)))) (or sorted1 (not sorted3) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1)))) (not (= N (+ 3 k)))) (or (< (select A k) (select A (+ k 1))) (not sorted1) (not (= N (+ 3 k))))), 46271#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2))), 46286#(and (or sorted1 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not sorted2) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 2 k)) (<= (+ k 4) N))), 46306#(and (or sorted2 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or sorted3 (< (+ i 4) N) (<= N (+ 2 k)) (not (< (+ 3 i) N)) (<= (+ k 4) N)) (or (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1))))), 46278#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1))))), 46303#(and (or sorted1 (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or sorted2 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1))))), 46291#(and (or sorted3 (< (+ i 4) N) (not (< (+ k 1) N)) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (<= N (+ 3 i)) (< (+ 2 k) N) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (< (+ 2 k) N) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or (< (+ i 4) N) (not (< (+ k 1) N)) (not sorted3) (<= N (+ 3 i)) (< (+ 2 k) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (< (+ i 4) N) (not (< (+ k 1) N)) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 46298#(and (or (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1)))) (or (< (select A (+ k 1)) (select A (+ 2 k))) (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (+ i 1) N) (< (select A k) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (< (+ i 1) N) (<= N (+ 2 k)) (<= (+ k 4) N))), 46265#(and (or (not sorted1) (< (select A j) (select A (+ j 1)))) (or sorted3 (not sorted1)) (or sorted1 (not sorted3) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (not sorted1))), 46293#(and (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2)) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2)) (or (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2))), 46305#(and (or sorted2 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (< (+ i 4) N) (<= N (+ 2 k)) (not (< (+ 3 i) N)) (<= (+ k 4) N)) (or (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1)))) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) (select A (+ i 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N))), 46287#(and (or sorted3 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or sorted2 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (not sorted2) (not (< (select A k) (select A (+ k 1)))))), 46280#(and (or sorted3 (< (+ i 1) N) (not sorted1) (< (+ k 1) N)) (or sorted1 (not sorted3) (< (+ i 1) N) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (< (+ i 1) N) (not sorted1) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ i 1) N) (not sorted1) (< (+ k 1) N))), 46279#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))))), 46288#(and (or sorted1 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (+ 3 i) N) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ 2 k)) (<= (+ k 4) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N))), 46272#(and (or sorted1 (not sorted3) (< (+ i 1) N) (<= (+ 2 k) N) (not sorted2)) (or sorted2 (< (+ i 1) N) (<= (+ 2 k) N) (not sorted1)) (or sorted3 (< (+ i 1) N) (<= (+ 2 k) N) (not sorted1))), 46289#(and (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2)) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (select A (+ 2 i)) (select A (+ 3 i))))), 46300#(and (or sorted1 (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (+ 3 i) N) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (not (< (+ 2 i) N)) (< (+ 3 i) N) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted1) (< (+ 3 i) N) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1))))), 46268#(and (or sorted2 (not sorted1) (not (= N (+ 3 k)))) (or sorted1 (not sorted3) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (= N (+ 3 k)))) (or sorted3 (not sorted1) (not (= N (+ 3 k)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (not sorted1) (not (= N (+ 3 k)))) (or (< (select A k) (select A (+ k 1))) (not sorted1) (not (= N (+ 3 k))))), 46274#(and (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 46284#(and (or sorted1 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not sorted2)) (or sorted2 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 46269#(and (or sorted1 (not sorted3) (< (+ i 1) N) (not sorted2)) (or sorted3 (< (+ i 1) N) (not sorted1)) (or sorted2 (< (+ i 1) N) (not sorted1))), 46267#(and (or (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (select A j) (select A (+ j 1)))) (or sorted3 (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1)) (or (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1)) (or sorted1 (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1))), 46297#(and (or sorted3 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not (< (+ k 1) N)) (not sorted3) (< (+ 2 k) N) (< (+ 3 i) N) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< (select A k) (select A (+ k 1)))) (< (select A j) (select A (+ j 1)))) (or sorted2 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< (select A k) (select A (+ k 1)))))), 46295#(and (or sorted3 (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1)) (or (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (< (select A j) (select A (+ j 1)))) (or sorted1 (not (< (+ k 1) N)) (not sorted3) (< (+ i 1) N) (< (+ 2 k) N) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1)) (or sorted2 (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1))), 46301#(and (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= (+ (select A (+ k 1)) 1) (select A (+ (- 1) N))) (< (+ i 1) N) (not sorted1) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (< (+ i 1) N) (< (select A k) (select A (+ k 1))) (not sorted1) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 2 k)) (<= (+ k 4) N) (<= (select A (+ (- 1) N)) (select A (+ k 1)))) (or sorted3 (< (+ i 1) N) (<= N (+ 2 k)) (<= (+ k 4) N))), 46277#(and (or sorted1 (not sorted3) (< (+ i 1) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ i 1) N) (not sorted1)) (or sorted2 (< (+ i 1) N) (not sorted1)) (or (< (+ i 1) N) (not sorted1) (< (select A j) (select A (+ j 1))))), 46282#(and (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 46292#(and (or (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (< (select A i) (select A (+ i 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (+ 3 k) N)) (or sorted1 (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted3 (< (+ i 4) N) (<= N (+ 2 k)) (not (< (+ 3 i) N)) (<= (+ k 4) N))), 46299#(and (or sorted1 (<= (select A (+ j 1)) (select A j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (<= (select A (+ 2 k)) (select A (+ k 1))) (not sorted2) (<= N (+ 2 k)) (< (+ 3 k) N)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N) (< (select A j) (select A (+ j 1)))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (<= N (+ 2 k)) (<= (+ k 4) N)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= N (+ 2 k)) (< (+ 3 k) N))), 46273#(and (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 46294#(and (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)))] [2022-03-15 22:23:56,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-03-15 22:23:56,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:23:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-03-15 22:23:56,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4154, Unknown=0, NotChecked=0, Total=4422 [2022-03-15 22:23:56,824 INFO L87 Difference]: Start difference. First operand 1485 states and 6068 transitions. Second operand has 53 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 52 states have internal predecessors, (150), 0 states have call successors, (0), 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:25:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:25:08,197 INFO L93 Difference]: Finished difference Result 3027 states and 10682 transitions. [2022-03-15 22:25:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2022-03-15 22:25:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 52 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:25:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:25:08,206 INFO L225 Difference]: With dead ends: 3027 [2022-03-15 22:25:08,206 INFO L226 Difference]: Without dead ends: 2952 [2022-03-15 22:25:08,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 41 SyntacticMatches, 17 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14502 ImplicationChecksByTransitivity, 71.3s TimeCoverageRelationStatistics Valid=6143, Invalid=41599, Unknown=0, NotChecked=0, Total=47742 [2022-03-15 22:25:08,213 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 963 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 5881 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 5881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:25:08,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [963 Valid, 0 Invalid, 6195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 5881 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-03-15 22:25:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2952 states. [2022-03-15 22:25:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2952 to 1695. [2022-03-15 22:25:08,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 4.16469893742621) internal successors, (7055), 1694 states have internal predecessors, (7055), 0 states have call successors, (0), 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:25:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 7055 transitions. [2022-03-15 22:25:08,273 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 7055 transitions. Word has length 17 [2022-03-15 22:25:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:25:08,273 INFO L470 AbstractCegarLoop]: Abstraction has 1695 states and 7055 transitions. [2022-03-15 22:25:08,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 52 states have internal predecessors, (150), 0 states have call successors, (0), 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:25:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 7055 transitions. [2022-03-15 22:25:08,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:25:08,277 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:25:08,277 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:25:08,302 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:25:08,499 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,SelfDestructingSolverStorable23 [2022-03-15 22:25:08,499 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:25:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:25:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash 728438727, now seen corresponding path program 6 times [2022-03-15 22:25:08,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:25:08,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940432564] [2022-03-15 22:25:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:25:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:25:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:25:09,034 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:25:09,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:25:09,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940432564] [2022-03-15 22:25:09,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940432564] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:25:09,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196597563] [2022-03-15 22:25:09,035 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:25:09,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:25:09,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:25:09,036 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:25:09,039 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:25:09,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:25:09,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:25:09,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:25:09,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:25:09,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:09,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:09,643 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:09,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:09,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:25:09,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:09,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 66 [2022-03-15 22:25:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:25:09,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:25:10,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:10,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:10,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:25:10,915 INFO L353 Elim1Store]: treesize reduction 106, result has 70.0 percent of original size [2022-03-15 22:25:10,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 208 treesize of output 340 [2022-03-15 22:26:18,945 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:26:18,946 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196597563] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:26:18,946 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:26:18,946 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:26:18,946 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [224634794] [2022-03-15 22:26:18,946 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:26:18,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:26:18,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 104 states and 231 transitions. [2022-03-15 22:26:18,954 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:26:54,590 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 69 new interpolants: [53178#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted3 (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (not sorted1) (not (< j M))) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< j M))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ j 1) M) (not sorted1) (not (< j M))) (or sorted1 (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (not sorted3) (not (< j M)) (not sorted2) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1)))))), 53209#(and (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (< (+ i 4) N) (< (select A (+ j 1)) (select A (+ 2 j))) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)))), 53177#(and (or sorted1 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (not sorted2)) (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< j M) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 53202#(and (or sorted1 (not (= (+ 2 k) N)) (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (not (= (+ 2 k) N)) (<= N (+ 2 i)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (<= N (+ 2 i)) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or sorted3 (<= N (+ 2 i)) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j))), 53216#(and (or (<= N (+ k 1)) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j)) (or sorted1 (not (= (+ 2 k) N)) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not sorted2) (<= M j)) (or (not (= (+ 2 k) N)) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (<= M j)) (or (<= N (+ k 1)) sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (not (= (+ 2 k) N)) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 4) N) (= (select A (+ j 1)) (select A k)) (<= N (+ 3 i)) (<= (+ N M) (+ 2 k j))) (or (<= N (+ k 1)) sorted3 (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted2) (<= M j))), 53198#(and (or (<= N (+ i 1)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= N (+ i 1)) (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= N (+ i 1)) sorted3 (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= N (+ i 1)) sorted2 (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= N (+ i 1)) sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 2 i) N) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))))), 53149#(and (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (not sorted1)) (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted1 (<= (+ 3 k) N) (not (< (+ k 1) N)) (not sorted3) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or sorted3 (<= (+ 3 k) N) (not (< (+ k 1) N)) (not sorted1))), 53212#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= N (+ 2 i)) (= (select A (+ j 1)) (select A k)) (< (+ 3 i) N) (<= (+ N M) (+ 2 k j))) (or (<= N (+ k 1)) sorted3 (<= N (+ 2 i)) (< (+ 2 k) N) (< (+ 3 i) N) (not sorted2) (<= (select A (+ 2 i)) (select A (+ i 1))) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or (not (= (+ 2 k) N)) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or sorted1 (not (= (+ 2 k) N)) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or (<= N (+ k 1)) sorted2 (<= N (+ 2 i)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j))), 53195#(and (or (<= N (+ k 1)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted3 (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (<= (select A (+ k 1)) (select A k)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted2 (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1)))), 53186#(and (or (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (<= M j)) (or sorted1 (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (<= M j)) (or (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (select A (+ 2 i)) (select A (+ 3 i))) (<= M j)) (or (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (<= M j)) (or sorted3 (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j)) (or sorted2 (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j))), 53174#(and (or sorted3 (not (= (+ 2 k) N)) (< j M) (not sorted1)) (or sorted2 (not (= (+ 2 k) N)) (< j M) (not sorted1)) (or (not (= (+ 2 k) N)) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or sorted1 (not (= (+ 2 k) N)) (< j M) (<= (select A (+ k 1)) (select A k)) (not sorted2))), 53155#(and (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 53156#(and (or sorted1 (not sorted3) (< j M) (not sorted2)) (or sorted2 (< j M) (not sorted1)) (or sorted3 (< j M) (not sorted1))), 53200#(and (or sorted1 (not (= (+ 2 k) N)) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (not sorted2)) (or (<= N (+ k 1)) sorted2 (<= N (+ 2 i)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not (= (+ 2 k) N)) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or (<= N (+ k 1)) sorted3 (<= N (+ 2 i)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 53192#(and (or sorted2 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j)) (or (<= N (+ k 1)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A (+ j 1)) (select A k)) (<= (+ N M) (+ 2 k j))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not sorted2) (not (< (select A j) (select A (+ j 1)))) (<= M j)) (or (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1))) (<= M j)) (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j))), 53215#(and (or (<= N (+ k 1)) sorted1 (<= (select A k) (select A (+ j 1))) (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= N (+ 2 i)) (< (+ 3 i) N) (= (+ 2 j) k) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) sorted2 (<= N (+ 2 i)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ N M) (+ k j 4)) (< (+ 3 i) N)) (or (<= N (+ k 1)) sorted3 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< (+ 2 k) N) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ k 1)) (<= N (+ 2 i)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))))), 53173#(and (or (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (< (select A k) (select A (+ k 1))) (not sorted1)) (or sorted3 (<= (+ 3 k) N) (not (< (+ k 1) N)) (< j M) (not sorted1)) (or sorted1 (<= (+ 3 k) N) (not (< (+ k 1) N)) (not sorted3) (< j M) (not sorted2) (not (< (select A k) (select A (+ k 1))))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< j M) (not sorted1))), 53171#(and (or sorted1 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted3) (not (< j M)) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or sorted2 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted3) (not (< j M)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (not (< j M)) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1)))))), 53204#(and (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= N (+ 2 i)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)))), 53184#(and (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (not sorted2) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (not sorted2)) (or (< (+ i 4) N) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2))), 53208#(and (or (not (= (+ 2 k) N)) (< (+ j 1) M) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (not (< j M)) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or sorted1 (not (= (+ 2 k) N)) (< (+ j 1) M) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (not (= (+ 2 k) N)) (< (+ j 1) M) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) sorted3 (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) sorted2 (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (not (< j M)) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 53214#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (not (< (+ i 1) N)) (< (+ 2 i) N) (= (+ 2 j) k) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted1 (<= (select A k) (select A (+ j 1))) (<= (+ 3 k) N) (<= (select A (+ j 1)) (select A j)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (< (+ N M) (+ k j 4))) (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M (+ j 1))) (or (<= N (+ k 1)) sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M (+ j 1))) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M (+ j 1)))), 53213#(and (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A (+ j 1)) 1) (select A k)) (not sorted1) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) sorted1 (<= (select A k) (select A (+ j 1))) (<= (+ 3 k) N) (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (< (+ N M) (+ k j 4))) (or sorted3 (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (<= M (+ j 1))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (= (+ 2 j) k) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= (+ (select A j) 1) (select A (+ j 1))) (< (+ N M) (+ k j 4)))), 53194#(and (or (<= N (+ k 1)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted3 (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (not (< (+ j 1) M)) (not (< (+ k 1) N)) (not sorted3) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (+ 2 k) N) (not sorted2) (< (+ 2 j) M) (not (< (select A k) (select A (+ k 1)))) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted2 (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1)))), 53196#(and (or (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N)) (or sorted2 (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N)) (or sorted3 (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or sorted1 (not (< (+ j 1) M)) (not sorted3) (< (+ i 1) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1)))))), 53203#(and (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ 2 i)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1)))), 53158#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (not sorted2)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 53179#(and (or sorted1 (not (= (+ 2 k) N)) (< (+ j 1) M) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (<= M j)) (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< j M))) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ j 1) M) (not sorted1) (not (< j M)))), 53162#(and (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (not sorted2) (< (+ k 1) N)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (< j M) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< j M) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N))), 53191#(and (or (<= N (+ i 1)) (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= N (+ i 1)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= N (+ i 1)) sorted2 (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= N (+ i 1)) sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (not sorted3) (< (+ 2 i) N) (not sorted2) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ i 1)) sorted3 (< (+ 2 i) N) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= M (+ j 1)))), 53211#(and (or (<= N (+ k 1)) (< (+ i 4) N) (< (select A (+ j 1)) (select A (+ 2 j))) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) (not (< (+ j 1) M)) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted3 (not (< (+ j 1) M)) (< (+ i 4) N) (<= N (+ 3 i)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) sorted2 (not (< (+ j 1) M)) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1)))))), 53157#(and (or sorted3 (< (+ i 1) N) (< j M) (not sorted1)) (or sorted2 (< (+ i 1) N) (< j M) (not sorted1)) (or sorted1 (not sorted3) (< (+ i 1) N) (< j M) (not sorted2))), 53190#(and (or sorted3 (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M) (< (select A j) (select A (+ j 1)))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M)) (or sorted2 (not (< (+ j 1) M)) (< (+ i 1) N) (not sorted1) (< (+ 2 j) M)) (or sorted1 (not (< (+ j 1) M)) (not sorted3) (< (+ i 1) N) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1)))))), 53153#(and (or sorted1 (not sorted3) (< (+ i 1) N) (<= (+ 2 k) N) (not sorted2)) (or sorted2 (< (+ i 1) N) (<= (+ 2 k) N) (not sorted1)) (or sorted3 (< (+ i 1) N) (<= (+ 2 k) N) (not sorted1))), 53151#(and (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2)) (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))))), 53165#(and (or (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M))) (or sorted3 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (<= M j)) (or sorted1 (< (+ j 1) M) (not sorted3) (< (+ i 1) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1)))))), 53175#(and (or sorted3 (not (= (+ 2 k) N)) (< (+ i 1) N) (< j M) (not sorted1)) (or sorted2 (not (= (+ 2 k) N)) (< (+ i 1) N) (< j M) (not sorted1)) (or sorted1 (not (= (+ 2 k) N)) (< (+ i 1) N) (< j M) (<= (select A (+ k 1)) (select A k)) (not sorted2)) (or (not (= (+ 2 k) N)) (< (+ i 1) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1))), 53193#(and (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N)) (or sorted1 (not (< (+ j 1) M)) (not sorted3) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (not (< (+ j 1) M)) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or sorted3 (not sorted1) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or sorted2 (not (< (+ j 1) M)) (not sorted1) (< (+ 2 j) M) (< (+ k 1) N))), 53167#(and (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or sorted1 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted3) (not (< j M)) (< (+ 3 i) N) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (<= N (+ 2 i)) (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (< (+ j 1) M) (not sorted3) (not (< j M)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1)))))), 53205#(and (or (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (<= N (+ 2 i)) (<= (select A (+ k 1)) (select A k)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (< (+ 3 i) N) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (not (< (+ j 1) M)) (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not (< (+ j 1) M)) (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1)))) (or sorted3 (<= N (+ 2 i)) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (not (< (+ j 1) M)) (<= N (+ 2 i)) (< (select A (+ j 1)) (select A (+ 2 j))) (not (< (+ k 1) N)) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (<= (select A (+ 2 i)) (select A (+ i 1))))), 53168#(and (or sorted3 (< (+ j 1) M) (not sorted1) (< (+ k 1) N) (<= M j)) (or sorted2 (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ k 1) N)) (or sorted1 (< (+ j 1) M) (not sorted3) (not (< j M)) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not sorted1) (not (< j M)) (< (+ k 1) N) (< (select A j) (select A (+ j 1))))), 53207#(and (or (<= N (+ k 1)) sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (not (= (+ 2 k) N)) (< (+ i 4) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not sorted2)) (or (not (= (+ 2 k) N)) (< (+ i 4) N) (< j M) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2)) (or (<= N (+ k 1)) sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not (= (+ 2 k) N)) (< (+ i 4) N) (< j M) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2))), 53159#(and (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2))), 53152#(and (or sorted3 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (<= N (+ 2 i)) (not sorted3) (< (+ 3 i) N) (not sorted2)) (or sorted2 (<= N (+ 2 i)) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ 2 i)) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2))), 53160#(and (or sorted1 (not sorted3) (<= (+ 2 k) N) (< j M) (not sorted2)) (or sorted2 (<= (+ 2 k) N) (< j M) (not sorted1)) (or sorted3 (<= (+ 2 k) N) (< j M) (not sorted1))), 53206#(and (or sorted1 (not (= (+ 2 k) N)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (not sorted2)) (or (not (= (+ 2 k) N)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2)) (or (<= N (+ k 1)) sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ k 1)) sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (not (= (+ 2 k) N)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2))), 53217#(and (or (<= N (+ k 1)) sorted1 (<= (select A k) (select A (+ j 1))) (<= (+ 3 k) N) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= (select A (+ k 1)) (select A k)) (<= N (+ 3 i)) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 4) N) (<= N (+ 3 i)) (= (+ 2 j) k) (< (+ N M) (+ k j 4))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 4) N) (<= (+ N M) (+ k j 4)) (<= N (+ 3 i))) (or (<= N (+ k 1)) sorted3 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (<= N (+ 3 i)) (< (+ 2 k) N) (<= (select A (+ 3 i)) (select A (+ 2 i))) (<= M (+ j 1)))), 53183#(and (or (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N))), 53182#(and (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2)) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2)) (or (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (select A (+ 2 i)) (select A (+ 3 i))))), 53163#(and (or sorted1 (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (not sorted2) (< (+ k 1) N)) (or (<= N (+ 2 i)) (not sorted3) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted3 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted2 (<= N (+ 2 i)) (< j M) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))))), 53161#(and (or sorted3 (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not sorted1)) (or sorted1 (not sorted3) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not sorted2)) (or sorted2 (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not sorted1))), 53187#(and (or (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (<= M j)) (or (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i))) (<= M j)) (or sorted3 (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or sorted2 (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M j)) (or (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (<= M j)) (or sorted1 (< (+ j 1) M) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (<= M j)) (or (< (+ j 1) M) (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< (select A j) (select A (+ j 1))) (<= M j))), 53210#(and (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1))) (or (< (+ i 4) N) (< (select A (+ j 1)) (select A (+ 2 j))) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or sorted3 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1)) (< (select A (+ 2 i)) (select A (+ 3 i)))) (or sorted2 (< (+ i 4) N) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ 2 j) M) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= M (+ j 1))) (or sorted1 (<= (select A (+ 2 j)) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (< (+ i 4) N) (not sorted3) (<= N (+ 3 i)) (not sorted2) (< (+ 2 j) M) (< (+ k 1) N) (<= M (+ j 1)))), 53170#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N) (< (select A j) (select A (+ j 1)))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted2 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or sorted3 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N) (<= M j))), 53201#(and (or (not (= (+ 2 k) N)) (<= N (+ 2 i)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not sorted2)) (or sorted1 (not (= (+ 2 k) N)) (<= N (+ 2 i)) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (not sorted2)) (or (<= N (+ k 1)) sorted2 (<= N (+ 2 i)) (< j M) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= N (+ k 1)) sorted3 (<= N (+ 2 i)) (< j M) (< (+ 2 k) N) (not sorted1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))))), 53189#(and (or sorted3 (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (< (+ j 1) M)) (< (select A (+ j 1)) (select A (+ 2 j))) (not sorted1) (< (+ 2 j) M)) (or sorted2 (not (< (+ j 1) M)) (not sorted1) (< (+ 2 j) M)) (or (not (< (+ j 1) M)) (not sorted1) (< (+ 2 j) M) (< (select A j) (select A (+ j 1)))) (or sorted1 (not (< (+ j 1) M)) (not sorted3) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1)))))), 53154#(and (or sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N)) (or (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted1 (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not sorted2) (< (+ k 1) N)) (or sorted3 (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ k 1) N))), 53181#(and (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= (+ N M) (+ 2 k j))) (or (<= N (+ k 1)) sorted1 (<= (+ 3 k) N) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not sorted2) (<= (+ N M) (+ 2 k j)) (<= (select A k) (select A j))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1) (<= (+ N M) (+ 2 k j))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= (+ (select A j) 1) (select A k)) (<= (+ N M) (+ 2 k j))) (or (<= N (+ k 1)) sorted3 (<= (+ 3 k) N) (< (+ i 1) N) (not sorted1) (<= (+ N M) (+ 2 k j))) (or (<= N (+ k 1)) (<= (+ 3 k) N) (< (+ i 1) N) (= (select A (+ j 1)) (select A k)) (<= (+ N M) (+ 2 k j)))), 53164#(and (or sorted1 (< (+ j 1) M) (not sorted3) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or sorted2 (< (+ j 1) M) (not sorted1) (not (< j M))) (or sorted3 (< (+ j 1) M) (not sorted1) (<= M j))), 53199#(and (or (<= N (+ k 1)) sorted2 (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) (not (< (+ i 1) N)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (< (+ 2 j) M) (<= M (+ j 1)))), 53169#(and (or sorted2 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (+ k 1) N)) (or sorted1 (< (+ j 1) M) (not sorted3) (< (+ i 1) N) (not (< j M)) (not sorted2) (< (+ k 1) N) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (< (+ k 1) N) (<= M j)) (or (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M)) (< (+ k 1) N) (< (select A j) (select A (+ j 1))))), 53197#(and (or (<= N (+ k 1)) sorted2 (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= N (+ k 1)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) (< (select A (+ j 1)) (select A (+ 2 j))) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or (not (< (+ k 1) N)) (< (+ i 1) N) (< (select A k) (select A (+ k 1))) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ j 1) M)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (< (select A (+ j 1)) (select A (+ 2 j)))) (not sorted2) (< (+ 2 j) M) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (< (+ 2 j) M) (<= M (+ j 1)))), 53150#(and (or sorted1 (not sorted3) (< (+ i 1) N) (not sorted2)) (or sorted3 (< (+ i 1) N) (not sorted1)) (or sorted2 (< (+ i 1) N) (not sorted1))), 53180#(and (or (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ i 1) N) (< (select A k) (select A (+ k 1))) (not sorted1) (not (< j M))) (or sorted1 (not (= (+ 2 k) N)) (< (+ j 1) M) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (not (< j M)) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ j 1) M) (< (+ i 1) N) (not sorted1) (not (< j M))) (or sorted3 (< (+ j 1) M) (not (< (+ k 1) N)) (< (+ i 1) N) (< (+ 2 k) N) (not sorted1) (<= M j))), 53172#(and (or sorted3 (not (= (+ 2 k) N)) (< (+ i 1) N) (not sorted1)) (or sorted2 (not (= (+ 2 k) N)) (< (+ i 1) N) (not sorted1)) (or (not (= (+ 2 k) N)) (< (+ i 1) N) (<= (+ (select A k) 1) (select A (+ k 1))) (not sorted1)) (or sorted1 (not (= (+ 2 k) N)) (< (+ i 1) N) (<= (select A (+ k 1)) (select A k)) (not sorted2))), 53176#(and (or sorted3 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted2 (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1))))) (or sorted1 (not (= (+ 2 k) N)) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not sorted2))), 53185#(and (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (< (select A i) (select A (+ i 1))) (not sorted2) (< (+ k 1) N)) (or sorted2 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or sorted1 (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or (< (+ i 4) N) (not sorted3) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N)) (or sorted3 (< (+ i 4) N) (< j M) (<= N (+ 3 i)) (<= (select A (+ 3 i)) (select A (+ 2 i))) (not sorted1) (<= (select A (+ i 1)) (select A i)) (< (+ k 1) N) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (< (+ i 4) N) (not sorted3) (< j M) (<= N (+ 3 i)) (not sorted2) (< (+ k 1) N) (< (select A (+ 2 i)) (select A (+ 3 i))))), 53188#(and (or sorted3 (< (+ j 1) M) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j)) (or sorted1 (not (= (+ 2 k) N)) (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (not (< (+ k 1) N)) (< (+ 2 i) N) (< (+ 2 k) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1)))) (or (<= N (+ k 1)) sorted2 (<= (+ 3 k) N) (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))))), 53166#(and (or (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (< (select A i) (select A (+ i 1))) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted1 (< (+ j 1) M) (not (< (+ i 1) N)) (not sorted3) (< (+ 2 i) N) (not (< j M)) (not sorted2) (not (< (select A j) (select A (+ j 1))))) (or sorted3 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< (select A i) (select A (+ i 1)))) (<= M j)) (or sorted2 (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1))))) (or (< (+ j 1) M) (not (< (+ i 1) N)) (< (+ 2 i) N) (not sorted1) (not (< j M)) (not (< (select A i) (select A (+ i 1)))) (< (select A j) (select A (+ j 1)))))] [2022-03-15 22:26:54,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-03-15 22:26:54,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:26:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-03-15 22:26:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=8261, Unknown=0, NotChecked=0, Total=8742 [2022-03-15 22:26:54,591 INFO L87 Difference]: Start difference. First operand 1695 states and 7055 transitions. Second operand has 80 states, 79 states have (on average 2.670886075949367) internal successors, (211), 79 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:28:29,570 WARN L244 SmtUtils]: Removed 12 from assertion stack [2022-03-15 22:28:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 22:28:29,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5908 ImplicationChecksByTransitivity, 100.2s TimeCoverageRelationStatistics Valid=3514, Invalid=20666, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:28:29,572 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 704 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-15 22:28:29,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [704 Valid, 0 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-15 22:28:29,574 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:28:29,586 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:28:29,586 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:28:29,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-15 22:28:29,774 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,SelfDestructingSolverStorable24 [2022-03-15 22:28:29,774 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (1695states) and FLOYD_HOARE automaton (currently 64 states, 80 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 223 for 1101ms.. [2022-03-15 22:28:29,776 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:28:29,776 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:28:29,776 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:28:29,777 INFO L732 BasicCegarLoop]: Path program histogram: [7, 6, 6, 3, 1, 1, 1] [2022-03-15 22:28:29,779 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:28:29,779 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:28:29,781 INFO L202 PluginConnector]: Adding new model sorted.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:28:29 BasicIcfg [2022-03-15 22:28:29,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:28:29,781 INFO L158 Benchmark]: Toolchain (without parser) took 723812.60ms. Allocated memory was 176.2MB in the beginning and 729.8MB in the end (delta: 553.6MB). Free memory was 134.7MB in the beginning and 576.9MB in the end (delta: -442.2MB). Peak memory consumption was 527.2MB. Max. memory is 8.0GB. [2022-03-15 22:28:29,781 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 176.2MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 122.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:28:29,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.84ms. Allocated memory is still 176.2MB. Free memory was 134.6MB in the beginning and 133.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:28:29,782 INFO L158 Benchmark]: Boogie Preprocessor took 14.82ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 132.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:28:29,782 INFO L158 Benchmark]: RCFGBuilder took 256.56ms. Allocated memory is still 176.2MB. Free memory was 132.1MB in the beginning and 122.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-15 22:28:29,782 INFO L158 Benchmark]: TraceAbstraction took 723508.23ms. Allocated memory was 176.2MB in the beginning and 729.8MB in the end (delta: 553.6MB). Free memory was 121.7MB in the beginning and 576.9MB in the end (delta: -455.2MB). Peak memory consumption was 514.6MB. Max. memory is 8.0GB. [2022-03-15 22:28:29,783 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.13ms. Allocated memory is still 176.2MB. Free memory was 135.8MB in the beginning and 135.7MB in the end (delta: 122.5kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.84ms. Allocated memory is still 176.2MB. Free memory was 134.6MB in the beginning and 133.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.82ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 132.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 256.56ms. Allocated memory is still 176.2MB. Free memory was 132.1MB in the beginning and 122.2MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 723508.23ms. Allocated memory was 176.2MB in the beginning and 729.8MB in the end (delta: 553.6MB). Free memory was 121.7MB in the beginning and 576.9MB in the end (delta: -455.2MB). Peak memory consumption was 514.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 39 PlacesBefore, 25 PlacesAfterwards, 32 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 3 FixpointIterations, 9 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 124, positive conditional: 0, positive unconditional: 124, 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: 124, positive: 58, positive conditional: 0, positive unconditional: 58, 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: 69]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (1695states) and FLOYD_HOARE automaton (currently 64 states, 80 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 223 for 1101ms.. - TimeoutResultAtElement [Line: 62]: 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 (1695states) and FLOYD_HOARE automaton (currently 64 states, 80 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 223 for 1101ms.. - TimeoutResultAtElement [Line: 62]: 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 (1695states) and FLOYD_HOARE automaton (currently 64 states, 80 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 223 for 1101ms.. - TimeoutResultAtElement [Line: 63]: 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 (1695states) and FLOYD_HOARE automaton (currently 64 states, 80 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 223 for 1101ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 723.4s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 438.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9444 SdHoareTripleChecker+Valid, 21.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9444 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 18.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8177 mSDsCounter, 3817 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34259 IncrementalHoareTripleChecker+Invalid, 38076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3817 mSolverCounterUnsat, 0 mSDtfsCounter, 34259 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3918 GetRequests, 821 SyntacticMatches, 111 SemanticMatches, 2985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235551 ImplicationChecksByTransitivity, 444.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1695occurred in iteration=24, InterpolantAutomatonStates: 2254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 11042 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 152.2s InterpolantComputationTime, 673 NumberOfCodeBlocks, 673 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 918 ConstructedInterpolants, 0 QuantifiedInterpolants, 16462 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 271 ConjunctsInUnsatCore, 67 InterpolantComputations, 4 PerfectInterpolantSequences, 114/380 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