/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 22:01:58,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 22:01:58,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 22:01:58,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 22:01:58,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 22:01:58,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 22:01:58,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 22:01:58,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 22:01:58,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 22:01:58,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 22:01:58,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 22:01:58,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 22:01:58,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 22:01:58,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 22:01:58,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 22:01:58,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 22:01:58,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 22:01:58,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 22:01:58,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 22:01:58,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 22:01:58,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 22:01:58,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 22:01:58,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 22:01:58,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 22:01:58,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 22:01:58,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 22:01:58,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 22:01:58,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 22:01:58,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 22:01:58,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 22:01:58,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 22:01:58,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 22:01:58,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 22:01:58,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 22:01:58,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 22:01:58,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 22:01:58,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 22:01:58,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 22:01:58,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 22:01:58,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 22:01:58,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 22:01:58,471 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:01:58,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 22:01:58,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 22:01:58,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 22:01:58,493 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 22:01:58,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 22:01:58,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 22:01:58,493 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 22:01:58,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 22:01:58,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 22:01:58,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:01:58,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 22:01:58,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 22:01:58,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 22:01:58,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 22:01:58,497 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 22:01:58,497 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 22:01:58,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 22:01:58,497 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:01:58,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 22:01:58,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 22:01:58,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 22:01:58,773 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 22:01:58,778 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 22:01:58,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl [2022-03-15 22:01:58,779 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array.wvr.bpl' [2022-03-15 22:01:58,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 22:01:58,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 22:01:58,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 22:01:58,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 22:01:58,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 22:01:58,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,824 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 22:01:58,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 22:01:58,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 22:01:58,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 22:01:58,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 22:01:58,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,840 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 22:01:58,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 22:01:58,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 22:01:58,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 22:01:58,846 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/1) ... [2022-03-15 22:01:58,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 22:01:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:01:58,873 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:01:58,875 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:01:58,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 22:01:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 22:01:58,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 22:01:58,898 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 22:01:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 22:01:58,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 22:01:58,898 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 22:01:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 22:01:58,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 22:01:58,898 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 22:01:58,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 22:01:58,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 22:01:58,899 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:01:58,932 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 22:01:58,933 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 22:01:59,043 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 22:01:59,071 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 22:01:59,071 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 22:01:59,073 INFO L202 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:01:59 BoogieIcfgContainer [2022-03-15 22:01:59,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 22:01:59,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 22:01:59,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 22:01:59,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 22:01:59,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 10:01:58" (1/2) ... [2022-03-15 22:01:59,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597f4fb9 and model type max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 10:01:59, skipping insertion in model container [2022-03-15 22:01:59,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 10:01:59" (2/2) ... [2022-03-15 22:01:59,093 INFO L111 eAbstractionObserver]: Analyzing ICFG max-array.wvr.bpl [2022-03-15 22:01:59,099 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 22:01:59,099 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 22:01:59,103 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 22:01:59,104 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 22:01:59,133 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 22:01:59,181 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 22:01:59,185 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:01:59,186 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 22:01:59,213 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 22:01:59,228 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:01:59,230 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 82 flow [2022-03-15 22:01:59,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 82 flow [2022-03-15 22:01:59,256 INFO L129 PetriNetUnfolder]: 3/26 cut-off events. [2022-03-15 22:01:59,256 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 22:01:59,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2022-03-15 22:01:59,259 INFO L116 LiptonReduction]: Number of co-enabled transitions 144 [2022-03-15 22:01:59,478 INFO L131 LiptonReduction]: Checked pairs total: 106 [2022-03-15 22:01:59,479 INFO L133 LiptonReduction]: Total number of compositions: 12 [2022-03-15 22:01:59,490 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 18 transitions, 60 flow [2022-03-15 22:01:59,506 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:01:59,507 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:01:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 22:01:59,511 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:59,512 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:59,512 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:01:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:59,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1022751962, now seen corresponding path program 1 times [2022-03-15 22:01:59,526 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:59,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408380068] [2022-03-15 22:01:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:01:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:01:59,623 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:01:59,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:01:59,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408380068] [2022-03-15 22:01:59,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408380068] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:01:59,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:01:59,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 22:01:59,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575248043] [2022-03-15 22:01:59,628 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:01:59,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:01:59,649 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 22:01:59,650 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:01:59,900 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:01:59,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:01:59,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:01:59,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:01:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:01:59,920 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:01:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:01:59,943 INFO L93 Difference]: Finished difference Result 45 states and 117 transitions. [2022-03-15 22:01:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:01:59,945 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:01:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:01:59,951 INFO L225 Difference]: With dead ends: 45 [2022-03-15 22:01:59,951 INFO L226 Difference]: Without dead ends: 41 [2022-03-15 22:01:59,951 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:01:59,954 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:01:59,954 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:01:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-15 22:01:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-03-15 22:01:59,975 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:01:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 108 transitions. [2022-03-15 22:01:59,977 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 108 transitions. Word has length 11 [2022-03-15 22:01:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:01:59,977 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 108 transitions. [2022-03-15 22:01:59,978 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:01:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 108 transitions. [2022-03-15 22:01:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:01:59,995 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:01:59,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:01:59,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 22:01:59,996 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:01:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:01:59,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1617420820, now seen corresponding path program 1 times [2022-03-15 22:01:59,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:01:59,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209511241] [2022-03-15 22:01:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:01:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:00,039 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:00,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209511241] [2022-03-15 22:02:00,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209511241] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:02:00,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:02:00,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-15 22:02:00,040 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [233939112] [2022-03-15 22:02:00,040 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:00,041 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:00,043 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:02:00,043 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:00,234 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:02:00,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 22:02:00,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:00,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 22:02:00,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:02:00,243 INFO L87 Difference]: Start difference. First operand 41 states and 108 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:00,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:00,270 INFO L93 Difference]: Finished difference Result 44 states and 116 transitions. [2022-03-15 22:02:00,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 22:02:00,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:02:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:00,272 INFO L225 Difference]: With dead ends: 44 [2022-03-15 22:02:00,272 INFO L226 Difference]: Without dead ends: 44 [2022-03-15 22:02:00,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 22:02:00,274 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:00,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 0 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:02:00,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-15 22:02:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2022-03-15 22:02:00,280 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:02:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-03-15 22:02:00,281 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 80 transitions. Word has length 12 [2022-03-15 22:02:00,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:00,281 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 80 transitions. [2022-03-15 22:02:00,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 80 transitions. [2022-03-15 22:02:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-03-15 22:02:00,282 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:00,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:00,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 22:02:00,282 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:02:00,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:00,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1327324498, now seen corresponding path program 1 times [2022-03-15 22:02:00,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:00,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913478251] [2022-03-15 22:02:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:00,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:00,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913478251] [2022-03-15 22:02:00,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913478251] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 22:02:00,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 22:02:00,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 22:02:00,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344715799] [2022-03-15 22:02:00,322 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:00,323 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:00,325 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2022-03-15 22:02:00,325 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:00,447 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 22:02:00,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 22:02:00,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:00,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 22:02:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:02:00,448 INFO L87 Difference]: Start difference. First operand 31 states and 80 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:00,482 INFO L93 Difference]: Finished difference Result 48 states and 130 transitions. [2022-03-15 22:02:00,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 22:02:00,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-03-15 22:02:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:00,484 INFO L225 Difference]: With dead ends: 48 [2022-03-15 22:02:00,484 INFO L226 Difference]: Without dead ends: 48 [2022-03-15 22:02:00,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 22:02:00,485 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:00,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 0 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 22:02:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-15 22:02:00,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2022-03-15 22:02:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 39 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 106 transitions. [2022-03-15 22:02:00,490 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 106 transitions. Word has length 12 [2022-03-15 22:02:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:00,490 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 106 transitions. [2022-03-15 22:02:00,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 106 transitions. [2022-03-15 22:02:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 22:02:00,491 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:00,491 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:00,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 22:02:00,491 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:02:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:00,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1745317284, now seen corresponding path program 1 times [2022-03-15 22:02:00,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:00,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336700510] [2022-03-15 22:02:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:00,657 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:02:00,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:00,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336700510] [2022-03-15 22:02:00,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336700510] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:00,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43408058] [2022-03-15 22:02:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:00,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:00,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:00,660 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:02:00,664 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:02:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:00,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2022-03-15 22:02:00,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:00,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-03-15 22:02:00,977 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:02:00,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:01,054 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:01,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2022-03-15 22:02:01,178 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:02:01,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43408058] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:01,179 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:01,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-03-15 22:02:01,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866684995] [2022-03-15 22:02:01,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:01,181 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:01,183 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 73 transitions. [2022-03-15 22:02:01,183 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:01,962 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [543#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2)) (or (< j M) (= k 0))), 545#(and (or (< j M) (not (< max1 (select A i))) (= (select A i) max2)) (or (< j M) (< max1 (select A i)) (= max2 max1))), 544#(and (or (not (< max1 (select A i))) (= (select A i) max2)) (or (< max1 (select A i)) (= max2 max1))), 546#(and (or (< j M) (= max2 max1)) (or (< j M) (= (+ i (* (- 1) max2)) 0)) (or (< j M) (= k 0)) (or (< j M) (= max1 0))), 542#(or (< j M) (= max2 max1))] [2022-03-15 22:02:01,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:02:01,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:02:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-03-15 22:02:01,963 INFO L87 Difference]: Start difference. First operand 40 states and 106 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:02,168 INFO L93 Difference]: Finished difference Result 76 states and 207 transitions. [2022-03-15 22:02:02,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-15 22:02:02,168 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-03-15 22:02:02,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:02,169 INFO L225 Difference]: With dead ends: 76 [2022-03-15 22:02:02,169 INFO L226 Difference]: Without dead ends: 72 [2022-03-15 22:02:02,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:02:02,170 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:02,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:02,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-15 22:02:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2022-03-15 22:02:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.8656716417910446) internal successors, (192), 67 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 192 transitions. [2022-03-15 22:02:02,175 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 192 transitions. Word has length 13 [2022-03-15 22:02:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:02,175 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 192 transitions. [2022-03-15 22:02:02,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:02,175 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 192 transitions. [2022-03-15 22:02:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:02:02,176 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:02,176 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:02,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-15 22:02:02,386 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:02:02,386 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:02:02,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1818191762, now seen corresponding path program 2 times [2022-03-15 22:02:02,388 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:02,388 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21683106] [2022-03-15 22:02:02,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:02,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:02,434 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:02:02,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:02,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21683106] [2022-03-15 22:02:02,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21683106] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:02,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643558646] [2022-03-15 22:02:02,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:02,437 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:02:02,445 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:02:02,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:02,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:02,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:02:02,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:02,524 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:02:02,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:02,561 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:02:02,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643558646] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:02,561 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:02,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-03-15 22:02:02,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1894365046] [2022-03-15 22:02:02,561 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:02,562 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:02,566 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:02:02,566 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:03,138 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [851#(or (<= N i) (< (+ i 1) N)), 843#(or (<= k i) (< j M)), 865#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 862#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 852#(or (<= N (+ i 1)) (< (+ 2 i) N)), 864#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 860#(or (< j M) (< k N) (< i N)), 850#(< i N), 853#(< j M), 861#(or (<= N i) (< (+ i 1) N) (< k N)), 855#(or (<= N i) (< (+ i 1) N) (< j M)), 859#(or (< k N) (< i N)), 863#(or (< j M) (<= (+ k 1) i)), 856#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 854#(or (< j M) (< i N)), 857#(or (<= (+ k 1) N) (< j M)), 858#(or (<= (+ 2 k) N) (< j M))] [2022-03-15 22:02:03,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-15 22:02:03,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-15 22:02:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2022-03-15 22:02:03,140 INFO L87 Difference]: Start difference. First operand 68 states and 192 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:04,051 INFO L93 Difference]: Finished difference Result 171 states and 489 transitions. [2022-03-15 22:02:04,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-15 22:02:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:02:04,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:04,053 INFO L225 Difference]: With dead ends: 171 [2022-03-15 22:02:04,053 INFO L226 Difference]: Without dead ends: 171 [2022-03-15 22:02:04,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:02:04,055 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:04,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:02:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-03-15 22:02:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 98. [2022-03-15 22:02:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 3.2989690721649483) internal successors, (320), 97 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 320 transitions. [2022-03-15 22:02:04,062 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 320 transitions. Word has length 14 [2022-03-15 22:02:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:04,062 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 320 transitions. [2022-03-15 22:02:04,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 320 transitions. [2022-03-15 22:02:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:02:04,064 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:04,064 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:04,097 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:02:04,279 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:02:04,280 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:02:04,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1729849712, now seen corresponding path program 3 times [2022-03-15 22:02:04,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:04,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424595468] [2022-03-15 22:02:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:04,319 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:02:04,319 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:04,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424595468] [2022-03-15 22:02:04,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424595468] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:04,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639629042] [2022-03-15 22:02:04,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:02:04,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:04,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:04,321 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:02:04,321 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:02:04,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:02:04,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:04,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:02:04,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:04,404 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:02:04,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:04,431 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:02:04,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639629042] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:04,431 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:04,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-03-15 22:02:04,432 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1326353329] [2022-03-15 22:02:04,432 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:04,432 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:04,436 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 93 transitions. [2022-03-15 22:02:04,436 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:04,714 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1389#(or (<= N k) (< i N)), 1391#(or (<= N i) (< (+ i 1) N) (<= N k)), 1388#(< i N), 1390#(or (<= N i) (< (+ i 1) N))] [2022-03-15 22:02:04,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:02:04,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:02:04,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-15 22:02:04,716 INFO L87 Difference]: Start difference. First operand 98 states and 320 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:05,041 INFO L93 Difference]: Finished difference Result 216 states and 644 transitions. [2022-03-15 22:02:05,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-15 22:02:05,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:02:05,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:05,043 INFO L225 Difference]: With dead ends: 216 [2022-03-15 22:02:05,043 INFO L226 Difference]: Without dead ends: 206 [2022-03-15 22:02:05,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:02:05,044 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:05,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-03-15 22:02:05,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 150. [2022-03-15 22:02:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.335570469798658) internal successors, (497), 149 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:05,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 497 transitions. [2022-03-15 22:02:05,055 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 497 transitions. Word has length 14 [2022-03-15 22:02:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:05,055 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 497 transitions. [2022-03-15 22:02:05,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 497 transitions. [2022-03-15 22:02:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:02:05,056 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:05,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:05,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-15 22:02:05,257 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:02:05,257 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:02:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1144577720, now seen corresponding path program 1 times [2022-03-15 22:02:05,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:05,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785239660] [2022-03-15 22:02:05,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:05,305 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:02:05,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:05,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785239660] [2022-03-15 22:02:05,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785239660] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:05,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121096748] [2022-03-15 22:02:05,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:05,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:05,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:05,307 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:02:05,308 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:02:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:05,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:02:05,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:05,379 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:02:05,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:05,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121096748] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:05,422 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:05,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-03-15 22:02:05,422 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372882806] [2022-03-15 22:02:05,422 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:05,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:05,425 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 88 transitions. [2022-03-15 22:02:05,425 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:05,738 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [2034#(or (<= N i) (< (+ i 1) N) (< j M)), 2030#(or (< j M) (< i N)), 2031#(or (< (+ j 1) M) (<= M j)), 2029#(< j M), 2033#(or (<= N i) (<= (+ 2 i) N)), 2032#(or (< (+ j 1) M) (< i N) (<= M j))] [2022-03-15 22:02:05,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-15 22:02:05,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-15 22:02:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-15 22:02:05,739 INFO L87 Difference]: Start difference. First operand 150 states and 497 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:05,904 INFO L93 Difference]: Finished difference Result 204 states and 669 transitions. [2022-03-15 22:02:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:02:05,904 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 22:02:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:05,905 INFO L225 Difference]: With dead ends: 204 [2022-03-15 22:02:05,905 INFO L226 Difference]: Without dead ends: 204 [2022-03-15 22:02:05,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:02:05,906 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:05,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-03-15 22:02:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 164. [2022-03-15 22:02:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 3.312883435582822) internal successors, (540), 163 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 540 transitions. [2022-03-15 22:02:05,916 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 540 transitions. Word has length 14 [2022-03-15 22:02:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:05,917 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 540 transitions. [2022-03-15 22:02:05,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 540 transitions. [2022-03-15 22:02:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 22:02:05,918 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:05,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:05,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-15 22:02:06,118 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:02:06,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:02:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:06,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1863769352, now seen corresponding path program 2 times [2022-03-15 22:02:06,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:06,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834815122] [2022-03-15 22:02:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:06,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:06,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834815122] [2022-03-15 22:02:06,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834815122] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:06,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751999141] [2022-03-15 22:02:06,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:06,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:06,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:06,167 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:02:06,169 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:02:06,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:06,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:06,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 22:02:06,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:06,232 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:02:06,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:06,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751999141] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:06,291 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:06,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-03-15 22:02:06,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261254005] [2022-03-15 22:02:06,291 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:06,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:06,294 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 70 transitions. [2022-03-15 22:02:06,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:06,560 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [2667#(or (< j M) (< i N)), 2668#(or (< (+ j 1) M) (< i N) (<= M j)), 2665#(< j M), 2666#(or (< (+ j 1) M) (<= M j))] [2022-03-15 22:02:06,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-15 22:02:06,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-15 22:02:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-03-15 22:02:06,561 INFO L87 Difference]: Start difference. First operand 164 states and 540 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:02:06,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:06,748 INFO L93 Difference]: Finished difference Result 229 states and 744 transitions. [2022-03-15 22:02:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-15 22:02:06,748 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:02:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:06,750 INFO L225 Difference]: With dead ends: 229 [2022-03-15 22:02:06,750 INFO L226 Difference]: Without dead ends: 229 [2022-03-15 22:02:06,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-03-15 22:02:06,750 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:06,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 22:02:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-03-15 22:02:06,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 166. [2022-03-15 22:02:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.3333333333333335) internal successors, (550), 165 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 550 transitions. [2022-03-15 22:02:06,757 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 550 transitions. Word has length 14 [2022-03-15 22:02:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:06,757 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 550 transitions. [2022-03-15 22:02:06,757 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:02:06,757 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 550 transitions. [2022-03-15 22:02:06,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:06,758 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:06,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:06,776 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:02:06,971 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:02:06,971 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:02:06,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash 529259106, now seen corresponding path program 4 times [2022-03-15 22:02:06,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:06,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810860853] [2022-03-15 22:02:06,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:07,218 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:02:07,218 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:07,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810860853] [2022-03-15 22:02:07,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810860853] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:07,218 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717245244] [2022-03-15 22:02:07,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:02:07,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:07,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:07,220 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:02:07,221 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:02:07,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:02:07,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:07,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:02:07,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:07,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:02:07,645 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:02:07,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:07,984 INFO L353 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2022-03-15 22:02:07,984 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 149 [2022-03-15 22:02:08,825 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:02:08,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717245244] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:08,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:08,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2022-03-15 22:02:08,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [448989961] [2022-03-15 22:02:08,826 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:08,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:08,830 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 118 transitions. [2022-03-15 22:02:08,830 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:13,110 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [3357#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 3364#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 3365#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 3360#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 3359#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 3363#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2)) (or (< j M) (= k 0)) (or (< j M) (<= (+ k 1) i))), 3356#(and (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (< j M) (= k 0)) (or (<= (+ 2 k) N) (< j M))), 3361#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2))), 3368#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1)))))), 3358#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 3355#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1))), 3367#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 3348#(or (<= (+ k 1) N) (< j M) (= max2 max1)), 3349#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 max1))), 3351#(or (< j M) (< i N) (= max2 max1)), 3366#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 3354#(and (or (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (<= (+ 2 k) N) (<= (select A k) max2) (< i N))), 3350#(or (< i N) (= max2 max1)), 3347#(or (< j M) (= max2 max1)), 3370#(and (or (< j M) (= k i)) (or (< j M) (= max2 max1)) (or (< j M) (= k 0)) (or (< j M) (= i max2))), 3369#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 3352#(or (<= (+ k 1) N) (< i N) (= max2 max1)), 3362#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2))), 3353#(or (<= (+ k 1) N) (< j M) (< i N) (= max2 max1))] [2022-03-15 22:02:13,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:02:13,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:13,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:02:13,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2022-03-15 22:02:13,112 INFO L87 Difference]: Start difference. First operand 166 states and 550 transitions. Second operand has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:20,166 INFO L93 Difference]: Finished difference Result 440 states and 1352 transitions. [2022-03-15 22:02:20,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-03-15 22:02:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:02:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:20,168 INFO L225 Difference]: With dead ends: 440 [2022-03-15 22:02:20,168 INFO L226 Difference]: Without dead ends: 423 [2022-03-15 22:02:20,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1745, Invalid=8967, Unknown=0, NotChecked=0, Total=10712 [2022-03-15 22:02:20,171 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 426 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:20,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [426 Valid, 0 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 22:02:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-03-15 22:02:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 211. [2022-03-15 22:02:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.4571428571428573) internal successors, (726), 210 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 726 transitions. [2022-03-15 22:02:20,177 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 726 transitions. Word has length 15 [2022-03-15 22:02:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:20,177 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 726 transitions. [2022-03-15 22:02:20,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.8125) internal successors, (90), 32 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 726 transitions. [2022-03-15 22:02:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:20,178 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:20,178 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:20,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-15 22:02:20,392 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:02:20,392 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:02:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 689522916, now seen corresponding path program 5 times [2022-03-15 22:02:20,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:20,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221621909] [2022-03-15 22:02:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:20,454 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:02:20,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:20,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221621909] [2022-03-15 22:02:20,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221621909] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:20,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536396998] [2022-03-15 22:02:20,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:02:20,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:20,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:20,456 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:02:20,487 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:02:20,496 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 22:02:20,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:20,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:02:20,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:20,540 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:02:20,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:20,594 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:02:20,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536396998] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:20,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:20,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-03-15 22:02:20,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1689344054] [2022-03-15 22:02:20,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:20,597 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:20,600 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:02:20,600 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:21,252 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 18 new interpolants: [4452#(< k N), 4462#(or (<= N i) (< k N)), 4453#(or (<= N k) (< (+ k 1) N)), 4464#(or (<= N i) (< j M)), 4468#(and (or (< j M) (= (+ max2 (* (- 1) i)) 0)) (or (< j M) (<= k max2))), 4455#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4466#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 4457#(or (< j M) (< k N)), 4467#(or (<= N (+ i 1)) (< j M)), 4461#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 4459#(or (< j M) (<= (+ N 1) i)), 4460#(or (< j M) (<= (+ N 1) i) (< k N)), 4456#(< j M), 4458#(or (< j M) (<= N k) (< (+ k 1) N)), 4445#(or (< j M) (<= k (+ i 1))), 4454#(or (<= (+ N 1) i) (< k N)), 4465#(or (<= N i) (< j M) (< k N)), 4463#(or (<= N i) (<= N k) (< (+ k 1) N))] [2022-03-15 22:02:21,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-15 22:02:21,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-15 22:02:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:02:21,253 INFO L87 Difference]: Start difference. First operand 211 states and 726 transitions. Second operand has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:21,971 INFO L93 Difference]: Finished difference Result 304 states and 972 transitions. [2022-03-15 22:02:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-15 22:02:21,971 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:02:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:21,972 INFO L225 Difference]: With dead ends: 304 [2022-03-15 22:02:21,972 INFO L226 Difference]: Without dead ends: 301 [2022-03-15 22:02:21,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=698, Invalid=2608, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:02:21,973 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:21,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:02:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-03-15 22:02:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 211. [2022-03-15 22:02:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 3.4380952380952383) internal successors, (722), 210 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 722 transitions. [2022-03-15 22:02:21,979 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 722 transitions. Word has length 15 [2022-03-15 22:02:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:21,979 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 722 transitions. [2022-03-15 22:02:21,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 25 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 722 transitions. [2022-03-15 22:02:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:21,979 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:21,980 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:21,996 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:02:22,193 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:02:22,193 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:02:22,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1869207442, now seen corresponding path program 3 times [2022-03-15 22:02:22,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:22,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328090546] [2022-03-15 22:02:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:22,371 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:02:22,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:22,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328090546] [2022-03-15 22:02:22,372 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328090546] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:22,372 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364683651] [2022-03-15 22:02:22,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:02:22,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:22,373 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:02:22,374 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:02:22,403 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 22:02:22,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:22,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 24 conjunts are in the unsatisfiable core [2022-03-15 22:02:22,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:22,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:22,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:22,839 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2022-03-15 22:02:22,952 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:02:22,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:23,344 INFO L353 Elim1Store]: treesize reduction 10, result has 81.8 percent of original size [2022-03-15 22:02:23,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 161 [2022-03-15 22:02:25,608 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:02:25,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364683651] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:25,609 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:25,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-03-15 22:02:25,610 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2084961368] [2022-03-15 22:02:25,610 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:25,611 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:25,616 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 113 transitions. [2022-03-15 22:02:25,616 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:28,374 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [5361#(and (or (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2) (< i N))), 5364#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (= k i)) (not (< j M)) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 5353#(or (< j M) (= max2 max1)), 5359#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 5360#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 5362#(and (or (< j M) (not (= k i)) (= max2 max1)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 5357#(and (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2))), 5355#(or (< j M) (< i N) (= max2 max1)), 5365#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 5356#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2))), 5354#(or (< i N) (= max2 max1)), 5358#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 5363#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (< i N) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (< i N) (= max2 max1)))] [2022-03-15 22:02:28,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:02:28,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:02:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:02:28,375 INFO L87 Difference]: Start difference. First operand 211 states and 722 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:32,665 INFO L93 Difference]: Finished difference Result 658 states and 1870 transitions. [2022-03-15 22:02:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-03-15 22:02:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:02:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:32,668 INFO L225 Difference]: With dead ends: 658 [2022-03-15 22:02:32,668 INFO L226 Difference]: Without dead ends: 642 [2022-03-15 22:02:32,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=822, Invalid=5030, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 22:02:32,670 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:32,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:02:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-03-15 22:02:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 221. [2022-03-15 22:02:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 3.459090909090909) internal successors, (761), 220 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 761 transitions. [2022-03-15 22:02:32,677 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 761 transitions. Word has length 15 [2022-03-15 22:02:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:32,677 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 761 transitions. [2022-03-15 22:02:32,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 20 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 761 transitions. [2022-03-15 22:02:32,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:32,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:32,677 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:32,694 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:02:32,893 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:02:32,893 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:02:32,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash -764809232, now seen corresponding path program 4 times [2022-03-15 22:02:32,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:32,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618970071] [2022-03-15 22:02:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:32,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:32,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:32,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618970071] [2022-03-15 22:02:32,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618970071] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:32,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115860172] [2022-03-15 22:02:32,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:02:32,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:32,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:32,925 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:02:32,935 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:02:32,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:02:32,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:32,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 22:02:32,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:33,000 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:33,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:33,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115860172] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:33,045 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:33,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 11 [2022-03-15 22:02:33,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [975668275] [2022-03-15 22:02:33,046 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:33,046 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:33,055 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 103 transitions. [2022-03-15 22:02:33,055 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:33,395 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [6654#(or (<= N i) (< (+ i 1) N)), 6656#(< j M), 6629#(< i N), 6658#(or (<= N i) (< (+ i 1) N) (< j M)), 6661#(or (< (+ 2 j) M) (<= M (+ j 1))), 6659#(or (<= N i) (<= (+ 2 M i) (+ N j))), 6657#(or (< j M) (< i N)), 6655#(or (<= (+ 3 i) N) (<= N i)), 6660#(or (< (+ j 1) M) (<= M j))] [2022-03-15 22:02:33,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-15 22:02:33,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:33,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-15 22:02:33,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-03-15 22:02:33,396 INFO L87 Difference]: Start difference. First operand 221 states and 761 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:33,870 INFO L93 Difference]: Finished difference Result 525 states and 1693 transitions. [2022-03-15 22:02:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 22:02:33,871 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:02:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:33,873 INFO L225 Difference]: With dead ends: 525 [2022-03-15 22:02:33,873 INFO L226 Difference]: Without dead ends: 525 [2022-03-15 22:02:33,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-03-15 22:02:33,874 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:33,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:02:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2022-03-15 22:02:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 318. [2022-03-15 22:02:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 3.526813880126183) internal successors, (1118), 317 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1118 transitions. [2022-03-15 22:02:33,882 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 1118 transitions. Word has length 15 [2022-03-15 22:02:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:33,882 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 1118 transitions. [2022-03-15 22:02:33,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 1118 transitions. [2022-03-15 22:02:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 22:02:33,883 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:33,883 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:33,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-15 22:02:34,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:34,096 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:02:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash -519709146, now seen corresponding path program 5 times [2022-03-15 22:02:34,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:34,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553693701] [2022-03-15 22:02:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:34,333 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:02:34,333 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:34,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553693701] [2022-03-15 22:02:34,333 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553693701] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:34,333 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796858640] [2022-03-15 22:02:34,333 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:02:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:34,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:34,334 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:02:34,335 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:02:34,364 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:34,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:34,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 26 conjunts are in the unsatisfiable core [2022-03-15 22:02:34,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:34,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:02:34,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:34,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 75 [2022-03-15 22:02:34,833 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:02:34,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:35,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:02:35,123 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:02:35,123 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 157 [2022-03-15 22:02:36,330 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:02:36,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796858640] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:36,330 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:36,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-03-15 22:02:36,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568303179] [2022-03-15 22:02:36,330 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:36,331 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:36,345 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 89 transitions. [2022-03-15 22:02:36,345 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:38,899 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [7966#(or (< i N) (= max2 max1)), 7977#(and (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (< k N)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< k N) (< max1 (select A i)))), 7972#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 7975#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (select A j)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 7967#(and (or (<= (select A j) max2) (= (select A j) max1) (< i N)) (or (<= (+ max2 1) (select A j)) (< i N) (= max2 max1))), 7969#(and (or (<= (select A j) max2) (<= (+ k 1) N) (= (select A j) max1) (< i N)) (or (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< i N) (= max2 max1))), 7968#(or (< k N) (< i N) (= max2 max1)), 7976#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 7970#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 7973#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 7971#(and (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (<= (+ max2 1) (select A j)) (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< max2 (select A j)) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A j) max1) (< max1 (select A i)))), 7965#(or (< k N) (= max2 max1)), 7974#(and (or (<= (+ max2 1) (select A j)) (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (< k N) (= (select A j) max1) (< max1 (select A i))) (or (< (+ i 1) N) (not (< i N)) (< max2 (select A j)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (< k N) (not (< max1 (select A i)))))] [2022-03-15 22:02:38,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-15 22:02:38,900 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-15 22:02:38,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2022-03-15 22:02:38,900 INFO L87 Difference]: Start difference. First operand 318 states and 1118 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:43,268 INFO L93 Difference]: Finished difference Result 708 states and 2245 transitions. [2022-03-15 22:02:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 22:02:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-03-15 22:02:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:43,273 INFO L225 Difference]: With dead ends: 708 [2022-03-15 22:02:43,273 INFO L226 Difference]: Without dead ends: 700 [2022-03-15 22:02:43,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1480 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=904, Invalid=4796, Unknown=0, NotChecked=0, Total=5700 [2022-03-15 22:02:43,275 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 375 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:43,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [375 Valid, 0 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:02:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-03-15 22:02:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 323. [2022-03-15 22:02:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 3.531055900621118) internal successors, (1137), 322 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1137 transitions. [2022-03-15 22:02:43,288 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 1137 transitions. Word has length 15 [2022-03-15 22:02:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:43,288 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 1137 transitions. [2022-03-15 22:02:43,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 1137 transitions. [2022-03-15 22:02:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:43,289 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:43,289 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:43,306 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:02:43,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-15 22:02:43,506 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:02:43,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1842155728, now seen corresponding path program 6 times [2022-03-15 22:02:43,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:43,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619133372] [2022-03-15 22:02:43,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:43,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:43,559 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:02:43,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:43,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619133372] [2022-03-15 22:02:43,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619133372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:43,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943252745] [2022-03-15 22:02:43,559 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:02:43,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:43,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:43,560 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:02:43,561 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:02:43,593 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:02:43,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:43,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:02:43,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:43,636 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:02:43,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:43,683 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:02:43,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943252745] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:43,684 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:43,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-03-15 22:02:43,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1272169459] [2022-03-15 22:02:43,684 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:43,685 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:43,689 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:02:43,689 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:44,646 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 31 new interpolants: [9543#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 9532#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 9529#(or (<= N i) (< (+ i 1) N) (< k N)), 9544#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 9533#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N) (< j M)), 9531#(or (<= N i) (< (+ i 1) N) (< j M)), 9541#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M)), 9521#(or (<= (+ 2 k) N) (< j M)), 9528#(or (<= N i) (< (+ i 1) N)), 9548#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)), 9535#(or (<= (+ 2 k) i) (< j M)), 9545#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 9546#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 9519#(< j M), 9523#(or (< k N) (< i N)), 9534#(or (<= (+ 3 k) N) (< j M)), 9522#(< i N), 9542#(or (< j M) (<= (+ k 1) i)), 9530#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 9527#(or (<= (+ 2 k) N) (< j M) (< i N)), 9547#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 9520#(or (<= (+ k 1) N) (< j M)), 9512#(or (<= k i) (< j M)), 9538#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 9537#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 9524#(or (< j M) (< i N)), 9526#(or (<= (+ 2 k) N) (< i N)), 9540#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 9539#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 9525#(or (< j M) (< k N) (< i N)), 9536#(or (<= N (+ i 1)) (< (+ 2 i) N))] [2022-03-15 22:02:44,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-03-15 22:02:44,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-03-15 22:02:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 22:02:44,648 INFO L87 Difference]: Start difference. First operand 323 states and 1137 transitions. Second operand has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:46,235 INFO L93 Difference]: Finished difference Result 622 states and 2056 transitions. [2022-03-15 22:02:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-15 22:02:46,235 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:46,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:46,238 INFO L225 Difference]: With dead ends: 622 [2022-03-15 22:02:46,238 INFO L226 Difference]: Without dead ends: 622 [2022-03-15 22:02:46,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3357 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2472, Invalid=9518, Unknown=0, NotChecked=0, Total=11990 [2022-03-15 22:02:46,242 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 451 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:46,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 0 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:02:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2022-03-15 22:02:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 384. [2022-03-15 22:02:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 383 states have (on average 3.587467362924282) internal successors, (1374), 383 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 1374 transitions. [2022-03-15 22:02:46,253 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 1374 transitions. Word has length 16 [2022-03-15 22:02:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:46,253 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 1374 transitions. [2022-03-15 22:02:46,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.775) internal successors, (111), 39 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 1374 transitions. [2022-03-15 22:02:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:46,254 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:46,254 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:46,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-15 22:02:46,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-15 22:02:46,468 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:02:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -772947566, now seen corresponding path program 7 times [2022-03-15 22:02:46,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:46,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366740973] [2022-03-15 22:02:46,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:46,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:46,529 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:02:46,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:46,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366740973] [2022-03-15 22:02:46,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366740973] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:46,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220558077] [2022-03-15 22:02:46,530 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:02:46,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:46,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:46,531 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:02:46,551 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:02:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:46,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:02:46,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:46,649 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:02:46,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:46,678 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:02:46,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220558077] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:46,678 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:46,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-15 22:02:46,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957215565] [2022-03-15 22:02:46,678 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:46,679 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:46,683 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 143 transitions. [2022-03-15 22:02:46,683 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:47,072 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 9 new interpolants: [11184#(or (<= N k) (< i N)), 11187#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N)), 11190#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 11189#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 11182#(< i N), 11185#(or (<= N i) (< (+ i 1) N) (<= N k)), 11188#(or (<= N (+ i 1)) (< (+ 2 i) N)), 11183#(or (<= N i) (< (+ i 1) N)), 11186#(or (<= N (+ k 1)) (< i N))] [2022-03-15 22:02:47,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-15 22:02:47,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:47,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-15 22:02:47,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2022-03-15 22:02:47,073 INFO L87 Difference]: Start difference. First operand 384 states and 1374 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:47,581 INFO L93 Difference]: Finished difference Result 1085 states and 3837 transitions. [2022-03-15 22:02:47,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-03-15 22:02:47,581 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:47,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:47,586 INFO L225 Difference]: With dead ends: 1085 [2022-03-15 22:02:47,586 INFO L226 Difference]: Without dead ends: 1063 [2022-03-15 22:02:47,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=944, Invalid=2716, Unknown=0, NotChecked=0, Total=3660 [2022-03-15 22:02:47,587 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 228 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:47,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:02:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-03-15 22:02:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 504. [2022-03-15 22:02:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 3.63220675944334) internal successors, (1827), 503 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1827 transitions. [2022-03-15 22:02:47,601 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1827 transitions. Word has length 16 [2022-03-15 22:02:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:47,601 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 1827 transitions. [2022-03-15 22:02:47,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1827 transitions. [2022-03-15 22:02:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:47,603 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:47,603 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:47,619 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:02:47,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-15 22:02:47,819 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:02:47,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2110966522, now seen corresponding path program 6 times [2022-03-15 22:02:47,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:47,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802277437] [2022-03-15 22:02:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:47,867 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:02:47,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:47,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802277437] [2022-03-15 22:02:47,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802277437] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:47,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365433197] [2022-03-15 22:02:47,867 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:02:47,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:47,869 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:02:47,870 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:02:47,900 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-03-15 22:02:47,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:47,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:02:47,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:47,943 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:02:47,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:47,992 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:02:47,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365433197] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:47,993 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:47,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-03-15 22:02:47,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28046357] [2022-03-15 22:02:47,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:47,994 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:47,998 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:02:47,998 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:48,647 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 20 new interpolants: [13462#(< j M), 13458#(< i N), 13476#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 13459#(or (<= N i) (< (+ i 1) N)), 13468#(or (<= N (+ k 1)) (< j M)), 13472#(or (< (+ j 1) M) (<= i (+ k 1)) (<= M j)), 13467#(or (<= N i) (< (+ i 1) N) (< j M) (<= N k)), 13477#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= N k)), 13466#(or (< j M) (<= N k) (< i N)), 13469#(or (< j M) (<= i (+ k 1))), 13465#(or (< j M) (<= N k)), 13474#(or (<= N (+ i 1)) (< (+ 2 i) N)), 13460#(or (<= N k) (< i N)), 13461#(or (<= N i) (< (+ i 1) N) (<= N k)), 13463#(or (< j M) (< i N)), 13470#(or (< j M) (<= i k)), 13473#(or (< (+ j 1) M) (<= i k) (<= M j)), 13475#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 13471#(or (<= N (+ k 1)) (< (+ j 1) M) (<= M j)), 13464#(or (<= N i) (< (+ i 1) N) (< j M))] [2022-03-15 22:02:48,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-03-15 22:02:48,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:48,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-03-15 22:02:48,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-03-15 22:02:48,648 INFO L87 Difference]: Start difference. First operand 504 states and 1827 transitions. Second operand has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:50,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:50,230 INFO L93 Difference]: Finished difference Result 1352 states and 4675 transitions. [2022-03-15 22:02:50,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-03-15 22:02:50,231 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:50,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:50,236 INFO L225 Difference]: With dead ends: 1352 [2022-03-15 22:02:50,236 INFO L226 Difference]: Without dead ends: 1338 [2022-03-15 22:02:50,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3252 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2305, Invalid=8825, Unknown=0, NotChecked=0, Total=11130 [2022-03-15 22:02:50,238 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 351 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:50,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 0 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:02:50,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2022-03-15 22:02:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 682. [2022-03-15 22:02:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 3.922173274596182) internal successors, (2671), 681 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 2671 transitions. [2022-03-15 22:02:50,256 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 2671 transitions. Word has length 16 [2022-03-15 22:02:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:50,256 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 2671 transitions. [2022-03-15 22:02:50,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.2142857142857144) internal successors, (90), 27 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 2671 transitions. [2022-03-15 22:02:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:50,258 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:50,258 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:50,275 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:02:50,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-15 22:02:50,475 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:02:50,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:50,475 INFO L85 PathProgramCache]: Analyzing trace with hash -687661098, now seen corresponding path program 7 times [2022-03-15 22:02:50,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:50,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357043031] [2022-03-15 22:02:50,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:50,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:50,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:50,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357043031] [2022-03-15 22:02:50,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357043031] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:50,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438079040] [2022-03-15 22:02:50,527 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:02:50,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:50,528 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:02:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:50,584 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:02:50,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:02:50,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:50,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:50,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438079040] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:50,706 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:50,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 13 [2022-03-15 22:02:50,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655355589] [2022-03-15 22:02:50,706 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:50,707 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:50,711 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 22:02:50,711 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:51,486 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [16463#(or (< j M) (< k N) (< i N)), 16453#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 16467#(or (< j M) (<= (+ k 1) i)), 16451#(or (<= N i) (< (+ i 1) N)), 16470#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 16468#(or (< (+ j 1) M) (<= (+ k 1) i) (<= M j)), 16459#(< j M), 16454#(or (< k N) (< i N)), 16466#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 16462#(or (< j M) (< i N)), 16452#(or (<= N (+ i 1)) (< (+ 2 i) N)), 16460#(or (<= (+ k 1) N) (< j M)), 16458#(or (<= N i) (<= k (+ i 1))), 16469#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 16461#(or (<= (+ 2 k) N) (< j M)), 16465#(or (<= N i) (< (+ i 1) N) (< j M)), 16473#(or (<= (+ k j) (+ M i 1)) (<= N i)), 16456#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 16471#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 16457#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 16472#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 16450#(< i N), 16464#(or (< (+ j 1) M) (<= (+ 2 k) N) (<= M j)), 16455#(or (<= N i) (< (+ i 1) N) (< k N))] [2022-03-15 22:02:51,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-03-15 22:02:51,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-03-15 22:02:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2022-03-15 22:02:51,488 INFO L87 Difference]: Start difference. First operand 682 states and 2671 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:55,412 INFO L93 Difference]: Finished difference Result 2095 states and 6909 transitions. [2022-03-15 22:02:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2022-03-15 22:02:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:55,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:55,422 INFO L225 Difference]: With dead ends: 2095 [2022-03-15 22:02:55,422 INFO L226 Difference]: Without dead ends: 2095 [2022-03-15 22:02:55,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11774 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5679, Invalid=27993, Unknown=0, NotChecked=0, Total=33672 [2022-03-15 22:02:55,425 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 485 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:55,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [485 Valid, 0 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 22:02:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2022-03-15 22:02:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 946. [2022-03-15 22:02:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 4.061375661375662) internal successors, (3838), 945 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 3838 transitions. [2022-03-15 22:02:55,450 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 3838 transitions. Word has length 16 [2022-03-15 22:02:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:55,451 INFO L470 AbstractCegarLoop]: Abstraction has 946 states and 3838 transitions. [2022-03-15 22:02:55,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 3838 transitions. [2022-03-15 22:02:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:55,453 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:55,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:55,473 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:02:55,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:55,680 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:02:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 416737112, now seen corresponding path program 8 times [2022-03-15 22:02:55,681 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:55,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535570854] [2022-03-15 22:02:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:55,734 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:55,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535570854] [2022-03-15 22:02:55,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535570854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:55,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742758221] [2022-03-15 22:02:55,735 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:02:55,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:55,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:55,736 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:02:55,737 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:02:55,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:02:55,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:55,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 22:02:55,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:55,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 22:02:55,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742758221] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:55,900 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:55,900 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-03-15 22:02:55,901 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [129106674] [2022-03-15 22:02:55,901 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:55,902 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:55,906 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 133 transitions. [2022-03-15 22:02:55,906 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:56,251 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [20858#(or (<= N i) (<= (+ 2 i) N)), 20864#(or (<= N i) (<= (+ M i 1) (+ N j))), 20861#(or (< j M) (< i N)), 20865#(or (<= N (+ i 1)) (<= (+ 2 M i) (+ N j))), 20856#(< j M), 20859#(or (<= N (+ i 1)) (<= (+ 3 i) N)), 20862#(or (<= N i) (< (+ i 1) N) (< j M)), 20860#(or (< (+ 2 j) M) (<= M (+ j 1))), 20857#(or (< (+ j 1) M) (<= M j)), 20863#(or (<= N (+ i 1)) (<= (+ 3 i) N) (< j M))] [2022-03-15 22:02:56,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-15 22:02:56,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:56,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-15 22:02:56,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2022-03-15 22:02:56,252 INFO L87 Difference]: Start difference. First operand 946 states and 3838 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:56,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:02:56,858 INFO L93 Difference]: Finished difference Result 2684 states and 9854 transitions. [2022-03-15 22:02:56,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-03-15 22:02:56,858 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:02:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:02:56,869 INFO L225 Difference]: With dead ends: 2684 [2022-03-15 22:02:56,869 INFO L226 Difference]: Without dead ends: 2684 [2022-03-15 22:02:56,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=594, Invalid=1956, Unknown=0, NotChecked=0, Total=2550 [2022-03-15 22:02:56,870 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:02:56,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 22:02:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2022-03-15 22:02:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1140. [2022-03-15 22:02:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 4.183494293239684) internal successors, (4765), 1139 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 4765 transitions. [2022-03-15 22:02:56,900 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 4765 transitions. Word has length 16 [2022-03-15 22:02:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:02:56,900 INFO L470 AbstractCegarLoop]: Abstraction has 1140 states and 4765 transitions. [2022-03-15 22:02:56,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:02:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 4765 transitions. [2022-03-15 22:02:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:02:56,903 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:02:56,903 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:02:56,931 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:02:57,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-15 22:02:57,119 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:02:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:02:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash 661837198, now seen corresponding path program 9 times [2022-03-15 22:02:57,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:02:57,121 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271740336] [2022-03-15 22:02:57,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:02:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:02:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:02:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:57,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:02:57,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271740336] [2022-03-15 22:02:57,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271740336] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:02:57,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648021766] [2022-03-15 22:02:57,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:02:57,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:02:57,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:02:57,169 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:02:57,195 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:02:57,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:02:57,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:02:57,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 22:02:57,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:02:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:57,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:02:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:02:57,363 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648021766] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:02:57,363 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:02:57,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-03-15 22:02:57,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1662784547] [2022-03-15 22:02:57,364 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:02:57,364 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:02:57,368 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 108 transitions. [2022-03-15 22:02:57,368 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:02:58,029 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 26 new interpolants: [26003#(or (<= N i) (< (+ i 1) N) (< j M)), 26000#(or (<= N i) (< (+ i 1) N) (< k N)), 25998#(< k N), 26015#(or (<= (+ 2 k j) (+ N M)) (< i N)), 26002#(or (<= (+ j 1) M) (< i N)), 26007#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 25997#(or (<= N (+ i 1)) (< (+ 2 i) N)), 26005#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 26010#(or (<= N i) (< (+ i 1) N) (< j M) (< k N)), 26001#(or (< k N) (<= (+ j 1) M)), 25999#(or (< k N) (< i N)), 25996#(or (<= N i) (< (+ i 1) N)), 26020#(or (<= N (+ 2 i)) (<= (+ 2 k j) (+ N M)) (< (+ 3 i) N)), 26012#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N)), 26014#(or (<= (+ 2 j) M) (<= N i) (< (+ i 1) N)), 26006#(or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N)), 26017#(or (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N)), 26009#(or (< j M) (< k N) (< i N)), 26008#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 26004#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 26013#(or (<= (+ 2 j) M) (< i N)), 26018#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k j) (+ N M))), 26011#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N)), 25995#(< i N), 26016#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k j) (+ N M))), 26019#(or (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N))] [2022-03-15 22:02:58,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 22:02:58,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:02:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 22:02:58,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1688, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:02:58,030 INFO L87 Difference]: Start difference. First operand 1140 states and 4765 transitions. Second operand has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:00,943 INFO L93 Difference]: Finished difference Result 2135 states and 7891 transitions. [2022-03-15 22:03:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2022-03-15 22:03:00,944 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:03:00,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:00,952 INFO L225 Difference]: With dead ends: 2135 [2022-03-15 22:03:00,953 INFO L226 Difference]: Without dead ends: 2135 [2022-03-15 22:03:00,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7397 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4412, Invalid=19768, Unknown=0, NotChecked=0, Total=24180 [2022-03-15 22:03:00,960 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:00,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 22:03:00,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2022-03-15 22:03:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1312. [2022-03-15 22:03:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 1311 states have (on average 4.276125095347063) internal successors, (5606), 1311 states have internal predecessors, (5606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 5606 transitions. [2022-03-15 22:03:00,990 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 5606 transitions. Word has length 16 [2022-03-15 22:03:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:00,990 INFO L470 AbstractCegarLoop]: Abstraction has 1312 states and 5606 transitions. [2022-03-15 22:03:00,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.5428571428571427) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 5606 transitions. [2022-03-15 22:03:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:00,993 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:00,994 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:01,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:01,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:01,207 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:03:01,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:01,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1488485624, now seen corresponding path program 10 times [2022-03-15 22:03:01,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:01,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411586428] [2022-03-15 22:03:01,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:01,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:01,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:01,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411586428] [2022-03-15 22:03:01,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411586428] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:01,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503189333] [2022-03-15 22:03:01,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 22:03:01,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:01,260 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:03:01,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 22:03:01,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:01,287 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:03:01,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:01,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:01,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:01,480 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:03:01,480 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503189333] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:01,480 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:01,480 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:03:01,481 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324586826] [2022-03-15 22:03:01,481 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:01,481 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:01,486 INFO L252 McrAutomatonBuilder]: Finished intersection with 55 states and 100 transitions. [2022-03-15 22:03:01,486 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:01,968 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [31118#(or (<= N i) (< (+ i 1) N) (< j M)), 31122#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 31119#(or (<= N (+ i 1)) (< (+ 2 i) N) (< j M)), 31112#(or (<= N (+ i 1)) (< (+ 2 i) N)), 31113#(or (<= N k) (< i N)), 31116#(< j M), 31121#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 31115#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 31117#(or (< j M) (< i N)), 31111#(or (<= N i) (< (+ i 1) N)), 31114#(or (<= N i) (< (+ i 1) N) (<= N k)), 31120#(or (<= (+ N M) (+ k j 1)) (< i N)), 31110#(< i N)] [2022-03-15 22:03:01,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:03:01,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:01,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:03:01,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:03:01,969 INFO L87 Difference]: Start difference. First operand 1312 states and 5606 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:03,234 INFO L93 Difference]: Finished difference Result 4192 states and 16930 transitions. [2022-03-15 22:03:03,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-03-15 22:03:03,234 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:03:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:03,250 INFO L225 Difference]: With dead ends: 4192 [2022-03-15 22:03:03,250 INFO L226 Difference]: Without dead ends: 4137 [2022-03-15 22:03:03,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=6131, Unknown=0, NotChecked=0, Total=7832 [2022-03-15 22:03:03,251 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 280 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:03,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 0 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 22:03:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2022-03-15 22:03:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 1974. [2022-03-15 22:03:03,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 4.596553471870249) internal successors, (9069), 1973 states have internal predecessors, (9069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 9069 transitions. [2022-03-15 22:03:03,316 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 9069 transitions. Word has length 16 [2022-03-15 22:03:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:03,316 INFO L470 AbstractCegarLoop]: Abstraction has 1974 states and 9069 transitions. [2022-03-15 22:03:03,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 9069 transitions. [2022-03-15 22:03:03,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 22:03:03,321 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:03,321 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:03,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-15 22:03:03,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:03,537 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:03:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2034886336, now seen corresponding path program 11 times [2022-03-15 22:03:03,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:03,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43607132] [2022-03-15 22:03:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:03,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:03,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43607132] [2022-03-15 22:03:03,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43607132] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:03,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017747461] [2022-03-15 22:03:03,597 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 22:03:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:03,628 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:03:03,629 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:03:03,653 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:03:03,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:03,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 22:03:03,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:03,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:03:03,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:03,847 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:03:03,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017747461] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:03,848 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:03,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-03-15 22:03:03,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [20399068] [2022-03-15 22:03:03,848 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:03,849 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:03,852 INFO L252 McrAutomatonBuilder]: Finished intersection with 54 states and 98 transitions. [2022-03-15 22:03:03,852 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:04,147 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 13 new interpolants: [39488#(or (<= N i) (< (+ i 1) N)), 39499#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ N M) (+ k j 1))), 39495#(or (<= (+ N M) (+ k j 1)) (< i N)), 39490#(or (<= N i) (< (+ i 1) N) (<= M j)), 39498#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 39497#(or (<= N i) (< (+ i 1) N) (<= (+ N M) (+ k j 1))), 39489#(or (< i N) (<= M j)), 39491#(or (<= N (+ i 1)) (< (+ 2 i) N)), 39496#(or (<= N i) (< (+ i 1) N) (< k N)), 39493#(< k N), 39494#(or (< k N) (< i N)), 39487#(< i N), 39492#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= M j))] [2022-03-15 22:03:04,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-15 22:03:04,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:04,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-15 22:03:04,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=0, NotChecked=0, Total=930 [2022-03-15 22:03:04,148 INFO L87 Difference]: Start difference. First operand 1974 states and 9069 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:03:05,750 INFO L93 Difference]: Finished difference Result 4098 states and 16712 transitions. [2022-03-15 22:03:05,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-03-15 22:03:05,751 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 22:03:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:03:05,769 INFO L225 Difference]: With dead ends: 4098 [2022-03-15 22:03:05,769 INFO L226 Difference]: Without dead ends: 4039 [2022-03-15 22:03:05,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4860 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2783, Invalid=11259, Unknown=0, NotChecked=0, Total=14042 [2022-03-15 22:03:05,772 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:03:05,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 22:03:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2022-03-15 22:03:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 2108. [2022-03-15 22:03:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2108 states, 2107 states have (on average 4.643569055529189) internal successors, (9784), 2107 states have internal predecessors, (9784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 9784 transitions. [2022-03-15 22:03:05,853 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 9784 transitions. Word has length 16 [2022-03-15 22:03:05,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:03:05,853 INFO L470 AbstractCegarLoop]: Abstraction has 2108 states and 9784 transitions. [2022-03-15 22:03:05,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 20 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:03:05,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 9784 transitions. [2022-03-15 22:03:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:03:05,858 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:03:05,858 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:03:05,874 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:03:06,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:06,074 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:03:06,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:03:06,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1272142052, now seen corresponding path program 8 times [2022-03-15 22:03:06,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:03:06,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058159875] [2022-03-15 22:03:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:03:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:03:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:03:06,419 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:03:06,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:03:06,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058159875] [2022-03-15 22:03:06,422 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058159875] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:03:06,422 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012265708] [2022-03-15 22:03:06,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:03:06,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:03:06,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:03:06,423 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:03:06,428 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:03:06,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:03:06,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:03:06,452 WARN L261 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 36 conjunts are in the unsatisfiable core [2022-03-15 22:03:06,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:03:07,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:03:07,246 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:03:07,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:03:08,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:03:08,285 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:03:08,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 983 treesize of output 505 [2022-03-15 22:03:09,607 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:03:09,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012265708] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:03:09,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:03:09,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-03-15 22:03:09,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [976624413] [2022-03-15 22:03:09,607 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:03:09,608 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:03:09,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 84 states and 173 transitions. [2022-03-15 22:03:09,614 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:03:26,690 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 40 new interpolants: [48136#(and (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 2 k) N) (< j M)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 2 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N))), 48123#(or (<= (+ k 1) N) (< j M) (< i N) (= max2 max1)), 48141#(and (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2) (< i N)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (< i N)) (or (<= (+ 2 k) N) (< j M) (< i N)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< i N) (= max2 max1)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 2 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k)) (< i N))), 48133#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1))), 48116#(or (<= (+ k 1) N) (< i N) (= max2 max1)), 48140#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 48122#(or (<= (+ k 1) N) (< j M) (= max2 max1)), 48144#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (select A (+ k 1)) max2) (< (+ 2 i) N) (< j M) (< max2 (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< max2 (select A k)) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (= max1 (select A k)) (< (+ 2 i) N) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< j M) (<= (select A (+ k 1)) (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M))), 48149#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= max1 (select A k)) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ k 1)) max2) (< j M) (< max2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) max2) (< max1 (select A (+ 2 i))) (< j M) (< max2 (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< j M) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2))), 48143#(and (or (= max1 (select A k)) (< j M) (< (+ 2 k) i) (<= (select A k) max2) (<= (+ (select A k) 1) (select A (+ (- 1) i)))) (or (<= (+ 2 k) i) (< j M)) (or (< j M) (= k 0)) (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) i) (<= (+ max2 1) (select A (+ (- 1) i))) (= max2 max1)) (or (< j M) (<= (+ max2 1) (select A k)) (= (select A (+ (- 1) i)) max1) (<= (select A (+ (- 1) i)) max2) (< (+ 2 k) i)) (or (<= (select A (+ (- 1) i)) (select A k)) (< j M) (= (select A (+ (- 1) i)) max1) (< (+ 2 k) i) (<= (select A k) max2))), 48119#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 48146#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 48139#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2))), 48148#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2))), 48129#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A i) max1) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2))), 48126#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 48142#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N))) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (not (< max1 (select A i))) (<= (+ max2 1) (select A (+ (- 1) N))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= (select A i) (select A k)) (not (< max1 (select A i)))) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< (+ i 1) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i))) (or (= max1 (select A (+ (- 1) N))) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A k)) (< (+ i 1) N) (< j M) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (< max1 (select A i)) (<= (select A k) max2))), 48145#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2)) (or (< j M) (= k 0)) (or (< j M) (<= (+ k 1) i))), 48128#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 48120#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2))), 48134#(and (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (= max1 (select A k)) (<= (+ (select A k) 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ k 1)) max2) (< max1 (select A (+ 2 i))) (< max2 (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ k 1)) max2) (< max2 (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1)))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A i) (select A (+ k 1))) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (select A (+ k 1)) (select A k)) (< (+ 3 i) N) (= (select A (+ k 1)) max1) (<= (select A k) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= (+ 3 k) N) (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 48125#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 48117#(and (or (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (<= (+ 2 k) N) (<= (select A k) max2) (< i N))), 48131#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 48135#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 max1))), 48150#(and (or (< j M) (= k i)) (or (< j M) (= max2 max1)) (or (< j M) (= k 0)) (or (< j M) (= i max2))), 48138#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1))), 48113#(or (< j M) (= max2 max1)), 48115#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 48147#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 48124#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 48112#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 48130#(and (or (<= N (+ i 1)) (<= (+ 3 k) N) (<= (select A (+ k 1)) max2) (< (+ 2 i) N) (< max2 (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A (+ k 1)) (select A k)) (= (select A (+ k 1)) max1) (< max1 (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (select A k)) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (< max2 (select A k)) (<= (+ max2 1) (select A (+ k 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (<= (+ 3 k) N) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ max2 1) (select A (+ k 1))) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ 3 k) N) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ (select A k) 1) (select A (+ k 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N))), 48118#(and (or (<= (+ 2 k) N) (< i N)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (< i N)) (or (= max1 (select A (+ (- 1) N))) (< (+ 2 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k)) (< i N)) (or (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< i N) (= max2 max1)) (or (= max1 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (<= (select A k) max2) (< i N))), 48127#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 48132#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 48121#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N))) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= (select A i) (select A k)) (not (< max1 (select A i)))) (or (= max1 (select A (+ (- 1) N))) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k))) (or (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (not (< max1 (select A i))) (<= (+ max2 1) (select A (+ (- 1) N))) (= (select A i) max2)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< (+ i 1) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (< max1 (select A i))) (or (= max1 (select A k)) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (< max1 (select A i)) (= max2 max1))), 48111#(or (< i N) (= max2 max1)), 48114#(or (< j M) (< i N) (= max2 max1)), 48137#(and (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< j M) (<= (+ max2 1) (select A k)) (= (select A (+ (- 2) N)) max1) (<= (select A (+ (- 2) N)) max2) (< (+ 3 k) N)) (or (< j M) (= k 0) (< (+ 3 k) N)) (or (<= (+ 3 k) N) (< j M)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A (+ (- 2) N))) (<= (+ max2 1) (select A k)) (< (+ 3 k) N)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 3 k) N) (<= (select A k) max2) (<= (select A (+ (- 1) N)) (select A k)) (<= (+ (select A k) 1) (select A (+ (- 2) N)))) (or (= max1 (select A (+ (- 1) N))) (< j M) (<= (+ max2 1) (select A k)) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) max2) (< (+ 3 k) N)) (or (< j M) (<= (+ max2 1) (select A (+ (- 2) N))) (<= (+ max2 1) (select A k)) (<= (+ max2 1) (select A (+ (- 1) N))) (< (+ 3 k) N) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (< (+ 3 k) N) (<= (select A k) max2) (<= (+ (select A k) 1) (select A (+ (- 2) N)))) (or (<= (+ (select A (+ (- 2) N)) 1) (select A (+ (- 1) N))) (< j M) (= (select A (+ (- 2) N)) max1) (<= (select A (+ (- 2) N)) (select A k)) (< (+ 3 k) N) (<= (select A k) max2)) (or (= max1 (select A (+ (- 1) N))) (< j M) (<= (select A (+ (- 1) N)) (select A (+ (- 2) N))) (<= (select A (+ (- 2) N)) (select A k)) (< (+ 3 k) N) (<= (select A k) max2)))] [2022-03-15 22:03:26,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-03-15 22:03:26,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:03:26,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-03-15 22:03:26,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-03-15 22:03:26,692 INFO L87 Difference]: Start difference. First operand 2108 states and 9784 transitions. Second operand has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:22,684 INFO L93 Difference]: Finished difference Result 3018 states and 12763 transitions. [2022-03-15 22:04:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-03-15 22:04:22,684 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:04:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:22,692 INFO L225 Difference]: With dead ends: 3018 [2022-03-15 22:04:22,692 INFO L226 Difference]: Without dead ends: 2976 [2022-03-15 22:04:22,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 31 SyntacticMatches, 13 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19053 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=7675, Invalid=44081, Unknown=0, NotChecked=0, Total=51756 [2022-03-15 22:04:22,695 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 929 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:22,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 0 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 22:04:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2022-03-15 22:04:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2215. [2022-03-15 22:04:22,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 4.625112917795844) internal successors, (10240), 2214 states have internal predecessors, (10240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 10240 transitions. [2022-03-15 22:04:22,736 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 10240 transitions. Word has length 17 [2022-03-15 22:04:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:22,736 INFO L470 AbstractCegarLoop]: Abstraction has 2215 states and 10240 transitions. [2022-03-15 22:04:22,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.74) internal successors, (137), 50 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 10240 transitions. [2022-03-15 22:04:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:04:22,741 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:22,741 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:22,756 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:04:22,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:22,956 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:04:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2114457254, now seen corresponding path program 9 times [2022-03-15 22:04:22,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:22,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103237192] [2022-03-15 22:04:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:23,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:23,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103237192] [2022-03-15 22:04:23,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103237192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:23,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637923393] [2022-03-15 22:04:23,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:04:23,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:23,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:23,007 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:04:23,008 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:04:23,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:04:23,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:23,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-15 22:04:23,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:23,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:04:23,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637923393] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:23,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:23,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-03-15 22:04:23,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520873386] [2022-03-15 22:04:23,100 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:23,101 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:23,106 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:04:23,106 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:04:24,196 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [56062#(or (<= N (+ i 1)) (< j M) (<= N k) (< (+ k 1) N)), 56041#(or (<= N (+ k 1)) (< (+ 2 k) N)), 56045#(or (<= N i) (< k N)), 56066#(and (or (< j M) (= (+ max2 (* (- 1) i)) 0)) (or (< j M) (<= k max2))), 56064#(or (<= N (+ 2 i)) (< j M)), 56061#(or (<= N (+ i 1)) (< j M) (< k N)), 56058#(or (<= N (+ k 1)) (< j M) (<= (+ N 1) i) (< (+ 2 k) N)), 56049#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N)), 56048#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 56055#(or (<= N i) (< j M)), 56057#(or (<= N i) (< j M) (<= N k) (< (+ k 1) N)), 56029#(or (< j M) (<= k (+ i 1))), 56053#(or (< j M) (<= (+ N 1) i) (< k N)), 56060#(or (<= N (+ i 1)) (< j M)), 56042#(or (<= N (+ k 1)) (< j M) (< (+ 2 k) N)), 56050#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N)), 56059#(or (<= N (+ k 1)) (<= N i) (< j M) (< (+ 2 k) N)), 56056#(or (<= N i) (< j M) (< k N)), 56044#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 56051#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N)), 56036#(< k N), 56047#(or (<= N (+ i 1)) (< k N)), 56040#(or (< j M) (<= N k) (< (+ k 1) N)), 56065#(or (< j M) (<= k (+ 2 i))), 56038#(or (< j M) (< k N)), 56046#(or (<= N i) (<= N k) (< (+ k 1) N)), 56063#(or (<= N (+ k 1)) (<= N (+ i 1)) (< j M) (< (+ 2 k) N)), 56037#(< j M), 56054#(or (< j M) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 56039#(or (<= N k) (< (+ k 1) N)), 56043#(or (<= (+ N 1) i) (< k N)), 56052#(or (< j M) (<= (+ N 1) i))] [2022-03-15 22:04:24,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-03-15 22:04:24,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:04:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-03-15 22:04:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1765, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 22:04:24,197 INFO L87 Difference]: Start difference. First operand 2215 states and 10240 transitions. Second operand has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:04:26,212 INFO L93 Difference]: Finished difference Result 2815 states and 12315 transitions. [2022-03-15 22:04:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-03-15 22:04:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:04:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:04:26,230 INFO L225 Difference]: With dead ends: 2815 [2022-03-15 22:04:26,230 INFO L226 Difference]: Without dead ends: 2799 [2022-03-15 22:04:26,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3307 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2699, Invalid=10411, Unknown=0, NotChecked=0, Total=13110 [2022-03-15 22:04:26,231 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 315 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-15 22:04:26,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 0 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-15 22:04:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2799 states. [2022-03-15 22:04:26,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2799 to 2316. [2022-03-15 22:04:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2315 states have (on average 4.6030237580993525) internal successors, (10656), 2315 states have internal predecessors, (10656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 10656 transitions. [2022-03-15 22:04:26,295 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 10656 transitions. Word has length 17 [2022-03-15 22:04:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:04:26,295 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 10656 transitions. [2022-03-15 22:04:26,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.9285714285714284) internal successors, (123), 41 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:04:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 10656 transitions. [2022-03-15 22:04:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:04:26,300 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:04:26,300 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:04:26,326 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:04:26,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-15 22:04:26,515 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:04:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:04:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2888034, now seen corresponding path program 12 times [2022-03-15 22:04:26,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:04:26,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314732361] [2022-03-15 22:04:26,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:04:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:04:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:04:26,765 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:04:26,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:04:26,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314732361] [2022-03-15 22:04:26,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314732361] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:04:26,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518019100] [2022-03-15 22:04:26,766 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 22:04:26,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:04:26,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:04:26,767 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:04:26,768 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:04:26,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 22:04:26,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:04:26,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:04:26,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:04:28,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:28,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:04:28,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:28,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 153 [2022-03-15 22:04:28,922 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:04:28,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:04:30,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:04:30,389 INFO L353 Elim1Store]: treesize reduction 38, result has 73.0 percent of original size [2022-03-15 22:04:30,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 903 treesize of output 543 [2022-03-15 22:04:54,098 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:04:54,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518019100] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:04:54,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:04:54,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-03-15 22:04:54,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2106473459] [2022-03-15 22:04:54,100 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:04:54,101 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:04:54,108 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 163 transitions. [2022-03-15 22:04:54,108 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:05:04,068 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 21 new interpolants: [63788#(and (or (< (+ j 1) M) (not (< j M)) (< max2 (select A j)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (< (+ j 1) M) (<= (select A i) max1) (not (< j M)) (< max2 (select A j)) (= (select A i) max2)) (or (< (+ j 1) M) (<= (+ k 1) N) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ max1 1) (select A i))) (or (< (+ j 1) M) (<= (+ i 1) k) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (<= (select A i) max1) (not (< j M)) (= (select A i) (select A j)))), 63779#(and (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2) (< i N)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (< i N) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (< i N) (= max2 max1))), 63790#(and (or (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (+ max1 1) (select A i)) (<= (select A (+ j 1)) max2)) (or (<= (+ i 1) k) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A i) max1) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) (select A (+ j 1))) (<= (select A (+ j 1)) max2)) (or (< max2 (select A (+ j 1))) (<= (select A i) max1) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) max2)) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (+ max1 1) (select A i))) (or (<= (+ k 1) N) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A j) max2) (<= (select A i) max1) (= (select A i) (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (<= (select A i) max1) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A i) (select A (+ j 1)))) (or (< max2 (select A (+ j 1))) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (select A j) max2) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (+ max1 1) (select A i)))), 63773#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2))), 63785#(and (or (< j M) (not (= k i)) (= max2 max1)) (or (<= (+ k 1) N) (<= k i) (< j M)) (or (< j M) (< i (+ k 1)))), 63791#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 63775#(and (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (<= (select A j) max2) (<= (select A k) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1))) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (select A (+ j 1)) max2)) (or (<= (+ (select A (+ j 1)) 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (< max2 (select A (+ j 1))) (<= (+ max2 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= max2 max1)) (or (<= (select A j) max2) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k))) (or (<= (select A j) max2) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (select A k) (select A j))) (or (= max1 (select A k)) (< max2 (select A (+ j 1))) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (select A k) max2))), 63781#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 63786#(and (or (< j M) (<= (select A i) max1) (= (select A i) max2)) (or (< j M) (<= (+ max1 1) (select A i)) (= max2 max1)) (or (<= (+ k 1) N) (< j M)) (or (<= (+ i 1) k) (< j M))), 63787#(and (or (< (+ j 1) M) (not (< j M)) (< i (+ k 1))) (or (< (+ j 1) M) (not (= k i)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (= k i)) (not (< j M)) (= (select A j) max1)) (or (< (+ j 1) M) (<= (+ k 1) N) (<= k i) (not (< j M)))), 63789#(and (or (< max2 (select A (+ j 1))) (not (= k i)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= max2 max1)) (or (< (+ 2 j) M) (<= M (+ j 1)) (< i (+ k 1))) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (not (= k i)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (<= (select A j) max2) (not (= k i)) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1)))) (or (not (= k i)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (+ k 1) N) (<= k i) (< (+ 2 j) M) (<= M (+ j 1)))), 63774#(and (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (not (< j M)) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (< (+ j 1) M) (= max1 (select A k)) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2))), 63776#(or (< i N) (= max2 max1)), 63777#(or (< j M) (< i N) (= max2 max1)), 63772#(or (< j M) (= max2 max1)), 63780#(and (or (<= (select A j) max2) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (< i N) (<= (select A k) (select A j))) (or (= max1 (select A k)) (< max2 (select A (+ j 1))) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (<= (select A k) max2) (< i N)) (or (<= (select A j) max2) (< (+ 2 j) M) (= (select A j) max1) (<= M (+ j 1)) (< (select A j) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (<= (select A j) max2) (<= (select A k) (select A (+ j 1))) (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N)) (or (<= (+ (select A (+ j 1)) 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N) (<= (select A (+ j 1)) max2)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N) (<= (select A (+ j 1)) max2)) (or (<= (select A j) max2) (<= (select A (+ j 1)) (select A j)) (<= (+ (select A (+ j 1)) 1) (select A k)) (< (+ 2 j) M) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N)) (or (< max2 (select A (+ j 1))) (<= (+ max2 1) (select A k)) (< max2 (select A j)) (< (+ 2 j) M) (<= M (+ j 1)) (< i N) (= max2 max1))), 63792#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 63783#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 63778#(and (or (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (< j M) (<= (select A k) max2) (< i N))), 63784#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 63782#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))))] [2022-03-15 22:05:04,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-03-15 22:05:04,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:05:04,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-03-15 22:05:04,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2022-03-15 22:05:04,069 INFO L87 Difference]: Start difference. First operand 2316 states and 10656 transitions. Second operand has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:05:25,053 INFO L93 Difference]: Finished difference Result 3926 states and 15244 transitions. [2022-03-15 22:05:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-15 22:05:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:05:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:05:25,062 INFO L225 Difference]: With dead ends: 3926 [2022-03-15 22:05:25,062 INFO L226 Difference]: Without dead ends: 3894 [2022-03-15 22:05:25,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4971 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=2326, Invalid=14704, Unknown=0, NotChecked=0, Total=17030 [2022-03-15 22:05:25,064 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 350 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:05:25,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 0 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:05:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3894 states. [2022-03-15 22:05:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3894 to 2434. [2022-03-15 22:05:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 4.577887381833128) internal successors, (11138), 2433 states have internal predecessors, (11138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:25,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 11138 transitions. [2022-03-15 22:05:25,118 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 11138 transitions. Word has length 17 [2022-03-15 22:05:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:05:25,118 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 11138 transitions. [2022-03-15 22:05:25,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.3333333333333335) internal successors, (100), 30 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:05:25,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 11138 transitions. [2022-03-15 22:05:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:05:25,124 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:05:25,124 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:05:25,144 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:05:25,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-03-15 22:05:25,326 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:05:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:05:25,326 INFO L85 PathProgramCache]: Analyzing trace with hash -778125788, now seen corresponding path program 13 times [2022-03-15 22:05:25,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:05:25,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162501442] [2022-03-15 22:05:25,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:05:25,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:05:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:05:25,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:05:25,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162501442] [2022-03-15 22:05:25,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162501442] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:05:25,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734830502] [2022-03-15 22:05:25,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 22:05:25,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:05:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:05:25,611 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:05:25,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-15 22:05:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:05:25,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:05:25,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:05:28,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:05:28,421 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:05:28,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 169 [2022-03-15 22:05:28,664 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:05:28,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:05:31,806 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:05:31,806 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 835 treesize of output 541 [2022-03-15 22:09:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:09:09,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734830502] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:09:09,500 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:09:09,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2022-03-15 22:09:09,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150745606] [2022-03-15 22:09:09,500 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:09:09,501 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:09:09,506 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 133 transitions. [2022-03-15 22:09:09,506 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:09:20,784 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 17 new interpolants: [72891#(and (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (not (= (select A j) max2)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (not (< max1 (select A i))) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< max2 (+ (select A j) 1)) (< max1 (select A i)) (= max2 max1) (<= M j)) (or (< (+ i 1) N) (not (< i N)) (< max2 (+ (select A j) 1)) (not (< max1 (select A i))) (<= M j) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (not (= (select A j) max2)) (<= M j) (= (select A i) max2)) (or (<= (select A j) max2) (< (+ i 1) N) (not (< i N)) (= (select A j) max1) (< max1 (select A i)) (<= M j))), 72895#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 72884#(and (or (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (<= (select A (+ j 1)) (select A k)) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (not (< max2 (select A j))) (= (select A j) max1) (<= M (+ j 1)) (<= (+ (select A j) 1) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k))) (or (<= (select A (+ j 1)) (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (= (select A (+ j 1)) max1)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (<= (select A k) (select A j))) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (<= (select A k) max2)) (or (<= (+ max2 1) (select A k)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (<= M (+ j 1)) (= max2 max1))), 72898#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 72885#(and (or (<= (select A (+ j 1)) (select A j)) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N)) (or (not (< max2 (select A j))) (= (select A j) max1) (<= M (+ j 1)) (<= (+ (select A j) 1) (select A (+ j 1))) (<= (+ (select A j) 1) (select A k)) (< i N)) (or (<= (+ max2 1) (select A k)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (<= M (+ j 1)) (< i N) (= max2 max1)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (<= (select A k) max2) (< i N)) (or (<= (select A k) (select A (+ j 1))) (= max1 (select A k)) (not (< max2 (select A j))) (<= M (+ j 1)) (< i N) (<= (select A k) (select A j))) (or (<= (select A (+ j 1)) (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N) (<= (select A (+ j 1)) max2)) (or (= max1 (select A k)) (< max2 (select A j)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N) (<= (select A (+ j 1)) max2)) (or (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (<= (select A (+ j 1)) (select A k)) (<= M (+ j 1)) (= (select A (+ j 1)) max1) (< i N))), 72892#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 72888#(and (or (<= (select A j) max2) (= (select A j) max1) (< i N) (<= M j)) (or (< max2 (+ (select A j) 1)) (< i N) (= max2 max1) (<= M j)) (or (< i N) (not (= (select A j) max2)) (= max2 max1) (<= M j))), 72893#(and (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (not (= (select A j) max2)) (<= M j) (= (select A i) max2)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (<= M j)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< max2 (+ (select A j) 1)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (select A i) (select A (+ i 1))) (<= M j) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< max1 (select A i)) (<= M j)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max2 (+ (select A j) 1)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1) (<= M j))), 72882#(or (< i N) (= max2 max1)), 72889#(or (< k N) (< i N) (= max2 max1)), 72886#(and (or (<= (+ k 1) N) (<= k i) (<= (+ M i) (+ N j)) (not (< j M))) (or (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (= max2 max1)) (or (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (= (select A (+ j 1)) max1)) (or (not (< max2 (select A j))) (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (not (= k i)) (<= (+ M i) (+ N j)) (not (< j M)) (< max2 (select A j)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= (+ M i) (+ 2 k j)) (<= (+ M i) (+ N j)) (not (< j M)) (< i (+ k 1)))), 72896#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 72890#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 72887#(or (< k N) (= max2 max1)), 72894#(and (or (< i (+ 2 j)) (not (< j M))) (or (<= (+ M 1) N) (not (< j M))) (or (not (= (+ j 1) i)) (not (< j M)) (<= (+ M i) (+ k j 1))) (or (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (<= (+ k 1) N) (not (= (+ j 1) i)) (not (< j M))) (or (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1))), 72897#(and (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (= (select A j) max2)) (<= M j) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i)) (<= M j)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= M j) (= (select A i) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (not (= (select A j) max2)) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= M j)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (not (= (select A j) max2)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (<= M j)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j)) (<= M j)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i)) (<= M j)) (or (<= N (+ 2 i)) (< max2 (+ (select A j) 1)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1) (<= M j)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< max1 (select A i)) (<= M j))), 72883#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1)))] [2022-03-15 22:09:20,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 22:09:20,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:09:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 22:09:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2022-03-15 22:09:20,785 INFO L87 Difference]: Start difference. First operand 2434 states and 11138 transitions. Second operand has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:10:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:10:23,351 INFO L93 Difference]: Finished difference Result 5058 states and 18765 transitions. [2022-03-15 22:10:23,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2022-03-15 22:10:23,352 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:10:23,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:10:23,362 INFO L225 Difference]: With dead ends: 5058 [2022-03-15 22:10:23,362 INFO L226 Difference]: Without dead ends: 5015 [2022-03-15 22:10:23,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15895 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=6739, Invalid=36317, Unknown=0, NotChecked=0, Total=43056 [2022-03-15 22:10:23,364 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 602 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1908 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:10:23,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 0 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1908 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-03-15 22:10:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5015 states. [2022-03-15 22:10:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5015 to 2545. [2022-03-15 22:10:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2544 states have (on average 4.559748427672956) internal successors, (11600), 2544 states have internal predecessors, (11600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:10:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 11600 transitions. [2022-03-15 22:10:23,424 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 11600 transitions. Word has length 17 [2022-03-15 22:10:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:10:23,424 INFO L470 AbstractCegarLoop]: Abstraction has 2545 states and 11600 transitions. [2022-03-15 22:10:23,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3076923076923075) internal successors, (86), 26 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:10:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 11600 transitions. [2022-03-15 22:10:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:10:23,430 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:10:23,430 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:10:23,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-15 22:10:23,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:23,639 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:10:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:10:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash 157231774, now seen corresponding path program 14 times [2022-03-15 22:10:23,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:10:23,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416714315] [2022-03-15 22:10:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:10:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:10:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:10:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:23,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:10:23,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416714315] [2022-03-15 22:10:23,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416714315] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:10:23,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327884552] [2022-03-15 22:10:23,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 22:10:23,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:10:23,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:10:23,919 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:10:23,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 22:10:23,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:10:23,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-15 22:10:23,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 34 conjunts are in the unsatisfiable core [2022-03-15 22:10:23,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:10:24,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:24,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:24,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:24,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 22:10:24,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:10:24,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 153 [2022-03-15 22:10:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:10:25,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:10:26,393 INFO L353 Elim1Store]: treesize reduction 48, result has 68.2 percent of original size [2022-03-15 22:10:26,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 907 treesize of output 527 [2022-03-15 22:11:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:11:07,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327884552] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:11:07,820 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:11:07,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2022-03-15 22:11:07,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080418786] [2022-03-15 22:11:07,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:11:07,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:11:07,826 INFO L252 McrAutomatonBuilder]: Finished intersection with 82 states and 168 transitions. [2022-03-15 22:11:07,826 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:11:25,174 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 33 new interpolants: [83514#(or (<= (+ k 1) N) (< j M) (= max2 max1)), 83499#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 83503#(and (or (<= N (+ 2 i)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2))), 83502#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 83506#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 83527#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2))), 83525#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< j M) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 83524#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 83515#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (= max2 max1))), 83516#(and (or (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= max2 max1)) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (= max2 max1)) (or (<= (+ 2 k) N) (< j M)) (or (= max1 (select A (+ (- 1) N))) (<= (select A (+ (- 1) N)) max2) (< j M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N)) (or (= max1 (select A (+ (- 1) N))) (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (select A k) max2)) (or (= max1 (select A (+ (- 1) N))) (< j M) (< (+ 2 k) N) (<= (select A (+ (- 1) N)) (select A k)) (= max2 max1)) (or (= max1 (select A k)) (< j M) (< (+ 2 k) N) (<= (+ max2 1) (select A (+ (- 1) N))) (<= (select A k) max2))), 83496#(or (< j M) (= max2 max1)), 83519#(and (or (= max1 (select A k)) (<= (+ 2 k) N) (< j M) (<= (select A k) max2) (< i N)) (or (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1))), 83501#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 83512#(and (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= max1 (select A k)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (<= (+ 2 k) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ max2 1) (select A k)) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A k) max2)) (or (<= N (+ 2 i)) (= (select A (+ 2 i)) (select A k)) (<= (+ 2 k) N) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2) (<= (select A (+ 2 i)) max1))), 83518#(or (<= (+ k 1) N) (< j M) (< i N) (= max2 max1)), 83511#(and (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i)))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (< max1 (select A i)) (<= (select A k) max2) (not (< max1 (select A (+ i 1))))) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (= (select A k) (select A (+ i 1))) (<= (+ 2 k) N) (not (< (select A i) (select A (+ i 1)))) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (not (< (+ i 1) N)) (= max1 (select A k)) (< (+ 2 i) N) (<= (+ 2 k) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A k) max2)) (or (not (< (+ i 1) N)) (< (+ 2 i) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (= max2 (select A (+ i 1))) (< max1 (select A i)) (not (< max1 (select A (+ i 1)))))), 83507#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 83504#(and (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 83513#(and (or (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< i k) (not (< i N))) (or (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (not (< i N)) (<= k (+ i 1)))), 83523#(and (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (= 0 (+ (* (- 1) (select A k)) max1)) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (= 0 (+ (* (- 1) (select A k)) max1)) (not (< j M)) (= (select A j) max1)) (or (< (+ j 1) M) (not (< j M)) (<= (select A k) max1)) (or (< (+ j 1) M) (<= (+ k 1) i) (not (< j M))) (or (< (+ j 1) M) (not (< max2 (select A j))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k)))), 83498#(or (< j M) (< i N) (= max2 max1)), 83521#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (< j M) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2))), 83510#(and (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (= max1 (select A k)) (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (< max1 (select A i)) (<= (select A k) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 2 k) N) (not (< i N)) (= (select A i) (select A k)) (not (< max1 (select A i))) (<= (select A k) max2))), 83497#(or (< i N) (= max2 max1)), 83509#(and (or (<= (+ 2 k) N) (<= (+ max2 1) (select A k)) (< i N) (= max2 max1)) (or (= max1 (select A k)) (<= (+ 2 k) N) (<= (select A k) max2) (< i N))), 83505#(or (<= (+ k 1) N) (< i N) (= max2 max1)), 83517#(and (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (= (select A j) max1) (<= (select A (+ (- 1) N)) (select A k))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (select A k) (select A j))) (or (< (+ j 1) M) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (< max2 (select A j)) (= max2 max1)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) 1) (select A (+ (- 1) N))) (= (select A j) max1)) (or (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ (- 1) N))) (= max2 max1)) (or (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (= (select A j) max1) (<= (+ (select A j) 1) (select A k))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (<= (select A (+ (- 1) N)) max2) (<= (+ max2 1) (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j))) (or (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ (- 1) N))) (<= (select A k) max2)) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (<= (+ (select A k) 1) (select A (+ (- 1) N))) (not (< j M)) (= (select A j) max1)) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (select A (+ (- 1) N)) (select A j)) (<= (+ (select A j) 1) (select A k))) (or (< (+ j 1) M) (= max1 (select A k)) (not (< max2 (select A j))) (< (+ 2 k) N) (not (< j M)) (<= (+ (select A j) 1) (select A (+ (- 1) N))) (<= (select A k) (select A j))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (= max1 (select A k)) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (select A k) max2)) (or (< (+ j 1) M) (<= (+ 2 k) N) (not (< j M))) (or (= max1 (select A (+ (- 1) N))) (< (+ j 1) M) (< (+ 2 k) N) (not (< j M)) (< max2 (select A j)) (<= (select A (+ (- 1) N)) (select A k)) (= max2 max1))), 83520#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 83508#(and (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 83528#(and (or (< i k) (not (< i N))) (or (not (= (+ i 1) k)) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (<= (+ k j) (+ M i 1)) (not (< i N))) (or (not (= (+ i 1) k)) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 83500#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 83522#(and (or (< j M) (<= (+ max2 1) (select A k)) (= max2 max1)) (or (< j M) (<= (select A k) max1)) (or (< j M) (= 0 (+ (* (- 1) (select A k)) max1)) (= max2 max1)) (or (< j M) (<= (+ k 1) i))), 83526#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)))] [2022-03-15 22:11:25,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 22:11:25,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:11:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 22:11:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2932, Unknown=0, NotChecked=0, Total=3306 [2022-03-15 22:11:25,175 INFO L87 Difference]: Start difference. First operand 2545 states and 11600 transitions. Second operand has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 22:12:47,606 INFO L93 Difference]: Finished difference Result 5503 states and 20409 transitions. [2022-03-15 22:12:47,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2022-03-15 22:12:47,606 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-03-15 22:12:47,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 22:12:47,617 INFO L225 Difference]: With dead ends: 5503 [2022-03-15 22:12:47,617 INFO L226 Difference]: Without dead ends: 5379 [2022-03-15 22:12:47,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 36 SyntacticMatches, 13 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34094 ImplicationChecksByTransitivity, 82.2s TimeCoverageRelationStatistics Valid=12912, Invalid=81030, Unknown=0, NotChecked=0, Total=93942 [2022-03-15 22:12:47,621 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1058 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 4818 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 4818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-03-15 22:12:47,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1058 Valid, 0 Invalid, 5166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 4818 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-03-15 22:12:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-03-15 22:12:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 2641. [2022-03-15 22:12:47,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2640 states have (on average 4.573484848484848) internal successors, (12074), 2640 states have internal predecessors, (12074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 12074 transitions. [2022-03-15 22:12:47,690 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 12074 transitions. Word has length 17 [2022-03-15 22:12:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 22:12:47,690 INFO L470 AbstractCegarLoop]: Abstraction has 2641 states and 12074 transitions. [2022-03-15 22:12:47,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.8372093023255816) internal successors, (122), 43 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 22:12:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 12074 transitions. [2022-03-15 22:12:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 22:12:47,696 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 22:12:47,696 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 22:12:47,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-03-15 22:12:47,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:47,909 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 22:12:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 22:12:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash -965868444, now seen corresponding path program 15 times [2022-03-15 22:12:47,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 22:12:47,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113733463] [2022-03-15 22:12:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 22:12:47,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 22:12:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 22:12:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:48,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 22:12:48,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113733463] [2022-03-15 22:12:48,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113733463] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 22:12:48,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014553670] [2022-03-15 22:12:48,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 22:12:48,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 22:12:48,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 22:12:48,707 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-15 22:12:48,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-15 22:12:48,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-15 22:12:48,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 22:12:48,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-15 22:12:48,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 22:12:53,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 22:12:53,545 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-15 22:12:53,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 239 treesize of output 169 [2022-03-15 22:12:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:12:53,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 22:12:57,151 INFO L353 Elim1Store]: treesize reduction 24, result has 83.0 percent of original size [2022-03-15 22:12:57,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 847 treesize of output 541 [2022-03-15 22:15:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 22:15:21,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014553670] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 22:15:21,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 22:15:21,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2022-03-15 22:15:21,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2097505254] [2022-03-15 22:15:21,462 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 22:15:21,463 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 22:15:21,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 136 transitions. [2022-03-15 22:15:21,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 22:15:43,500 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 35 new interpolants: [94947#(and (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< k N) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 2 j) M) (< k N) (= (select A j) max1))), 94956#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 94953#(and (or (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (< max2 (select A j)) (< max1 (select A i)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (< (+ i 1) N) (not (< i N)) (<= 2 M)) (or (< (+ i 1) N) (not (< max2 (select A j))) (<= (+ 3 j) M) (not (< i N)) (= (select A j) max1) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (< (+ i 1) N) (not (< i N)) (= j 0)) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (not (< max2 (select A j))) (<= (+ 3 j) M) (not (< i N)) (< max1 (select A i)) (= (select A (+ j 1)) max1)) (or (<= (select A (+ j 1)) (select A j)) (< (+ i 1) N) (not (< max2 (select A j))) (<= (+ 3 j) M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) (select A (+ j 1)))) (or (< (+ i 1) N) (not (< max2 (select A j))) (<= (+ 3 j) M) (not (< i N)) (= (select A i) (select A j)) (not (< max1 (select A i))) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (<= (+ 3 j) M) (not (< i N)) (< max2 (select A j)) (not (< max1 (select A i))) (= (select A i) (select A (+ j 1))) (<= (select A (+ j 1)) max2))), 94964#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)))), 94944#(or (< k N) (< i N) (= max2 max1)), 94957#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 94951#(and (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (select A j) max2) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (< k N) (not (< max1 (select A i)))) (or (<= (select A j) max2) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N) (= (select A j) max1) (< max1 (select A i))) (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 94961#(and (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (< k N))), 94945#(or (< j M) (< k N) (= max2 max1)), 94960#(and (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= (select A j) max2) (<= N (+ i 1)) (<= (+ 2 j) M) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A j) (select A (+ i 1))) (< max1 (select A i)))), 94954#(and (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ 2 k) (+ N M)) (< i N) (= max2 max1)) (or (<= (+ k 1) N) (= j 0) (< i N)) (or (<= (+ k 1) N) (= (select A (+ (- 1) (* (- 1) k) N M)) max1) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2) (< i N)) (or (<= (+ k 1) N) (<= (+ 2 k) (+ N M)) (< i N)) (or (<= (+ (select A j) 1) max2) (<= (+ k 1) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (= (select A j) max1) (< i N))), 94962#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ 3 j) M) (< max2 (select A j)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= (+ max2 1) (select A (+ j 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ 3 j) M) (< (select A i) (select A (+ i 1))) (< max2 (select A j)) (= (select A i) (select A (+ j 1))) (<= (select A (+ j 1)) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 j) M) (< max2 (select A j)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= j 0)) (or (<= N (+ i 1)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ 3 j) M) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ 3 j) M) (< (select A i) (select A (+ i 1))) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (<= (+ 3 j) M) (= (select A j) (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= N (+ i 1)) (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ 3 j) M) (< (select A i) (select A (+ i 1))) (= (select A i) (select A (+ j 1)))) (or (<= N (+ i 1)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (+ 3 j) M) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (<= (+ 3 j) M) (< max2 (select A j)) (= max2 (select A (+ i 1))) (<= (+ max2 1) (select A (+ j 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (<= (select A i) max1) (<= (+ 3 j) M) (< max2 (select A j)) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ j 1)) max2)) (or (<= N (+ i 1)) (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (+ 3 j) M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ j 1)) max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 j) M) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ 3 j) M) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= 2 M)) (or (<= N (+ i 1)) (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A (+ j 1)) (select A (+ i 1))) (<= (+ 3 j) M) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (= (select A (+ j 1)) (select A (+ i 1))) (<= (+ 3 j) M) (< max2 (select A j)) (< max1 (select A i)) (<= (select A (+ j 1)) max2)) (or (<= N (+ i 1)) (<= (select A (+ j 1)) (select A j)) (not (< max2 (select A j))) (< (+ 2 i) N) (= (select A (+ j 1)) (select A (+ i 1))) (<= (select A i) max1) (<= (+ 3 j) M) (<= (select A (+ i 1)) (select A i)))), 94942#(and (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (<= (select A j) max2) (<= (+ 2 j) M) (< (+ i 1) N) (not (< i N)) (= (select A j) max1) (< max1 (select A i)))), 94946#(or (< k N) (<= (+ j 1) M) (< i N) (= max2 max1)), 94939#(and (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< i N) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 2 j) M) (= (select A j) max1) (< i N))), 94949#(and (or (< (+ i 1) N) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2))), 94943#(or (< k N) (= max2 max1)), 94938#(or (<= (+ j 1) M) (< i N) (= max2 max1)), 94940#(and (or (< (+ i 1) N) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (not (< i N)) (< max1 (select A i)) (= max2 max1))), 94950#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (< (+ i 1) N) (< j M) (not (< i N)) (< k N) (< max1 (select A i)) (= max2 max1))), 94970#(and (or (<= (+ (select A j) 1) max2) (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) max1) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ 2 k) (+ N M))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= (select A i) max2)) (or (<= N (+ i 1)) (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< (+ 2 k) (+ N M)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ 2 i) N) (< (+ 2 k) (+ N M)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (+ (select A j) 1) max2) (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (= (select A i) (select A j))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) max1) (< (+ 2 k) (+ N M)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (= (select A (+ (- 1) (* (- 1) k) N M)) max1) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= j 0) (< k N)) (or (<= (+ (select A j) 1) max2) (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) max1) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A i) max1) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (< (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= (+ (select A j) 1) max2) (<= N (+ i 1)) (<= (+ k 1) N) (< (+ 2 i) N) (<= (select A (+ i 1)) max1) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< max1 (select A i)))), 94948#(and (or (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< k N) (< i N) (= max2 max1)) (or (<= (select A j) max2) (<= (+ 2 j) M) (< k N) (= (select A j) max1) (< i N))), 94969#(and (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1))) (<= (select A (+ 2 i)) max1) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (= (select A (+ j 1)) (select A (+ i 1))) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (< max1 (select A i)) (<= (select A (+ j 1)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (= (select A (+ 2 i)) (select A (+ j 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1) (<= (select A (+ j 1)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (+ (select A j) 1) (select A (+ j 1))) (= (select A (+ 2 i)) (select A j))) (or (<= (select A j) max2) (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (<= (select A (+ i 1)) (select A i)) (<= (+ max2 1) (select A (+ j 1))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ i 1)) max1) (= (select A (+ j 1)) (select A (+ i 1))) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (<= (+ max2 1) (select A (+ j 1)))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (+ (select A j) 1) (select A (+ j 1))) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A (+ j 1)) (select A j)) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A (+ j 1)))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (< max1 (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ j 1)) max1)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (= max2 (select A (+ i 1))) (<= (+ max2 1) (select A (+ j 1))) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A j) 1) (select A (+ j 1))) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (= (select A (+ j 1)) (select A (+ i 1))) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ j 1)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (<= (select A (+ i 1)) (select A i)) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (select A (+ j 1)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< max2 (select A j)) (= (select A i) (select A (+ j 1))) (<= (select A (+ j 1)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A (+ 2 i)) (select A (+ i 1)))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (= (select A (+ j 1)) (select A (+ i 1))) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) (select A (+ j 1)))) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ j 1)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (<= (+ (select A j) 1) (select A (+ j 1)))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (<= (+ 3 j) M) (< (+ 3 i) N) (< max2 (select A j)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ j 1)) max1) (<= (select A (+ j 1)) max2)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (<= 2 M)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (select A (+ j 1)) (select A j)) (<= (select A (+ i 1)) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< max2 (select A j)) (<= (+ max2 1) (select A (+ j 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (<= (+ 3 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< max2 (select A j)) (= (select A (+ 2 i)) (select A (+ j 1))) (<= (select A (+ j 1)) max2))), 94937#(or (< i N) (= max2 max1)), 94955#(and (or (<= (+ k 1) N) (< (+ i 1) N) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (not (< i N)) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (not (< max1 (select A i))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) (+ N M)) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ 2 k) (+ N M))) (or (< (+ i 1) N) (not (< i N)) (= j 0) (< k N)) (or (<= (+ (select A j) 1) max2) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (= (select A j) max1) (< max1 (select A i))) (or (<= (+ (select A j) 1) max2) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (= (select A (+ (- 1) (* (- 1) k) N M)) max1) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ i 1) N) (not (< i N)) (< (+ 2 k) (+ N M)) (< max1 (select A i)) (= max2 max1))), 94952#(and (or (<= 2 M) (< i N)) (or (= j 0) (< i N)) (or (<= (+ (select A j) 1) max2) (<= (+ (select A j) 1) (select A (+ (- 1) M))) (= (select A j) max1) (< 2 M) (< i N)) (or (<= (+ max2 1) (select A j)) (<= (+ max2 1) (select A (+ (- 1) M))) (< 2 M) (< i N) (= max2 max1)) (or (<= (select A (+ (- 1) M)) max2) (<= (select A (+ (- 1) M)) (select A j)) (= (select A (+ (- 1) M)) max1) (< 2 M) (< i N))), 94941#(and (or (< (+ i 1) N) (< j M) (not (< i N)) (< max1 (select A i)) (= max2 max1)) (or (< (+ i 1) N) (< j M) (not (< i N)) (not (< max1 (select A i))) (= (select A i) max2))), 94971#(and (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (<= (select A i) max1) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (< max1 (select A i))) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A i) max1) (< (+ 3 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2) (<= (select A (+ 2 i)) max1)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= (select A i) max2)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (< (+ 3 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1)))) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2) (= (select A (+ (- 1) (* (- 1) k) N M)) (select A (+ i 1)))) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (< (+ 3 i) N) (<= (+ 2 k) (+ N M))) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (= (select A j) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (select A (+ i 1)) (select A i))) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A i) max1) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (<= (select A (+ i 1)) (select A i)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (select A (+ 2 i)) (select A (+ i 1))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ k 1) N) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (= (select A i) (select A j))) (or (<= (+ (select A j) 1) max2) (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (+ (select A j) 1) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 2 k) (+ N M)) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ k 1) N) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (= (select A (+ 2 i)) (select A (+ (- 1) (* (- 1) k) N M))) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= N (+ 2 i)) (<= (+ k 1) N) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (= (select A (+ (- 1) (* (- 1) k) N M)) max1) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (= (select A (+ 2 i)) max2)) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= (+ max2 1) (select A (+ (- 1) (* (- 1) k) N M))) (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ k 1) N) (< (+ 3 i) N) (< (+ 2 k) (+ N M)) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (= j 0) (< k N)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ k 1) N) (<= (select A i) max1) (= (select A i) (select A (+ (- 1) (* (- 1) k) N M))) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< (+ 2 k) (+ N M)) (<= (select A (+ (- 1) (* (- 1) k) N M)) (select A j)) (<= (+ (select A (+ (- 1) (* (- 1) k) N M)) 1) max2))), 94959#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2))), 94966#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2))), 94967#(and (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (= (select A i) max2)) (or (<= N (+ 2 i)) (< j M) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A i) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< j M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< j M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 94965#(and (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A (+ 2 i)) (select A j))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1))), 94958#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A i) max1) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< j M) (<= (select A (+ i 1)) max1) (= max2 (select A (+ i 1))) (< max1 (select A i)))), 94963#(and (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A i) max1) (< (+ 3 i) N) (<= (select A (+ i 1)) (select A i)) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< max1 (select A i))) (or (<= N (+ 2 i)) (< (select A (+ i 1)) (select A (+ 2 i))) (<= (select A i) max1) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (<= (select A (+ i 1)) (select A i))) (or (<= N (+ 2 i)) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= N (+ 2 i)) (< (+ 3 i) N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1))), 94968#(and (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) (select A j))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (= (select A j) max1) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= max2 (select A (+ i 1))) (< k N) (< max1 (select A i))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (<= (select A (+ i 1)) max1) (< (+ 3 i) N) (< k N) (<= (select A (+ 2 i)) (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= (select A (+ 2 i)) max2) (<= (select A (+ 2 i)) max1)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) (select A j))) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (<= (select A (+ 2 i)) max1) (= (select A (+ 2 i)) (select A j))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< max1 (select A (+ 2 i))) (< (+ 3 i) N) (< k N) (< max1 (select A (+ i 1))) (< max1 (select A i)) (= max2 max1)) (or (<= (select A j) max2) (<= N (+ 2 i)) (<= (+ 2 j) M) (< (select A (+ i 1)) (select A (+ 2 i))) (< (+ 3 i) N) (= (select A j) (select A (+ i 1))) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i)))) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (<= (select A (+ 2 i)) (select A i)) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A (+ 2 i)) max2)) (or (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (< k N) (not (< max1 (select A i))) (= (select A i) max2)) (or (<= N (+ 2 i)) (<= (+ max2 1) (select A j)) (<= (+ 2 j) M) (< (+ 3 i) N) (< k N) (<= (select A (+ i 1)) (select A i)) (not (< max1 (select A i))) (<= (select A (+ 2 i)) (select A (+ i 1))) (= (select A (+ 2 i)) max2)) (or (<= (select A j) max2) (<= N (+ 2 i)) (< (select A i) (select A (+ 2 i))) (<= (+ 2 j) M) (< (+ 3 i) N) (< (select A i) (select A (+ i 1))) (= (select A i) (select A j)) (< k N) (not (< max1 (select A i)))))] [2022-03-15 22:15:43,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-03-15 22:15:43,500 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 22:15:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-03-15 22:15:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=3568, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 22:15:43,504 INFO L87 Difference]: Start difference. First operand 2641 states and 12074 transitions. Second operand has 47 states, 46 states have (on average 2.5217391304347827) internal successors, (116), 46 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-03-15 22:16:33,023 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:16:33,023 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-15 22:16:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-15 22:16:33,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 20 SyntacticMatches, 12 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7558 ImplicationChecksByTransitivity, 53.1s TimeCoverageRelationStatistics Valid=3479, Invalid=19473, Unknown=0, NotChecked=0, Total=22952 [2022-03-15 22:16:33,043 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 537 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-03-15 22:16:33,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 0 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-03-15 22:16:33,044 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 22:16:33,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-15 22:16:33,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-15 22:16:33,261 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was constructing difference of abstraction (2641states) and FLOYD_HOARE automaton (currently 103 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 152 known predicates. [2022-03-15 22:16:33,262 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 22:16:33,262 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 22:16:33,262 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 22:16:33,263 INFO L732 BasicCegarLoop]: Path program histogram: [15, 9, 1, 1, 1] [2022-03-15 22:16:33,265 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 22:16:33,265 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 22:16:33,266 INFO L202 PluginConnector]: Adding new model max-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 10:16:33 BasicIcfg [2022-03-15 22:16:33,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 22:16:33,266 INFO L158 Benchmark]: Toolchain (without parser) took 874462.32ms. Allocated memory was 197.1MB in the beginning and 857.7MB in the end (delta: 660.6MB). Free memory was 157.8MB in the beginning and 294.7MB in the end (delta: -136.9MB). Peak memory consumption was 524.3MB. Max. memory is 8.0GB. [2022-03-15 22:16:33,267 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 22:16:33,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.83ms. Allocated memory is still 197.1MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:16:33,267 INFO L158 Benchmark]: Boogie Preprocessor took 16.98ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 155.2MB in the end (delta: 980.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 22:16:33,267 INFO L158 Benchmark]: RCFGBuilder took 228.44ms. Allocated memory is still 197.1MB. Free memory was 155.2MB in the beginning and 146.0MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 22:16:33,267 INFO L158 Benchmark]: TraceAbstraction took 874192.06ms. Allocated memory was 197.1MB in the beginning and 857.7MB in the end (delta: 660.6MB). Free memory was 145.5MB in the beginning and 294.7MB in the end (delta: -149.3MB). Peak memory consumption was 512.7MB. Max. memory is 8.0GB. [2022-03-15 22:16:33,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.83ms. Allocated memory is still 197.1MB. Free memory was 157.7MB in the beginning and 156.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.98ms. Allocated memory is still 197.1MB. Free memory was 156.2MB in the beginning and 155.2MB in the end (delta: 980.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 228.44ms. Allocated memory is still 197.1MB. Free memory was 155.2MB in the beginning and 146.0MB in the end (delta: 9.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 874192.06ms. Allocated memory was 197.1MB in the beginning and 857.7MB in the end (delta: 660.6MB). Free memory was 145.5MB in the beginning and 294.7MB in the end (delta: -149.3MB). Peak memory consumption was 512.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 36 PlacesBefore, 25 PlacesAfterwards, 29 TransitionsBefore, 18 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 66, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 106, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 66, unknown conditional: 0, unknown unconditional: 66] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (2641states) and FLOYD_HOARE automaton (currently 103 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 152 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2641states) and FLOYD_HOARE automaton (currently 103 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 152 known predicates. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2641states) and FLOYD_HOARE automaton (currently 103 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 152 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing difference of abstraction (2641states) and FLOYD_HOARE automaton (currently 103 states, 47 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 152 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 42 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 874.1s, OverallIterations: 27, TraceHistogramMax: 4, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.1s, AutomataDifference: 306.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8327 SdHoareTripleChecker+Valid, 17.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8327 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6934 mSDsCounter, 3433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28193 IncrementalHoareTripleChecker+Invalid, 31626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3433 mSolverCounterUnsat, 0 mSDtfsCounter, 28193 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3706 GetRequests, 1106 SyntacticMatches, 124 SemanticMatches, 2475 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127902 ImplicationChecksByTransitivity, 311.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2641occurred in iteration=26, InterpolantAutomatonStates: 1879, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 26 MinimizatonAttempts, 18539 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 463.2s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 73 NumberOfCheckSat, 1082 ConstructedInterpolants, 18 QuantifiedInterpolants, 31009 SizeOfPredicates, 88 NumberOfNonLiveVariables, 1558 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 75 InterpolantComputations, 3 PerfectInterpolantSequences, 150/515 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