/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/three-array-min.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-15 21:44:25,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-15 21:44:25,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-15 21:44:25,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-15 21:44:25,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-15 21:44:25,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-15 21:44:25,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-15 21:44:25,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-15 21:44:25,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-15 21:44:25,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-15 21:44:25,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-15 21:44:25,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-15 21:44:25,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-15 21:44:25,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-15 21:44:25,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-15 21:44:25,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-15 21:44:25,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-15 21:44:25,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-15 21:44:25,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-15 21:44:25,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-15 21:44:25,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-15 21:44:25,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-15 21:44:25,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-15 21:44:25,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-15 21:44:25,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-15 21:44:25,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-15 21:44:25,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-15 21:44:25,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-15 21:44:25,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-15 21:44:25,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-15 21:44:25,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-15 21:44:25,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-15 21:44:25,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-15 21:44:25,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-15 21:44:25,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-15 21:44:25,556 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-15 21:44:25,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-15 21:44:25,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-15 21:44:25,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-15 21:44:25,557 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-15 21:44:25,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-15 21:44:25,563 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 21:44:25,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-15 21:44:25,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-15 21:44:25,587 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-15 21:44:25,587 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-15 21:44:25,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * Use SBE=true [2022-03-15 21:44:25,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-15 21:44:25,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-15 21:44:25,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-15 21:44:25,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:44:25,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2022-03-15 21:44:25,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-15 21:44:25,590 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 21:44:25,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-15 21:44:25,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-15 21:44:25,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-15 21:44:25,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-03-15 21:44:25,792 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-03-15 21:44:25,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl [2022-03-15 21:44:25,793 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-min.wvr.bpl' [2022-03-15 21:44:25,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-15 21:44:25,829 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-15 21:44:25,830 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-15 21:44:25,830 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-15 21:44:25,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-15 21:44:25,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,856 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-03-15 21:44:25,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-15 21:44:25,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-15 21:44:25,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-15 21:44:25,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-15 21:44:25,865 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-15 21:44:25,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-15 21:44:25,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-15 21:44:25,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-15 21:44:25,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/1) ... [2022-03-15 21:44:25,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-15 21:44:25,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:25,911 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 21:44:25,931 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 21:44:25,965 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2022-03-15 21:44:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-03-15 21:44:25,965 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-03-15 21:44:25,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2022-03-15 21:44:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-03-15 21:44:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-03-15 21:44:25,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-03-15 21:44:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-15 21:44:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-15 21:44:25,966 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2022-03-15 21:44:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-03-15 21:44:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-03-15 21:44:25,967 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 21:44:26,000 INFO L234 CfgBuilder]: Building ICFG [2022-03-15 21:44:26,001 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-15 21:44:26,090 INFO L275 CfgBuilder]: Performing block encoding [2022-03-15 21:44:26,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-15 21:44:26,102 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-03-15 21:44:26,120 INFO L202 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:44:26 BoogieIcfgContainer [2022-03-15 21:44:26,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-15 21:44:26,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-15 21:44:26,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-15 21:44:26,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-15 21:44:26,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.03 09:44:25" (1/2) ... [2022-03-15 21:44:26,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b819681 and model type three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 09:44:26, skipping insertion in model container [2022-03-15 21:44:26,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 09:44:26" (2/2) ... [2022-03-15 21:44:26,126 INFO L111 eAbstractionObserver]: Analyzing ICFG three-array-min.wvr.bpl [2022-03-15 21:44:26,129 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-15 21:44:26,129 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-15 21:44:26,129 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-15 21:44:26,129 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-15 21:44:26,165 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-03-15 21:44:26,226 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-15 21:44:26,231 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 21:44:26,231 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-03-15 21:44:26,256 INFO L126 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-03-15 21:44:26,262 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 32 transitions, 88 flow [2022-03-15 21:44:26,282 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 32 transitions, 88 flow [2022-03-15 21:44:26,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 32 transitions, 88 flow [2022-03-15 21:44:26,300 INFO L129 PetriNetUnfolder]: 4/29 cut-off events. [2022-03-15 21:44:26,300 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-03-15 21:44:26,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 4/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2022-03-15 21:44:26,306 INFO L116 LiptonReduction]: Number of co-enabled transitions 184 [2022-03-15 21:44:26,547 INFO L131 LiptonReduction]: Checked pairs total: 202 [2022-03-15 21:44:26,548 INFO L133 LiptonReduction]: Total number of compositions: 14 [2022-03-15 21:44:26,553 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 64 flow [2022-03-15 21:44:26,563 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:26,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:26,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-03-15 21:44:26,568 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:26,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:26,568 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1167999982, now seen corresponding path program 1 times [2022-03-15 21:44:26,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:26,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72295184] [2022-03-15 21:44:26,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:26,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:26,708 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 21:44:26,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:26,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72295184] [2022-03-15 21:44:26,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72295184] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:44:26,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:44:26,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-03-15 21:44:26,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [416117161] [2022-03-15 21:44:26,710 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:26,744 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:26,766 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 38 transitions. [2022-03-15 21:44:26,766 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:26,940 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:44:26,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-15 21:44:26,941 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:26,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-15 21:44:26,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-15 21:44:26,957 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 0 states have call successors, (0), 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 21:44:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:26,990 INFO L93 Difference]: Finished difference Result 53 states and 155 transitions. [2022-03-15 21:44:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-15 21:44:26,992 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 21:44:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:27,005 INFO L225 Difference]: With dead ends: 53 [2022-03-15 21:44:27,006 INFO L226 Difference]: Without dead ends: 45 [2022-03-15 21:44:27,007 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 21:44:27,013 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:27,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:44:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-15 21:44:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-03-15 21:44:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 3.081081081081081) internal successors, (114), 37 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 114 transitions. [2022-03-15 21:44:27,043 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 114 transitions. Word has length 11 [2022-03-15 21:44:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:27,043 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 114 transitions. [2022-03-15 21:44:27,044 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 21:44:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 114 transitions. [2022-03-15 21:44:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-03-15 21:44:27,044 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:27,044 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:27,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-15 21:44:27,045 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1466792831, now seen corresponding path program 1 times [2022-03-15 21:44:27,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:27,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254467634] [2022-03-15 21:44:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:27,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:27,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:27,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:27,088 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254467634] [2022-03-15 21:44:27,088 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254467634] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:44:27,088 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:44:27,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:44:27,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [901630599] [2022-03-15 21:44:27,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:27,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:27,095 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 68 transitions. [2022-03-15 21:44:27,096 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:27,297 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:44:27,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-15 21:44:27,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-15 21:44:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:44:27,299 INFO L87 Difference]: Start difference. First operand 38 states and 114 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:27,332 INFO L93 Difference]: Finished difference Result 78 states and 224 transitions. [2022-03-15 21:44:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-15 21:44:27,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21:44:27,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:27,333 INFO L225 Difference]: With dead ends: 78 [2022-03-15 21:44:27,333 INFO L226 Difference]: Without dead ends: 66 [2022-03-15 21:44:27,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-03-15 21:44:27,334 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:27,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:44:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-15 21:44:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2022-03-15 21:44:27,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 152 transitions. [2022-03-15 21:44:27,339 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 152 transitions. Word has length 13 [2022-03-15 21:44:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:27,340 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 152 transitions. [2022-03-15 21:44:27,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 152 transitions. [2022-03-15 21:44:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-03-15 21:44:27,340 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:27,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:27,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-15 21:44:27,341 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1177209591, now seen corresponding path program 1 times [2022-03-15 21:44:27,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:27,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316024085] [2022-03-15 21:44:27,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:27,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:27,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:27,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316024085] [2022-03-15 21:44:27,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316024085] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:44:27,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-15 21:44:27,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-15 21:44:27,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [382726543] [2022-03-15 21:44:27,367 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:27,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:27,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 78 transitions. [2022-03-15 21:44:27,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:27,503 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [421#(< i N), 423#(or (< k N) (< i N)), 422#(< k N)] [2022-03-15 21:44:27,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-15 21:44:27,504 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-15 21:44:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-03-15 21:44:27,505 INFO L87 Difference]: Start difference. First operand 50 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:27,588 INFO L93 Difference]: Finished difference Result 73 states and 221 transitions. [2022-03-15 21:44:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:44:27,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-03-15 21:44:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:27,589 INFO L225 Difference]: With dead ends: 73 [2022-03-15 21:44:27,589 INFO L226 Difference]: Without dead ends: 69 [2022-03-15 21:44:27,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-03-15 21:44:27,590 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:27,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:44:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-15 21:44:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-03-15 21:44:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 3.140625) internal successors, (201), 64 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 201 transitions. [2022-03-15 21:44:27,596 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 201 transitions. Word has length 14 [2022-03-15 21:44:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:27,596 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 201 transitions. [2022-03-15 21:44:27,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 201 transitions. [2022-03-15 21:44:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-15 21:44:27,597 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:27,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:27,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-15 21:44:27,597 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1571480350, now seen corresponding path program 1 times [2022-03-15 21:44:27,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:27,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618998648] [2022-03-15 21:44:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:27,838 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 21:44:27,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:27,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618998648] [2022-03-15 21:44:27,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618998648] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:27,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203577507] [2022-03-15 21:44:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:27,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:27,841 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 21:44:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:27,885 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 21:44:27,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2022-03-15 21:44:27,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:28,216 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 50 treesize of output 34 [2022-03-15 21:44:28,220 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 67 treesize of output 47 [2022-03-15 21:44:28,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-03-15 21:44:28,353 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 50 treesize of output 38 [2022-03-15 21:44:28,376 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 21:44:28,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:28,422 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 28 treesize of output 26 [2022-03-15 21:44:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:28,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203577507] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:28,798 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:28,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-03-15 21:44:28,798 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1388609302] [2022-03-15 21:44:28,799 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:28,800 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:28,805 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 108 transitions. [2022-03-15 21:44:28,805 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:33,708 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [727#(and (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (not (< minb (select B i)))) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (select C l)))), 726#(and (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc))), 728#(and (or (<= (select A i) mina) (= mina (select A k)) (= (select A 0) mina)) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (= l k) (or (<= (select A i) mina) (<= (+ 2 minc) (+ (select A k) (select B k))) (<= (+ (select A 0) 1) (select A k)) (= mina (select A k))) (or (<= (+ 2 minc) (+ (select A k) (select B k))) (< mina (select A i)) (= (select A i) (select A k)) (< minb (select B i)) (= (select B i) (select B k))) (or (<= (+ (select A k) (select B k)) minc) (<= (+ (select B 0) (select A k)) minc) (< mina (select A i)) (= (+ (select A 0) (* (select A i) (- 1))) 0)) (or (<= (+ 2 minc) (+ (select A k) (select B k))) (< mina (select A i)) (= (select A i) (select A k)) (<= (+ (select A 0) 1) (select A k))) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (<= (+ (select A k) (select B k)) minc) (= (select B 0) (select B i)) (< mina (select A i)) (< minb (select B i)) (= (+ (select A 0) (* (select A i) (- 1))) 0)) (or (<= (+ (select A 0) (select B k)) minc) (< mina (select A i)) (not (= (+ (select A 0) (* (select A i) (- 1))) 0)) (<= (+ (select B 0) (select A 0)) minc)) (or (= (select B 0) (select B i)) (<= (+ (select A 0) (select B k)) minc) (< mina (select A i)) (not (= (+ (select A 0) (* (select A i) (- 1))) 0)) (< minb (select B i))) (or (= (select B 0) (select B i)) (< minb (select B i)) (= (select B i) (select B k))) (or (< mina (select A i)) (= (select A i) (select A k)) (= (select A i) (select A 0))) (or (<= (+ 2 minc) (+ (select A k) (select B k))) (not (< mina (select A i))) (< minb (select B i)) (= (select B i) (select B k)) (= mina (select A k))) (or (= minb (select B k)) (<= (+ 2 minc) (+ (select A k) (select B k))) (< mina (select A i)) (= (select A i) (select A k)) (not (< minb (select B i)))) (or (= minb (select B k)) (<= (+ 2 minc) (+ (select A k) (select B k))) (not (< mina (select A i))) (not (< minb (select B i))) (= mina (select A k))) (or (<= (+ 2 minc) (+ (select A k) (select B k))) (<= (+ (select B 0) 1) (select B k)) (< minb (select B i)) (= (select B i) (select B k))) (or (< mina (select A i)) (not (= (+ (select A 0) (* (select A i) (- 1))) 0)) (< minb (select B i)) (= (select B i) (select B k)) (<= (+ (select B 0) (select A 0)) minc)) (or (= minb (select B k)) (<= (+ 2 minc) (+ (select A k) (select B k))) (<= (+ (select B 0) 1) (select B k)) (not (< minb (select B i)))) (or (= minb (select B k)) (= (select B 0) minb) (not (< minb (select B i)))))] [2022-03-15 21:44:33,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-15 21:44:33,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:33,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-15 21:44:33,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:44:33,709 INFO L87 Difference]: Start difference. First operand 65 states and 201 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:33,904 INFO L93 Difference]: Finished difference Result 140 states and 438 transitions. [2022-03-15 21:44:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-15 21:44:33,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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 21:44:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:33,905 INFO L225 Difference]: With dead ends: 140 [2022-03-15 21:44:33,905 INFO L226 Difference]: Without dead ends: 125 [2022-03-15 21:44:33,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:44:33,906 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:33,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:44:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-15 21:44:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2022-03-15 21:44:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 3.09375) internal successors, (297), 96 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 297 transitions. [2022-03-15 21:44:33,913 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 297 transitions. Word has length 15 [2022-03-15 21:44:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:33,914 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 297 transitions. [2022-03-15 21:44:33,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 297 transitions. [2022-03-15 21:44:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:44:33,915 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:33,915 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:33,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:34,132 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 21:44:34,132 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash -908971991, now seen corresponding path program 2 times [2022-03-15 21:44:34,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:34,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475717899] [2022-03-15 21:44:34,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:34,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:34,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475717899] [2022-03-15 21:44:34,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475717899] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:34,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569737740] [2022-03-15 21:44:34,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:44:34,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:34,191 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 21:44:34,206 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 21:44:34,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:44:34,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:34,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:44:34,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:34,276 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 21:44:34,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:34,310 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 21:44:34,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569737740] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:34,310 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:34,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-03-15 21:44:34,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466857881] [2022-03-15 21:44:34,311 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:34,312 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:34,318 INFO L252 McrAutomatonBuilder]: Finished intersection with 69 states and 138 transitions. [2022-03-15 21:44:34,318 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:34,987 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 11 new interpolants: [1166#(or (<= N i) (< (+ i 1) N)), 1173#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N)), 1171#(or (<= (+ 2 l) N) (< i N)), 1170#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 1165#(< i N), 1169#(or (<= N i) (< (+ i 1) N) (< l N)), 1167#(or (<= N (+ i 1)) (< (+ 2 i) N)), 1174#(or (<= N i) (<= (+ 2 l) N)), 1175#(or (<= N (+ i 1)) (<= (+ 2 l) N)), 1172#(or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N)), 1168#(or (<= (+ l 1) N) (< i N))] [2022-03-15 21:44:34,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-15 21:44:34,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:34,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-15 21:44:34,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2022-03-15 21:44:34,989 INFO L87 Difference]: Start difference. First operand 97 states and 297 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:35,457 INFO L93 Difference]: Finished difference Result 302 states and 972 transitions. [2022-03-15 21:44:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-03-15 21:44:35,457 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 21:44:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:35,459 INFO L225 Difference]: With dead ends: 302 [2022-03-15 21:44:35,459 INFO L226 Difference]: Without dead ends: 285 [2022-03-15 21:44:35,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2022-03-15 21:44:35,460 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:35,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-03-15 21:44:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 148. [2022-03-15 21:44:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 3.4149659863945576) internal successors, (502), 147 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 502 transitions. [2022-03-15 21:44:35,469 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 502 transitions. Word has length 16 [2022-03-15 21:44:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:35,470 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 502 transitions. [2022-03-15 21:44:35,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 502 transitions. [2022-03-15 21:44:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-15 21:44:35,471 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:35,471 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:35,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-15 21:44:35,671 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 21:44:35,672 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:35,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:35,672 INFO L85 PathProgramCache]: Analyzing trace with hash 999603204, now seen corresponding path program 3 times [2022-03-15 21:44:35,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:35,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038673097] [2022-03-15 21:44:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:35,710 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 21:44:35,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:35,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038673097] [2022-03-15 21:44:35,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038673097] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:35,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046882891] [2022-03-15 21:44:35,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:44:35,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:35,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:35,711 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 21:44:35,712 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 21:44:35,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-15 21:44:35,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:35,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:44:35,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:35,760 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 21:44:35,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:35,787 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 21:44:35,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046882891] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:35,788 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:35,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:44:35,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [301697328] [2022-03-15 21:44:35,788 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:35,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:35,794 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 123 transitions. [2022-03-15 21:44:35,794 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:36,188 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [1912#(< i N), 1911#(< k N), 1914#(or (<= N i) (< (+ i 1) N)), 1918#(or (<= N i) (<= i k)), 1917#(or (<= N i) (< (+ i 1) N) (<= N k)), 1915#(or (<= N i) (< (+ i 1) N) (< k N)), 1913#(or (< k N) (< i N)), 1916#(or (<= N k) (< i N))] [2022-03-15 21:44:36,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:44:36,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:36,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:44:36,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-15 21:44:36,189 INFO L87 Difference]: Start difference. First operand 148 states and 502 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 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 21:44:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:36,501 INFO L93 Difference]: Finished difference Result 501 states and 1821 transitions. [2022-03-15 21:44:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-15 21:44:36,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-03-15 21:44:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:36,504 INFO L225 Difference]: With dead ends: 501 [2022-03-15 21:44:36,504 INFO L226 Difference]: Without dead ends: 497 [2022-03-15 21:44:36,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2022-03-15 21:44:36,505 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:36,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2022-03-15 21:44:36,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 360. [2022-03-15 21:44:36,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 3.902506963788301) internal successors, (1401), 359 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 1401 transitions. [2022-03-15 21:44:36,518 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 1401 transitions. Word has length 16 [2022-03-15 21:44:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:36,518 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 1401 transitions. [2022-03-15 21:44:36,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 13 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 21:44:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 1401 transitions. [2022-03-15 21:44:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-15 21:44:36,520 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:36,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:36,537 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 21:44:36,735 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 21:44:36,735 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1641146227, now seen corresponding path program 4 times [2022-03-15 21:44:36,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:36,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604385461] [2022-03-15 21:44:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:36,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:36,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604385461] [2022-03-15 21:44:36,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604385461] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:36,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002285669] [2022-03-15 21:44:36,764 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:44:36,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:36,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:36,771 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 21:44:36,802 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 21:44:36,814 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:44:36,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:36,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-03-15 21:44:36,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:36,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:44:36,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002285669] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:36,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:36,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:44:36,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391897767] [2022-03-15 21:44:36,878 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:36,878 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:36,884 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 148 transitions. [2022-03-15 21:44:36,884 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:37,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [3281#(or (<= N i) (<= i l)), 3275#(< i N), 3277#(or (<= N (+ l 1)) (< i N)), 3279#(or (<= N i) (< (+ i 1) N) (<= N l)), 3278#(or (<= N i) (< (+ i 1) N)), 3280#(or (<= N (+ l 1)) (<= N i) (< (+ i 1) N)), 3276#(or (<= N l) (< i N))] [2022-03-15 21:44:37,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:44:37,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:37,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:44:37,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:44:37,364 INFO L87 Difference]: Start difference. First operand 360 states and 1401 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:37,645 INFO L93 Difference]: Finished difference Result 777 states and 3014 transitions. [2022-03-15 21:44:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:44:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 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 21:44:37,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:37,648 INFO L225 Difference]: With dead ends: 777 [2022-03-15 21:44:37,649 INFO L226 Difference]: Without dead ends: 756 [2022-03-15 21:44:37,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:44:37,649 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:37,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-15 21:44:37,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-03-15 21:44:37,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 560. [2022-03-15 21:44:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 4.041144901610018) internal successors, (2259), 559 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 2259 transitions. [2022-03-15 21:44:37,663 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 2259 transitions. Word has length 17 [2022-03-15 21:44:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:37,663 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 2259 transitions. [2022-03-15 21:44:37,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 2259 transitions. [2022-03-15 21:44:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:44:37,665 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:37,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:37,683 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 21:44:37,865 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 21:44:37,865 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:37,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1638447878, now seen corresponding path program 5 times [2022-03-15 21:44:37,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:37,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153480916] [2022-03-15 21:44:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:37,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:44:37,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:37,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153480916] [2022-03-15 21:44:37,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153480916] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:37,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231381684] [2022-03-15 21:44:37,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:44:37,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:37,930 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 21:44:37,930 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 21:44:37,954 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:44:37,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:37,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:44:37,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:44:37,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:44:38,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231381684] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:38,025 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:38,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-03-15 21:44:38,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1537438493] [2022-03-15 21:44:38,025 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:38,026 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:38,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 91 states and 188 transitions. [2022-03-15 21:44:38,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:38,714 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [5324#(or (<= N i) (<= (+ 2 k) N)), 5322#(or (<= N (+ i 1)) (< (+ 2 i) N)), 5320#(or (< k N) (< i N)), 5319#(or (<= N i) (< (+ i 1) N)), 5318#(< i N), 5323#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 5321#(or (<= N i) (< (+ i 1) N) (< k N)), 5325#(or (<= N (+ i 1)) (<= (+ 2 k) N))] [2022-03-15 21:44:38,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-15 21:44:38,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-15 21:44:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-03-15 21:44:38,715 INFO L87 Difference]: Start difference. First operand 560 states and 2259 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:39,159 INFO L93 Difference]: Finished difference Result 1506 states and 5612 transitions. [2022-03-15 21:44:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-15 21:44:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 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 18 [2022-03-15 21:44:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:39,166 INFO L225 Difference]: With dead ends: 1506 [2022-03-15 21:44:39,166 INFO L226 Difference]: Without dead ends: 1506 [2022-03-15 21:44:39,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:44:39,168 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:39,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:44:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2022-03-15 21:44:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1018. [2022-03-15 21:44:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 4.206489675516224) internal successors, (4278), 1017 states have internal predecessors, (4278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 4278 transitions. [2022-03-15 21:44:39,195 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 4278 transitions. Word has length 18 [2022-03-15 21:44:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:39,195 INFO L470 AbstractCegarLoop]: Abstraction has 1018 states and 4278 transitions. [2022-03-15 21:44:39,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 4278 transitions. [2022-03-15 21:44:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-15 21:44:39,198 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:39,198 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:39,214 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 21:44:39,411 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 21:44:39,411 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1661522460, now seen corresponding path program 6 times [2022-03-15 21:44:39,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:39,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474377134] [2022-03-15 21:44:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:44:39,452 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:39,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474377134] [2022-03-15 21:44:39,452 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474377134] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:39,452 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976629842] [2022-03-15 21:44:39,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:44:39,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:39,453 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 21:44:39,454 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 21:44:39,478 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:44:39,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:44:39,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:44:39,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:44:39,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:44:39,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976629842] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:39,544 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:39,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-03-15 21:44:39,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741389552] [2022-03-15 21:44:39,544 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:39,546 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:39,554 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 193 transitions. [2022-03-15 21:44:39,554 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:44:40,537 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [9014#(or (<= (+ 2 l) N) (<= N l)), 9016#(or (<= (+ 2 l) N) (<= N k) (< (+ k 1) N) (<= N l)), 9013#(or (<= (+ 2 l) N) (< k N)), 9011#(< k N), 9017#(or (<= N (+ k 1)) (<= (+ 2 l) N) (< (+ 2 k) N) (<= N l)), 9015#(or (<= (+ 2 l) N) (< k N) (<= N l)), 9012#(or (< k N) (< l N))] [2022-03-15 21:44:40,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-15 21:44:40,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:44:40,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-15 21:44:40,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-03-15 21:44:40,538 INFO L87 Difference]: Start difference. First operand 1018 states and 4278 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:40,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:44:40,830 INFO L93 Difference]: Finished difference Result 2263 states and 8661 transitions. [2022-03-15 21:44:40,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-15 21:44:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-03-15 21:44:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:44:40,842 INFO L225 Difference]: With dead ends: 2263 [2022-03-15 21:44:40,842 INFO L226 Difference]: Without dead ends: 2230 [2022-03-15 21:44:40,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2022-03-15 21:44:40,843 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:44:40,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-15 21:44:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2022-03-15 21:44:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 1300. [2022-03-15 21:44:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 4.271747498075443) internal successors, (5549), 1299 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 5549 transitions. [2022-03-15 21:44:40,878 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 5549 transitions. Word has length 18 [2022-03-15 21:44:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:44:40,878 INFO L470 AbstractCegarLoop]: Abstraction has 1300 states and 5549 transitions. [2022-03-15 21:44:40,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:44:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 5549 transitions. [2022-03-15 21:44:40,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:44:40,881 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:44:40,881 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:44:40,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-15 21:44:41,097 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 21:44:41,098 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:44:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:44:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash -36923026, now seen corresponding path program 7 times [2022-03-15 21:44:41,099 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:44:41,099 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508085061] [2022-03-15 21:44:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:44:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:44:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:41,818 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 21:44:41,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:44:41,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508085061] [2022-03-15 21:44:41,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508085061] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:44:41,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645262524] [2022-03-15 21:44:41,818 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:44:41,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:44:41,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:44:41,819 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 21:44:41,820 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 21:44:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:44:41,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:44:41,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:44:42,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-03-15 21:44:42,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:44:42,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:44:42,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:44:42,602 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 119 treesize of output 71 [2022-03-15 21:44:42,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:44:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-15 21:44:42,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-15 21:44:42,623 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 166 treesize of output 112 [2022-03-15 21:44:42,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-03-15 21:44:42,996 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 64 treesize of output 48 [2022-03-15 21:44:43,021 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 21:44:43,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:44:43,209 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:44:43,209 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 547 treesize of output 531 [2022-03-15 21:44:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:44:47,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645262524] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:44:47,514 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:44:47,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-03-15 21:44:47,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259401569] [2022-03-15 21:44:47,516 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:44:47,518 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:44:47,528 INFO L252 McrAutomatonBuilder]: Finished intersection with 100 states and 208 transitions. [2022-03-15 21:44:47,528 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:45:46,922 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [14025#(and (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc))), 14029#(and (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (not (< minb (select B i)))) (or (<= (+ mina minb) (select C (+ l 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= (+ mina (select B i)) (select C (+ l 1))) (< minb (select B i))) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< mina (select A i)) (<= (+ (select A i) minb) (select C (+ l 1))) (not (< minb (select B i)))) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (<= (+ (select A i) (select B i)) (select C (+ l 1))) (< mina (select A i)) (< minb (select B i))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (select C l)))), 14030#(and (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C (+ l 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C (+ l 1))) (< mina (select A (+ i 1)))) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (< minb (select B i)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) (select C l))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (select C (+ l 1)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) (select C l)) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C (+ l 1))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C (+ l 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (+ (select A i) (select B (+ i 1))) (select C (+ l 1))) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (< minb (select B i)))) (or (<= (+ (select A i) (select B i)) (select C (+ l 1))) (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1))))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select A i) (select B (+ i 1))) (select C (+ l 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) minc)) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C (+ l 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ mina minb) (select C (+ l 1))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (select C (+ l 1))) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i))) (or (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) (select C l))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (< minb (select B i)))) (or (<= (+ mina (select B i)) (select C (+ l 1))) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ minb (select A (+ i 1))) (select C (+ l 1)))) (or (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C (+ l 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (<= (+ (select B i) (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C (+ l 1))) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) (select C (+ l 1))) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))))), 14032#(and (= l 1) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (= l k) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select B 2) (select A 2)))) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select A (+ k 1)) (select B (+ k 1))))) (or (<= (select A i) mina) (<= (+ mina minb) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select B i) minb)) (or (<= (select A i) mina) (<= (+ mina minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= (+ (select A i) minb) (+ (select B 2) (select A 2))) (< mina (select A i)) (<= (select B i) minb))), 14034#(and (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (= l 1) (or (< minb (select B (+ i 1))) (and (= l k) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (< mina (select A i)) (<= (+ (select A i) (select B i)) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (= l k) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k)))) (or (< mina (select A i)) (<= (+ (select B i) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (and (= l k) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) minc)) (or (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select B 2) (select A 2))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)))) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A (+ k 1)) (select B (+ k 1)))) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select B (+ i 1)) (select B i))) (or (and (= l k) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) mina) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (not (< minb (select B (+ i 1)))) (<= (+ mina minb) (+ (select A (+ k 1)) (select B (+ k 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i)))) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select B 2) (select A 2))) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (+ (select B 2) (select A 2))) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i))) (or (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select A (+ i 1)) (select A i)) (not (< minb (select B i)))) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (<= (+ (select B (+ i 1)) mina) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (< mina (select A i)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)))) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (< minb (select B i)))) (or (<= (+ (select B i) (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (not (< mina (select A i))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (<= (+ (select B i) (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1)))) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A (+ k 1)) (select B (+ k 1))))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) (+ (select A k) (select B k)))) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (<= (select B (+ i 1)) minb) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (< minb (select B (+ i 1))) (and (= l k) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))))), 14027#(and (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (not (< minb (select B i)))) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (select C l)))), 14028#(and (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (< minb (select B i)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) (select C l))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) (select C l)) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) minc)) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i))) (or (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) (select C l))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (< minb (select B i)))) (or (<= (+ (select B i) (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))))), 14033#(and (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i))) (or (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) (select C l))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k)))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (< minb (select B i))) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) (select C l)) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (and (<= (+ (select A i) (select B (+ i 1))) (select C l)) (not (= l k))) (<= (select A (+ i 1)) (select A i)) (not (< minb (select B i)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) minc)) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) (select C l))) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (< minb (select B i)))) (= (+ l 1) k) (or (<= (+ (select B i) (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (and (not (= l k)) (<= (+ (select B (+ i 1)) mina) (select C l))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (< mina (select A i)) (and (<= (+ (select A i) (select B (+ i 1))) (select C l)) (not (= l k))) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) (+ (select A k) (select B k)))) (or (<= (select A (+ i 1)) mina) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i)))) (or (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (< mina (select A i))) (and (not (= l k)) (<= (+ (select B (+ i 1)) mina) (select C l))) (not (< minb (select B i))))), 14026#(and (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (< mina (select A i))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< minb (select B i))) (< mina (select A (+ i 1)))) (or (< mina (select A i)) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (not (< (select A i) (select A (+ i 1)))) (<= (+ (select A i) (select B i)) minc)) (or (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (< mina (select A i)) (not (< (select A i) (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i)))) (or (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i))) (or (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (not (< mina (select A (+ i 1)))) (< minb (select B i))) (or (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (< minb (select B i)))) (or (<= (+ (select B i) (select A (+ i 1))) minc) (not (< mina (select A i))) (not (< (select B i) (select B (+ i 1)))) (< minb (select B i)) (< mina (select A (+ i 1)))) (or (not (< minb (select B (+ i 1)))) (not (< mina (select A i))) (not (< mina (select A (+ i 1)))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< minb (select B (+ i 1))) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))))), 14031#(and (or (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (<= (select B i) minb)) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< mina (select A i)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= (+ mina (select B i)) minc) (< minb (select B i))) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (not (< minb (select B i)))) (or (<= (select A i) mina) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (= (+ l 1) k) (or (<= (select A i) mina) (<= (+ mina minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (select C l))))] [2022-03-15 21:45:46,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-15 21:45:46,925 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:45:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-15 21:45:46,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:45:46,926 INFO L87 Difference]: Start difference. First operand 1300 states and 5549 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:45:49,284 INFO L93 Difference]: Finished difference Result 2254 states and 9170 transitions. [2022-03-15 21:45:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-15 21:45:49,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 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 19 [2022-03-15 21:45:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:45:49,297 INFO L225 Difference]: With dead ends: 2254 [2022-03-15 21:45:49,297 INFO L226 Difference]: Without dead ends: 2158 [2022-03-15 21:45:49,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 59 SyntacticMatches, 38 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2022-03-15 21:45:49,298 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-15 21:45:49,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-15 21:45:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2022-03-15 21:45:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1436. [2022-03-15 21:45:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 4.188153310104529) internal successors, (6010), 1435 states have internal predecessors, (6010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 6010 transitions. [2022-03-15 21:45:49,338 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 6010 transitions. Word has length 19 [2022-03-15 21:45:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:45:49,339 INFO L470 AbstractCegarLoop]: Abstraction has 1436 states and 6010 transitions. [2022-03-15 21:45:49,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 18 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:45:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 6010 transitions. [2022-03-15 21:45:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:45:49,344 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:45:49,344 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:45:49,375 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 21:45:49,561 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 21:45:49,562 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:45:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:45:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 947762348, now seen corresponding path program 8 times [2022-03-15 21:45:49,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:45:49,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935264557] [2022-03-15 21:45:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:45:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:45:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:46:05,837 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 21:46:05,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:46:05,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935264557] [2022-03-15 21:46:05,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935264557] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:46:05,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97866226] [2022-03-15 21:46:05,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:46:05,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:46:05,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:46:05,838 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 21:46:05,839 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 21:46:05,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:46:05,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:46:05,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-15 21:46:05,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:46:06,423 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-03-15 21:46:06,722 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 104 treesize of output 70 [2022-03-15 21:46:06,727 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 153 treesize of output 113 [2022-03-15 21:46:06,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2022-03-15 21:46:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2022-03-15 21:46:07,070 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 21:46:07,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:46:07,228 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-03-15 21:46:07,228 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 114 treesize of output 108 [2022-03-15 21:46:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-15 21:46:11,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97866226] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:46:11,067 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:46:11,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2022-03-15 21:46:11,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566641951] [2022-03-15 21:46:11,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:46:11,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:46:11,076 INFO L252 McrAutomatonBuilder]: Finished intersection with 80 states and 154 transitions. [2022-03-15 21:46:11,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:47:14,561 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 25 new interpolants: [19304#(and (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)))), 19315#(and (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< k N) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< k N) (< minb (select B i))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< k N) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< k N) (not (< minb (select B i))) (<= (+ (select A i) minb) minc))), 19311#(and (or (< k N) (< i N) (<= (+ mina minb) (select C l))) (or (< k N) (<= (+ mina minb) minc) (< i N))), 19305#(and (or (<= (+ mina minb) minc) (< i N)) (or (< i N) (<= (+ mina minb) (select C l)))), 19306#(and (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (select C l))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (<= (+ mina (select B i)) (select C l))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (select C l)) (not (< minb (select B i)))) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< minb (select B i))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l)))), 19319#(and (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (not (= 2 k)) (<= (+ mina minb) (select C l))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (not (= 2 k)) (<= (+ mina (select B i)) (select C l))) (or (<= N i) (< (+ i 1) N) (= k p)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc) (not (= 2 k))) (or (<= N i) (< (+ i 1) N) (<= N 3)) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< minb (select B i)) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k))) (not (= 2 k))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (+ (select A k) (select B k))) (not (= 2 k))) (or (= l 1) (<= N i) (< (+ i 1) N)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (not (= 2 k)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (not (< minb (select B i))) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l)) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (select C l)) (not (< minb (select B i))) (not (= 2 k)))), 19314#(and (or (= (+ (* (- 1) k) p) 0) (< i N)) (or (not (= 2 k)) (< i N) (<= (+ mina minb) (select C l))) (or (<= (+ mina minb) minc) (not (= 2 k)) (< i N)) (or (<= (+ mina minb) (+ (select A k) (select B k))) (not (= 2 k)) (< i N)) (or (= l 1) (< i N)) (or (< i N) (<= N 3))), 19302#(or (<= (+ mina minb) minc) (< i N)), 19316#(and (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< k N) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< k N) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< k N) (< minb (select B i))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< k N) (not (< minb (select B i))) (<= (+ mina minb) (select C l))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (select C l)) (< k N) (not (< minb (select B i)))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< k N) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< k N) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< k N) (< minb (select B i)) (<= (+ mina (select B i)) (select C l)))), 19322#(and (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) (+ (select A k) (select B k))) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= l k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A (+ i 1))) (not (= l k)) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= l k)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (= l k)) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k))) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= l k)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (= l k)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= l k))) (or (<= N (+ i 1)) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= l k))) (or (<= N (+ i 1)) (< k (+ l 1)) (<= N (+ l 1)) (< (+ 2 i) N)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< (+ 2 i) N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (not (= l k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (not (= l k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k))) (not (= l k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (<= (select A (+ i 1)) (select A i)) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (not (= l k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) minc) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1))) (not (= l k)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (not (= l k)) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (not (= l k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= l k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= l k)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= l k)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (= l k)) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (= l k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= l k)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= l k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k))) (not (= l k)))), 19308#(or (< k N) (<= (+ mina minb) minc)), 19321#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) (select C l)) (< k N) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< k N) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< k N) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< k N) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (< k N) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (< k N) (<= (+ mina minb) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (< k N) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (< k N) (<= (+ mina minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (+ (select B i) (select A (+ i 1))) minc) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (< k N) (<= (+ (select B (+ i 1)) mina) (select C l)) (<= (select B i) minb))), 19317#(and (or (<= N i) (< (+ i 1) N) (<= l k)) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc) (not (= l k))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (+ (select A k) (select B k))) (not (= l k))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (not (= l k)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< minb (select B i)) (not (= l k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (not (< minb (select B i))) (not (= l k))) (or (< k (+ l 1)) (<= N (+ l 1)) (<= N i) (< (+ i 1) N)) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k))) (not (= l k))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc) (not (= l k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (not (= l k)) (<= (+ (select A i) (select B i)) minc))), 19312#(and (or (<= l k) (< i N)) (or (<= (+ mina minb) minc) (not (= l k)) (< i N)) (or (<= (+ mina minb) (+ (select A k) (select B k))) (not (= l k)) (< i N)) (or (< k (+ l 1)) (<= N (+ l 1)) (< i N))), 19324#(and (or (<= N (+ i 1)) (= l 1) (< (+ 2 i) N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (<= (select A (+ i 1)) (select A i)) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< (+ 2 i) N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (not (= 2 k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (select C l)) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= 2 k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= 2 k)) (<= (+ mina (select B i)) (select C l))) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (not (= 2 k)) (<= (+ mina minb) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (<= (select A (+ i 1)) (select A i)) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= 2 k)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= 2 k)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (not (= 2 k)) (<= (+ (select B (+ i 1)) mina) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) (+ (select A k) (select B k))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k)) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (= k p)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc) (not (= 2 k))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k))) (not (= 2 k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= N 3)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (not (= 2 k))) (or (<= N (+ i 1)) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (not (= 2 k))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) minc) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (not (= 2 k)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) (select C l)) (< mina (select A (+ i 1))) (not (= 2 k)) (<= (select B i) minb))), 19325#(and (or (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select B 2) (select A 2)))) (or (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (not (< i N)) (<= (+ mina minb) (+ (select B 2) (select A 2))) (not (< mina (select A i))) (not (< minb (select B i)))) (or (= l 1) (<= N i)) (or (<= (+ (select A i) minb) (+ (select B 2) (select A 2))) (< mina (select A i)) (not (< i N)) (not (< minb (select B i)))) (or (<= N i) (<= i 2)) (or (= l k) (<= N i)) (or (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< minb (select B i))) (or (<= N i) (< mina (select A i)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select B 2) (select A 2)))) (or (<= N i) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= (select A i) mina) (<= N i) (<= (+ mina minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (< mina (select A i)) (not (< i N)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (<= (select A i) mina) (<= N i) (< minb (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k))))), 19320#(and (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< k N) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< k N) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (< k N) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< k N) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (< k N) (<= (+ mina minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (+ (select B i) (select A (+ i 1))) minc) (< k N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< k N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc))), 19303#(and (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc)) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< minb (select B i))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc))), 19318#(and (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (not (= 2 k)) (<= (+ mina minb) (select C l))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (not (= 2 k)) (<= (+ mina (select B i)) (select C l))) (or (<= N i) (< (+ i 1) N) (<= (+ l 1) k)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) minc) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (not (< minb (select B i))) (<= (+ (select A i) minb) minc) (not (= 2 k))) (or (<= N i) (< (+ i 1) N) (<= N 3)) (or (< (+ i 1) N) (not (< i N)) (<= (+ mina (select B i)) minc) (not (< mina (select A i))) (< minb (select B i)) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) minc) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k))) (not (= 2 k))) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (not (< minb (select B i))) (<= (+ mina minb) (+ (select A k) (select B k))) (not (= 2 k))) (or (= l 1) (<= N i) (< (+ i 1) N)) (or (< (+ i 1) N) (not (< i N)) (not (< mina (select A i))) (< minb (select B i)) (not (= 2 k)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (not (< minb (select B i))) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (< minb (select B i)) (<= (+ (select A i) (select B i)) (select C l)) (not (= 2 k))) (or (< (+ i 1) N) (< mina (select A i)) (not (< i N)) (<= (+ (select A i) minb) (select C l)) (not (< minb (select B i))) (not (= 2 k)))), 19309#(and (or (< k N) (<= (+ mina minb) (select C l))) (or (< k N) (<= (+ mina minb) minc))), 19307#(and (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) (select C l)) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb))), 19313#(and (or (not (= 2 k)) (< i N) (<= (+ mina minb) (select C l))) (or (<= (+ mina minb) minc) (not (= 2 k)) (< i N)) (or (<= (+ mina minb) (+ (select A k) (select B k))) (not (= 2 k)) (< i N)) (or (<= (+ l 1) k) (< i N)) (or (= l 1) (< i N)) (or (< i N) (<= N 3))), 19323#(and (or (<= N (+ i 1)) (= l 1) (< (+ 2 i) N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (<= (+ mina (select B i)) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (< mina (select A i)) (<= (+ (select A i) minb) (select C l)) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (<= (+ minb (select A (+ i 1))) (select C l)) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (<= (+ mina minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (not (= (+ l 1) k)) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ l 1) k)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) (select C l))) (or (<= N (+ i 1)) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ (select A i) (select B (+ i 1))) (select C l)) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (not (= (+ l 1) k)) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (select C l)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (<= (+ mina minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (select C l))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= N 3)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (not (= (+ l 1) k)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< (+ 2 i) N) (not (= (+ l 1) k)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (not (= (+ l 1) k)) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (<= (+ mina minb) (select C l)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< (+ 2 i) N) (<= (select A (+ i 1)) mina) (not (= (+ l 1) k)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= (select B (+ i 1)) minb) (not (= (+ l 1) k)) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (select C l)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb))), 19310#(or (< k N) (<= (+ mina minb) minc) (< i N)), 19326#(and (or (<= N (+ i 1)) (< mina (select A i)) (<= (+ (select B i) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (<= i 1)) (or (<= N (+ i 1)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select A i) (select B (+ i 1))) (+ (select B 2) (select A 2)))) (or (<= N (+ i 1)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ (select A i) minb) (+ (select A k) (select B k))) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) (+ (select B 2) (select A 2)))) (or (<= N (+ i 1)) (<= (select B (+ i 1)) minb) (<= (+ (select A i) minb) (+ (select B 2) (select A 2))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B i) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select B 2) (select A 2))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ (select A i) (select B i)) minc)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select B (+ i 1)) minb) (< mina (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (+ minb (select A (+ i 1))) (+ (select B 2) (select A 2))) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (<= (+ mina (select B i)) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i))) (or (<= N (+ i 1)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc)) (or (<= N (+ i 1)) (<= (select B (+ i 1)) minb) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (+ minb (select A (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< minb (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B i) (select A (+ i 1))) (+ (select A k) (select B k))) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) (+ (select B 2) (select A 2))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (+ (select B 2) (select A 2)))) (or (<= N (+ i 1)) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select B 2) (select A 2))) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select B (+ i 1)) minb) (<= (select A (+ i 1)) mina) (<= (+ mina minb) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) minc) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (<= (+ (select B (+ i 1)) mina) (+ (select B 2) (select A 2))) (< minb (select B i)) (< (select B i) (select B (+ i 1)))) (or (<= N (+ i 1)) (<= (select A i) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) (+ (select B 2) (select A 2))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (< mina (select A (+ i 1))) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (< minb (select B i)) (< (select B i) (select B (+ i 1))) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) (+ (select B 2) (select A 2))) (< mina (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (< minb (select B (+ i 1))) (<= (+ (select B (+ i 1)) mina) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (+ (select B i) (select A (+ i 1))) minc) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (< mina (select A (+ i 1)))) (or (<= N (+ i 1)) (< minb (select B (+ i 1))) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb) (<= (+ (select B (+ i 1)) (select A (+ i 1))) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (= l k)) (or (<= N (+ i 1)) (<= (select B (+ i 1)) minb) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) minb) minc) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select A (+ i 1)) mina) (< minb (select B i)) (<= (select B (+ i 1)) (select B i)) (<= (+ mina (select B i)) (+ (select A k) (select B k)))) (or (<= N (+ i 1)) (= l 1)) (or (<= N (+ i 1)) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A i)) (< (select A i) (select A (+ i 1))) (<= (select B i) minb)) (or (<= N (+ i 1)) (< minb (select B (+ i 1))) (< mina (select A i)) (<= (select A (+ i 1)) (select A i)) (<= (+ (select A i) (select B (+ i 1))) (+ (select A k) (select B k))) (<= (select B i) minb)) (or (<= N (+ i 1)) (<= (select A i) mina) (<= (select B (+ i 1)) minb) (<= (+ minb (select A (+ i 1))) minc) (< mina (select A (+ i 1))) (<= (select B i) minb)))] [2022-03-15 21:47:14,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-03-15 21:47:14,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:47:14,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-03-15 21:47:14,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1720, Unknown=0, NotChecked=0, Total=2070 [2022-03-15 21:47:14,563 INFO L87 Difference]: Start difference. First operand 1436 states and 6010 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:04,067 INFO L93 Difference]: Finished difference Result 3546 states and 12709 transitions. [2022-03-15 21:48:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-15 21:48:04,067 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-03-15 21:48:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:04,083 INFO L225 Difference]: With dead ends: 3546 [2022-03-15 21:48:04,083 INFO L226 Difference]: Without dead ends: 3429 [2022-03-15 21:48:04,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7759 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=4210, Invalid=16382, Unknown=0, NotChecked=0, Total=20592 [2022-03-15 21:48:04,096 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1355 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:04,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1355 Valid, 0 Invalid, 2276 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [453 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-03-15 21:48:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3429 states. [2022-03-15 21:48:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3429 to 1576. [2022-03-15 21:48:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 4.171428571428572) internal successors, (6570), 1575 states have internal predecessors, (6570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 6570 transitions. [2022-03-15 21:48:04,146 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 6570 transitions. Word has length 19 [2022-03-15 21:48:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:04,147 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 6570 transitions. [2022-03-15 21:48:04,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 35 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 6570 transitions. [2022-03-15 21:48:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-15 21:48:04,150 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:04,150 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:04,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-15 21:48:04,363 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 21:48:04,363 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1936481736, now seen corresponding path program 9 times [2022-03-15 21:48:04,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:04,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369312929] [2022-03-15 21:48:04,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:48:04,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:04,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369312929] [2022-03-15 21:48:04,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369312929] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:04,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164186175] [2022-03-15 21:48:04,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:48:04,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:04,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:04,406 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 21:48:04,407 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 21:48:04,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:48:04,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:04,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-15 21:48:04,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:48:04,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-15 21:48:04,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164186175] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-15 21:48:04,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-15 21:48:04,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-03-15 21:48:04,479 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2120444431] [2022-03-15 21:48:04,479 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:04,480 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:04,487 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 136 transitions. [2022-03-15 21:48:04,488 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:04,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2022-03-15 21:48:04,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-15 21:48:04,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-15 21:48:04,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-03-15 21:48:04,729 INFO L87 Difference]: Start difference. First operand 1576 states and 6570 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:04,768 INFO L93 Difference]: Finished difference Result 1455 states and 5928 transitions. [2022-03-15 21:48:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-15 21:48:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 19 [2022-03-15 21:48:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:04,774 INFO L225 Difference]: With dead ends: 1455 [2022-03-15 21:48:04,774 INFO L226 Difference]: Without dead ends: 1407 [2022-03-15 21:48:04,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-03-15 21:48:04,775 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:04,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-15 21:48:04,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2022-03-15 21:48:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1366. [2022-03-15 21:48:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1365 states have (on average 4.167765567765568) internal successors, (5689), 1365 states have internal predecessors, (5689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 5689 transitions. [2022-03-15 21:48:04,798 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 5689 transitions. Word has length 19 [2022-03-15 21:48:04,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:04,798 INFO L470 AbstractCegarLoop]: Abstraction has 1366 states and 5689 transitions. [2022-03-15 21:48:04,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:04,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 5689 transitions. [2022-03-15 21:48:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:48:04,801 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:04,801 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:04,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-15 21:48:05,017 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 21:48:05,017 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:05,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1763822707, now seen corresponding path program 10 times [2022-03-15 21:48:05,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:05,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305779386] [2022-03-15 21:48:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:05,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:05,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305779386] [2022-03-15 21:48:05,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305779386] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:05,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444667409] [2022-03-15 21:48:05,053 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-15 21:48:05,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:05,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:05,079 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 21:48:05,097 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 21:48:05,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-15 21:48:05,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:05,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:48:05,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:05,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:05,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444667409] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:05,187 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:05,187 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:48:05,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1826608251] [2022-03-15 21:48:05,187 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:05,188 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:05,198 INFO L252 McrAutomatonBuilder]: Finished intersection with 95 states and 187 transitions. [2022-03-15 21:48:05,198 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:06,002 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [30598#(< i N), 30604#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 30611#(or (<= N (+ i 1)) (<= (+ 3 k) N)), 30600#(or (<= N (+ i 1)) (< (+ 2 i) N)), 30602#(or (<= N i) (< (+ i 1) N) (< k N)), 30612#(or (<= (+ 3 k) N) (<= N (+ 2 i))), 30599#(or (<= N i) (< (+ i 1) N)), 30603#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 30607#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N)), 30605#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 30601#(or (< k N) (< i N)), 30608#(or (<= (+ 3 k) N) (<= N i)), 30606#(or (<= (+ 2 k) N) (< i N)), 30609#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 30610#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N))] [2022-03-15 21:48:06,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:48:06,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:48:06,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2022-03-15 21:48:06,003 INFO L87 Difference]: Start difference. First operand 1366 states and 5689 transitions. Second operand has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 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 21:48:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:07,011 INFO L93 Difference]: Finished difference Result 4436 states and 17765 transitions. [2022-03-15 21:48:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-03-15 21:48:07,011 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 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 20 [2022-03-15 21:48:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:07,025 INFO L225 Difference]: With dead ends: 4436 [2022-03-15 21:48:07,025 INFO L226 Difference]: Without dead ends: 4436 [2022-03-15 21:48:07,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1054, Invalid=2978, Unknown=0, NotChecked=0, Total=4032 [2022-03-15 21:48:07,026 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 295 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:07,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 0 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:48:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2022-03-15 21:48:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 2947. [2022-03-15 21:48:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2946 states have (on average 4.406313645621181) internal successors, (12981), 2946 states have internal predecessors, (12981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 12981 transitions. [2022-03-15 21:48:07,100 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 12981 transitions. Word has length 20 [2022-03-15 21:48:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:07,100 INFO L470 AbstractCegarLoop]: Abstraction has 2947 states and 12981 transitions. [2022-03-15 21:48:07,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.173913043478261) internal successors, (96), 22 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 21:48:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 12981 transitions. [2022-03-15 21:48:07,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-15 21:48:07,107 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:07,107 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:07,124 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 21:48:07,323 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 21:48:07,323 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:07,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1929260166, now seen corresponding path program 11 times [2022-03-15 21:48:07,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:07,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378835414] [2022-03-15 21:48:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-15 21:48:07,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:07,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378835414] [2022-03-15 21:48:07,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378835414] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:07,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578931114] [2022-03-15 21:48:07,357 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-15 21:48:07,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:07,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:07,359 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 21:48:07,360 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 21:48:07,387 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-03-15 21:48:07,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:07,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-15 21:48:07,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:48:07,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:48:07,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578931114] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:07,449 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:07,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-03-15 21:48:07,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778122490] [2022-03-15 21:48:07,449 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:07,451 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:07,462 INFO L252 McrAutomatonBuilder]: Finished intersection with 109 states and 228 transitions. [2022-03-15 21:48:07,462 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:08,294 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 15 new interpolants: [41156#(or (<= N i) (< (+ i 1) N) (< k N)), 41162#(or (<= N i) (<= i (+ k 1))), 41153#(or (< k N) (< i N)), 41155#(or (<= N i) (< (+ i 1) N)), 41157#(or (<= N (+ i 1)) (< (+ 2 i) N)), 41165#(or (<= N (+ i 1)) (<= i k)), 41154#(or (<= N k) (< i N)), 41163#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N k)), 41158#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 41164#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 i) N)), 41159#(or (<= N i) (< (+ i 1) N) (<= N k)), 41151#(< k N), 41152#(< i N), 41160#(or (<= N (+ k 1)) (< i N)), 41161#(or (<= N (+ k 1)) (<= N i) (< (+ i 1) N))] [2022-03-15 21:48:08,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-15 21:48:08,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:08,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-15 21:48:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2022-03-15 21:48:08,295 INFO L87 Difference]: Start difference. First operand 2947 states and 12981 transitions. Second operand has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:09,359 INFO L93 Difference]: Finished difference Result 6743 states and 28437 transitions. [2022-03-15 21:48:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-03-15 21:48:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 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 20 [2022-03-15 21:48:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:09,384 INFO L225 Difference]: With dead ends: 6743 [2022-03-15 21:48:09,384 INFO L226 Difference]: Without dead ends: 6693 [2022-03-15 21:48:09,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=868, Invalid=3422, Unknown=0, NotChecked=0, Total=4290 [2022-03-15 21:48:09,386 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 399 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:09,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 0 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-15 21:48:09,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6693 states. [2022-03-15 21:48:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6693 to 4068. [2022-03-15 21:48:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4068 states, 4067 states have (on average 4.50061470371281) internal successors, (18304), 4067 states have internal predecessors, (18304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 18304 transitions. [2022-03-15 21:48:09,560 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 18304 transitions. Word has length 20 [2022-03-15 21:48:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:09,562 INFO L470 AbstractCegarLoop]: Abstraction has 4068 states and 18304 transitions. [2022-03-15 21:48:09,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.130434782608695) internal successors, (95), 22 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 18304 transitions. [2022-03-15 21:48:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:48:09,573 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:09,573 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:09,605 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 21:48:09,806 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 21:48:09,806 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1893774483, now seen corresponding path program 12 times [2022-03-15 21:48:09,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:09,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555388614] [2022-03-15 21:48:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:48:09,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:09,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555388614] [2022-03-15 21:48:09,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555388614] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:09,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595807918] [2022-03-15 21:48:09,840 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-03-15 21:48:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:09,841 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 21:48:09,842 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 21:48:09,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-03-15 21:48:09,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:09,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:48:09,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:09,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:48:09,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-15 21:48:09,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595807918] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:09,936 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:09,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-03-15 21:48:09,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623141310] [2022-03-15 21:48:09,936 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:09,937 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:09,952 INFO L252 McrAutomatonBuilder]: Finished intersection with 130 states and 278 transitions. [2022-03-15 21:48:09,952 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:10,933 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 19 new interpolants: [56260#(or (<= N i) (<= (+ 3 l) N)), 56266#(or (<= N (+ 2 i)) (<= (+ 3 l) N)), 56254#(or (<= N i) (< (+ i 1) N) (<= (+ 2 l) N)), 56250#(or (<= (+ 2 l) N) (< i N)), 56265#(or (<= N (+ 2 i)) (< (+ 3 i) N) (<= (+ 3 l) N)), 56249#(or (<= (+ l 1) N) (< i N)), 56257#(or (<= N (+ i 1)) (< (+ 2 i) N) (< l N)), 56263#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< l N)), 56256#(or (<= N (+ i 1)) (< (+ 2 i) N)), 56262#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 56264#(or (<= N (+ 2 i)) (<= (+ 2 l) N) (< (+ 3 i) N)), 56248#(< i N), 56255#(or (<= N i) (< (+ i 1) N) (<= (+ 3 l) N)), 56259#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 3 l) N)), 56261#(or (<= N (+ i 1)) (<= (+ 3 l) N)), 56253#(or (<= N i) (< (+ i 1) N) (< l N)), 56251#(or (<= (+ 3 l) N) (< i N)), 56258#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 l) N)), 56252#(or (<= N i) (< (+ i 1) N))] [2022-03-15 21:48:10,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-15 21:48:10,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-15 21:48:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2022-03-15 21:48:10,935 INFO L87 Difference]: Start difference. First operand 4068 states and 18304 transitions. Second operand has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:11,896 INFO L93 Difference]: Finished difference Result 14148 states and 63145 transitions. [2022-03-15 21:48:11,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-03-15 21:48:11,896 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 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 21 [2022-03-15 21:48:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:11,963 INFO L225 Difference]: With dead ends: 14148 [2022-03-15 21:48:11,964 INFO L226 Difference]: Without dead ends: 14148 [2022-03-15 21:48:11,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1824 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2022-03-15 21:48:11,967 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 353 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:11,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 0 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-15 21:48:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14148 states. [2022-03-15 21:48:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14148 to 7665. [2022-03-15 21:48:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7665 states, 7664 states have (on average 4.72625260960334) internal successors, (36222), 7664 states have internal predecessors, (36222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7665 states to 7665 states and 36222 transitions. [2022-03-15 21:48:12,216 INFO L78 Accepts]: Start accepts. Automaton has 7665 states and 36222 transitions. Word has length 21 [2022-03-15 21:48:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:12,216 INFO L470 AbstractCegarLoop]: Abstraction has 7665 states and 36222 transitions. [2022-03-15 21:48:12,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.740740740740741) internal successors, (101), 26 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7665 states and 36222 transitions. [2022-03-15 21:48:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:48:12,240 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:12,240 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:12,256 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 21:48:12,455 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 21:48:12,456 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:12,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:12,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1118015233, now seen corresponding path program 13 times [2022-03-15 21:48:12,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:12,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585589411] [2022-03-15 21:48:12,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:12,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:12,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585589411] [2022-03-15 21:48:12,508 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585589411] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:12,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138330472] [2022-03-15 21:48:12,508 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-03-15 21:48:12,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:12,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:12,510 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 21:48:12,523 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 21:48:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:12,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:48:12,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:48:12,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-15 21:48:12,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138330472] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:12,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:12,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 12 [2022-03-15 21:48:12,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693320172] [2022-03-15 21:48:12,624 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:12,626 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:12,638 INFO L252 McrAutomatonBuilder]: Finished intersection with 122 states and 258 transitions. [2022-03-15 21:48:12,638 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:13,855 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 36 new interpolants: [85983#(or (<= N i) (< (+ i 1) N) (<= p (+ 2 l))), 85980#(or (<= p (+ 2 l)) (< i N)), 86011#(or (<= N (+ i 1)) (<= i l)), 85992#(or (<= N i) (< (+ i 1) N) (< k N)), 86002#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= p (+ 2 l))), 86010#(or (<= N i) (<= i (+ l 1))), 86004#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N) (<= p l)), 85999#(or (<= N (+ i 1)) (< (+ 2 i) N)), 85993#(or (<= N i) (< (+ i 1) N) (< k N) (<= p l)), 85977#(or (<= N i) (< (+ i 1) N)), 85976#(< i N), 85981#(or (<= N i) (< (+ i 1) N) (<= p l)), 86006#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= p (+ 2 l)) (< k N)), 86007#(and (or (<= N (+ i 1)) (= (+ k (* (- 1) p)) 0) (< (+ 2 i) N)) (or (<= N (+ i 1)) (< (+ 2 i) N) (<= k (+ 2 l)))), 85988#(or (< k N) (<= p l) (< i N)), 85997#(and (or (<= N i) (< (+ i 1) N) (<= k (+ 2 l))) (or (= (+ k (* (- 1) p)) 0) (<= N i) (< (+ i 1) N))), 85978#(or (<= p l) (< i N)), 85998#(or (<= N (+ 2 l)) (< i N)), 86009#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= N (+ 2 l))), 85987#(or (< k N) (< i N)), 85979#(or (<= p (+ l 1)) (< i N)), 85990#(or (<= p (+ 2 l)) (< k N)), 86000#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= p l)), 85994#(or (<= N i) (< (+ i 1) N) (<= p (+ l 1)) (< k N)), 86005#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= p (+ l 1)) (< k N)), 86008#(or (<= N i) (< (+ i 1) N) (<= N (+ 2 l))), 85991#(or (<= p (+ 2 l)) (< k N) (< i N)), 85989#(or (<= p (+ l 1)) (< k N) (< i N)), 85984#(< k N), 85996#(and (or (<= k (+ 2 l)) (< i N)) (or (= (+ k (* (- 1) p)) 0) (< i N))), 85985#(or (< k N) (<= p l)), 85986#(or (<= p (+ l 1)) (< k N)), 86001#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= p (+ l 1))), 86003#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 85995#(or (<= N i) (< (+ i 1) N) (<= p (+ 2 l)) (< k N)), 85982#(or (<= N i) (< (+ i 1) N) (<= p (+ l 1)))] [2022-03-15 21:48:13,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-03-15 21:48:13,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-03-15 21:48:13,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2047, Unknown=0, NotChecked=0, Total=2352 [2022-03-15 21:48:13,858 INFO L87 Difference]: Start difference. First operand 7665 states and 36222 transitions. Second operand has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:21,401 INFO L93 Difference]: Finished difference Result 38918 states and 172345 transitions. [2022-03-15 21:48:21,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2022-03-15 21:48:21,401 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 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 21 [2022-03-15 21:48:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:21,538 INFO L225 Difference]: With dead ends: 38918 [2022-03-15 21:48:21,538 INFO L226 Difference]: Without dead ends: 37978 [2022-03-15 21:48:21,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36213 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=17489, Invalid=74017, Unknown=0, NotChecked=0, Total=91506 [2022-03-15 21:48:21,545 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 1619 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 800 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 800 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:21,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1619 Valid, 0 Invalid, 2796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [800 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-15 21:48:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37978 states. [2022-03-15 21:48:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37978 to 20162. [2022-03-15 21:48:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20162 states, 20161 states have (on average 4.974406031446853) internal successors, (100289), 20161 states have internal predecessors, (100289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20162 states to 20162 states and 100289 transitions. [2022-03-15 21:48:22,546 INFO L78 Accepts]: Start accepts. Automaton has 20162 states and 100289 transitions. Word has length 21 [2022-03-15 21:48:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:22,546 INFO L470 AbstractCegarLoop]: Abstraction has 20162 states and 100289 transitions. [2022-03-15 21:48:22,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.391304347826087) internal successors, (156), 45 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 20162 states and 100289 transitions. [2022-03-15 21:48:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-15 21:48:22,677 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:22,678 INFO L514 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:22,693 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 21:48:22,890 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 21:48:22,890 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:22,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1900671642, now seen corresponding path program 14 times [2022-03-15 21:48:22,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:22,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22751584] [2022-03-15 21:48:22,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:22,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:22,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:22,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22751584] [2022-03-15 21:48:22,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22751584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:22,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955696317] [2022-03-15 21:48:22,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-15 21:48:22,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:22,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:22,996 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 21:48:23,050 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 21:48:23,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-15 21:48:23,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:23,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-15 21:48:23,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:48:23,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-15 21:48:23,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955696317] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:23,156 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:23,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 15 [2022-03-15 21:48:23,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2019519786] [2022-03-15 21:48:23,157 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:23,159 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:23,224 INFO L252 McrAutomatonBuilder]: Finished intersection with 110 states and 220 transitions. [2022-03-15 21:48:23,225 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:24,724 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 24 new interpolants: [165906#(or (<= N (+ 2 i)) (< (+ 3 i) N)), 165904#(or (not (< l N)) (<= k i) (not (< l p))), 165898#(or (<= (+ 3 k) N) (not (< l N)) (not (< l p))), 165900#(or (<= N i) (< (+ i 1) N)), 165903#(or (not (< l N)) (not (< l p)) (<= (+ k 1) i)), 165918#(or (<= (+ 2 k) i) (<= N k) (<= (+ k 1) l)), 165917#(or (not (< l (+ k 1))) (<= (+ 3 k) i) (<= N k)), 165910#(or (<= (+ 2 k) N) (< i N)), 165912#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 165905#(or (<= N k) (<= (+ k 4) N) (<= (+ k 1) l)), 165899#(< i N), 165908#(or (< k N) (< i N)), 165920#(or (< (+ i 4) N) (<= (+ 2 k) N) (<= N (+ 3 i))), 165914#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 165921#(or (<= (+ k 1) i) (<= N k) (<= (+ k 1) l)), 165909#(or (<= N i) (< (+ i 1) N) (< k N)), 165902#(or (<= (+ 2 k) i) (not (< l N)) (not (< l p))), 165901#(or (<= N (+ i 1)) (< (+ 2 i) N)), 165919#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 165913#(or (<= N (+ i 1)) (< (+ 2 i) N) (<= (+ 2 k) N)), 165916#(or (< (+ i 4) N) (<= N (+ 3 i))), 165915#(or (<= N (+ 2 i)) (<= (+ 2 k) N) (< (+ 3 i) N)), 165907#(< k N), 165911#(or (<= N i) (< (+ i 1) N) (<= (+ 2 k) N))] [2022-03-15 21:48:24,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-03-15 21:48:24,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:24,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-03-15 21:48:24,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1356, Unknown=0, NotChecked=0, Total=1560 [2022-03-15 21:48:24,725 INFO L87 Difference]: Start difference. First operand 20162 states and 100289 transitions. Second operand has 35 states, 35 states have (on average 3.6) internal successors, (126), 34 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:30,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:30,547 INFO L93 Difference]: Finished difference Result 62971 states and 285779 transitions. [2022-03-15 21:48:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2022-03-15 21:48:30,547 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.6) internal successors, (126), 34 states have internal predecessors, (126), 0 states have call successors, (0), 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 21 [2022-03-15 21:48:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:30,829 INFO L225 Difference]: With dead ends: 62971 [2022-03-15 21:48:30,829 INFO L226 Difference]: Without dead ends: 62971 [2022-03-15 21:48:30,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9418 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4891, Invalid=23839, Unknown=0, NotChecked=0, Total=28730 [2022-03-15 21:48:30,831 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 700 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:30,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [700 Valid, 0 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-15 21:48:30,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62971 states. [2022-03-15 21:48:32,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62971 to 33274. [2022-03-15 21:48:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33274 states, 33273 states have (on average 4.9123313196886365) internal successors, (163448), 33273 states have internal predecessors, (163448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33274 states to 33274 states and 163448 transitions. [2022-03-15 21:48:32,340 INFO L78 Accepts]: Start accepts. Automaton has 33274 states and 163448 transitions. Word has length 21 [2022-03-15 21:48:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:32,340 INFO L470 AbstractCegarLoop]: Abstraction has 33274 states and 163448 transitions. [2022-03-15 21:48:32,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.6) internal successors, (126), 34 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33274 states and 163448 transitions. [2022-03-15 21:48:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-15 21:48:32,583 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:32,584 INFO L514 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:32,600 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 21:48:32,799 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 21:48:32,799 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 740811861, now seen corresponding path program 15 times [2022-03-15 21:48:32,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:32,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022460919] [2022-03-15 21:48:32,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-15 21:48:32,884 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:32,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-15 21:48:32,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022460919] [2022-03-15 21:48:32,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022460919] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-15 21:48:32,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637166118] [2022-03-15 21:48:32,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-15 21:48:32,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-15 21:48:32,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-15 21:48:32,885 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 21:48:32,886 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 21:48:32,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-03-15 21:48:32,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-15 21:48:32,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-15 21:48:32,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-15 21:48:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:33,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-15 21:48:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-15 21:48:33,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637166118] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-15 21:48:33,081 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-15 21:48:33,081 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-03-15 21:48:33,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047464117] [2022-03-15 21:48:33,081 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2022-03-15 21:48:33,083 INFO L249 McrAutomatonBuilder]: Started intersection. [2022-03-15 21:48:33,305 INFO L252 McrAutomatonBuilder]: Finished intersection with 125 states and 253 transitions. [2022-03-15 21:48:33,305 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2022-03-15 21:48:34,959 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 32 new interpolants: [295863#(or (<= N i) (< k N)), 295879#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N) (<= N l) (<= p l)), 295855#(or (<= N i) (< (+ i 1) N)), 295851#(or (<= N k) (< (+ k 1) N)), 295873#(or (<= N (+ i 1)) (< k N)), 295869#(or (not (< l N)) (not (< l p)) (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 295850#(< k N), 295860#(or (<= (+ N 1) i) (< k N)), 295853#(< i N), 295872#(or (< (+ 5 i) N) (<= N (+ i 4))), 295874#(or (<= N (+ i 1)) (<= N k) (< (+ k 1) N)), 295858#(or (<= N (+ i 1)) (< (+ 2 i) N)), 295852#(or (not (< l N)) (not (< l p)) (<= N k) (< (+ k 1) N)), 295878#(or (<= N (+ k 1)) (<= N i) (< (+ 2 k) N) (<= (+ k 1) l)), 295864#(or (<= N k) (< (+ k 1) N) (<= (+ 2 N) i)), 295871#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ k 1) l)), 295856#(or (<= N i) (< (+ i 1) N) (< k N)), 295865#(or (<= (+ N 1) i) (<= N k) (< (+ k 1) N)), 295854#(or (< k N) (< i N)), 295880#(or (<= N (+ k 1)) (<= N (+ i 1)) (< (+ 2 k) N) (<= (+ k 1) l)), 295862#(or (<= N (+ 2 i)) (< (+ 3 i) N) (< k N)), 295877#(or (<= N (+ k 1)) (<= (+ N 1) i) (< (+ 2 k) N) (<= (+ k 1) l)), 295876#(or (<= N (+ k 1)) (< (+ 2 k) N) (<= (+ 2 N) i) (<= (+ k 1) l)), 295867#(or (< (+ i 4) N) (<= N (+ 3 i))), 295875#(or (not (< l N)) (<= N i) (not (< l p)) (<= N k) (< (+ k 1) N)), 295866#(or (<= N i) (<= N k) (< (+ k 1) N)), 295868#(or (not (< l N)) (not (< l p)) (<= N k) (< (+ k 1) N) (<= (+ 2 N) i)), 295859#(or (<= N (+ i 1)) (< (+ 2 i) N) (< k N)), 295870#(or (< (+ i 4) N) (<= N (+ 3 i)) (< k N)), 295881#(or (< (+ 5 i) N) (< k N) (<= N (+ i 4))), 295857#(or (< k N) (<= (+ 2 N) i)), 295861#(or (<= N (+ 2 i)) (< (+ 3 i) N))] [2022-03-15 21:48:34,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-03-15 21:48:34,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-15 21:48:34,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-03-15 21:48:34,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2608, Unknown=0, NotChecked=0, Total=2970 [2022-03-15 21:48:34,960 INFO L87 Difference]: Start difference. First operand 33274 states and 163448 transitions. Second operand has 44 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 43 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-15 21:48:38,899 INFO L93 Difference]: Finished difference Result 84153 states and 394055 transitions. [2022-03-15 21:48:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-03-15 21:48:38,900 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 43 states have internal predecessors, (149), 0 states have call successors, (0), 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 22 [2022-03-15 21:48:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-15 21:48:39,474 INFO L225 Difference]: With dead ends: 84153 [2022-03-15 21:48:39,475 INFO L226 Difference]: Without dead ends: 83767 [2022-03-15 21:48:39,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4384, Invalid=22022, Unknown=0, NotChecked=0, Total=26406 [2022-03-15 21:48:39,476 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 550 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-15 21:48:39,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 0 Invalid, 2440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-15 21:48:39,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83767 states. [2022-03-15 21:48:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83767 to 55800. [2022-03-15 21:48:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55800 states, 55799 states have (on average 4.9948923815839) internal successors, (278710), 55799 states have internal predecessors, (278710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55800 states to 55800 states and 278710 transitions. [2022-03-15 21:48:41,982 INFO L78 Accepts]: Start accepts. Automaton has 55800 states and 278710 transitions. Word has length 22 [2022-03-15 21:48:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-15 21:48:41,982 INFO L470 AbstractCegarLoop]: Abstraction has 55800 states and 278710 transitions. [2022-03-15 21:48:41,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.3863636363636362) internal successors, (149), 43 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-15 21:48:41,982 INFO L276 IsEmpty]: Start isEmpty. Operand 55800 states and 278710 transitions. [2022-03-15 21:48:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-15 21:48:42,113 INFO L506 BasicCegarLoop]: Found error trace [2022-03-15 21:48:42,113 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-15 21:48:42,129 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 21:48:42,330 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 21:48:42,330 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-03-15 21:48:42,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-15 21:48:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1143580956, now seen corresponding path program 16 times [2022-03-15 21:48:42,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-15 21:48:42,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021080788] [2022-03-15 21:48:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-15 21:48:42,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-15 21:48:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-03-15 21:58:56,830 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2022-03-15 21:58:56,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-15 21:58:56,831 WARN L594 AbstractCegarLoop]: Verification canceled: while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-3-4-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-3-4-3-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. [2022-03-15 21:58:56,832 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-03-15 21:58:56,832 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-03-15 21:58:56,832 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-03-15 21:58:56,833 INFO L732 BasicCegarLoop]: Path program histogram: [16, 1, 1, 1] [2022-03-15 21:58:56,835 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-15 21:58:56,835 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-15 21:58:56,836 INFO L202 PluginConnector]: Adding new model three-array-min.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 09:58:56 BasicIcfg [2022-03-15 21:58:56,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-15 21:58:56,836 INFO L158 Benchmark]: Toolchain (without parser) took 871007.68ms. Allocated memory was 192.9MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 153.8MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-03-15 21:58:56,837 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-15 21:58:56,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.03ms. Allocated memory is still 192.9MB. Free memory was 153.7MB in the beginning and 152.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:58:56,837 INFO L158 Benchmark]: Boogie Preprocessor took 24.08ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 151.2MB in the end (delta: 950.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-15 21:58:56,837 INFO L158 Benchmark]: RCFGBuilder took 235.53ms. Allocated memory is still 192.9MB. Free memory was 151.1MB in the beginning and 141.4MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-03-15 21:58:56,837 INFO L158 Benchmark]: TraceAbstraction took 870714.73ms. Allocated memory was 192.9MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 140.8MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-03-15 21:58:56,838 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 21:58:56,838 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 192.9MB. Free memory is still 155.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.03ms. Allocated memory is still 192.9MB. Free memory was 153.7MB in the beginning and 152.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.08ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 151.2MB in the end (delta: 950.8kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 235.53ms. Allocated memory is still 192.9MB. Free memory was 151.1MB in the beginning and 141.4MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 870714.73ms. Allocated memory was 192.9MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 140.8MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 38 PlacesBefore, 26 PlacesAfterwards, 32 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 190, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 85, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 190, positive: 101, positive conditional: 0, positive unconditional: 101, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 85, unknown conditional: 0, unknown unconditional: 85] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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: 74]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-3-4-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-3-4-3-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-3-4-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-3-4-3-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-3-4-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-3-4-3-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was analyzing trace of length 24 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-2-4-3-4-3-5-4-5-4-5-4-5-4-5-4-5-4-5-4-5-4-3-4-3-4-2-4-2-4-2-4-2-4-2-4-2-4-2-4-2-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 870.6s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.6s, AutomataDifference: 75.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6160 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6160 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3064 mSDsCounter, 2561 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14025 IncrementalHoareTripleChecker+Invalid, 16586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2561 mSolverCounterUnsat, 0 mSDtfsCounter, 14025 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2585 GetRequests, 1295 SyntacticMatches, 105 SemanticMatches, 1185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67425 ImplicationChecksByTransitivity, 76.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55800occurred in iteration=18, InterpolantAutomatonStates: 958, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 90636 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 30.3s InterpolantComputationTime, 602 NumberOfCodeBlocks, 600 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 818 ConstructedInterpolants, 4 QuantifiedInterpolants, 18637 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 157 ConjunctsInUnsatCore, 47 InterpolantComputations, 4 PerfectInterpolantSequences, 255/482 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