java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:51:00,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:51:00,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:51:00,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:51:00,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:51:00,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:51:00,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:51:00,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:51:00,667 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:51:00,668 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:51:00,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:51:00,669 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:51:00,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:51:00,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:51:00,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:51:00,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:51:00,675 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:51:00,676 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:51:00,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:51:00,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:51:00,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:51:00,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:51:00,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:51:00,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:51:00,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:51:00,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:51:00,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:51:00,683 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:51:00,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:51:00,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:51:00,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:51:00,684 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:51:00,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:51:00,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:51:00,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:51:00,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:51:00,696 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:51:00,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:51:00,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:51:00,696 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:51:00,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:51:00,697 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:51:00,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:51:00,698 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:51:00,698 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:51:00,698 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:51:00,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:51:00,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:51:00,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:51:00,736 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:51:00,748 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:51:00,752 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:51:00,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:51:00,753 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:51:00,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:51:00,889 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:51:00,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:51:00,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:51:00,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:51:00,897 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:51:00,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:51:00" (1/1) ... [2018-02-02 09:51:00,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc5225c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:00, skipping insertion in model container [2018-02-02 09:51:00,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:51:00" (1/1) ... [2018-02-02 09:51:00,914 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:51:00,947 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:51:01,036 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:51:01,047 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:51:01,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01 WrapperNode [2018-02-02 09:51:01,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:51:01,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:51:01,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:51:01,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:51:01,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... [2018-02-02 09:51:01,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:51:01,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:51:01,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:51:01,084 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:51:01,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:51:01,125 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:51:01,125 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:51:01,125 INFO L136 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-02-02 09:51:01,125 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:51:01,125 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:51:01,125 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:51:01,125 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:51:01,125 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:51:01,126 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:51:01,126 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:51:01,126 INFO L128 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-02-02 09:51:01,126 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:51:01,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:51:01,126 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:51:01,293 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:51:01,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:51:01 BoogieIcfgContainer [2018-02-02 09:51:01,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:51:01,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:51:01,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:51:01,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:51:01,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:51:00" (1/3) ... [2018-02-02 09:51:01,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d976e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:51:01, skipping insertion in model container [2018-02-02 09:51:01,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:51:01" (2/3) ... [2018-02-02 09:51:01,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d976e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:51:01, skipping insertion in model container [2018-02-02 09:51:01,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:51:01" (3/3) ... [2018-02-02 09:51:01,298 INFO L107 eAbstractionObserver]: Analyzing ICFG selectionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:51:01,305 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:51:01,312 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 09:51:01,337 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:51:01,338 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:51:01,338 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:51:01,338 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:51:01,338 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:51:01,338 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:51:01,338 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:51:01,338 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:51:01,339 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:51:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-02 09:51:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:51:01,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:01,359 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:01,359 INFO L371 AbstractCegarLoop]: === Iteration 1 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash -545325107, now seen corresponding path program 1 times [2018-02-02 09:51:01,399 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:01,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:51:01,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:51:01,467 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,468 INFO L182 omatonBuilderFactory]: Interpolants [51#true, 52#false] [2018-02-02 09:51:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 09:51:01,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 09:51:01,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:51:01,484 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2018-02-02 09:51:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:01,497 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-02 09:51:01,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 09:51:01,498 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-02-02 09:51:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:01,504 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:51:01,504 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:51:01,505 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 09:51:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:51:01,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 09:51:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 09:51:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-02 09:51:01,583 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-02-02 09:51:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:01,584 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-02 09:51:01,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 09:51:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-02 09:51:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:51:01,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:01,584 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:01,584 INFO L371 AbstractCegarLoop]: === Iteration 2 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash 274771065, now seen corresponding path program 1 times [2018-02-02 09:51:01,585 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:01,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:51:01,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:51:01,700 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,700 INFO L182 omatonBuilderFactory]: Interpolants [146#true, 147#false, 148#(= 1 (select |#valid| |main_#t~malloc9.base|)), 149#(= 1 (select |#valid| main_~numbers~0.base)), 150#(= 1 (select |#valid| |SelectionSort_#in~a.base|)), 151#(= 1 (select |#valid| SelectionSort_~a.base))] [2018-02-02 09:51:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:01,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:51:01,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:51:01,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:51:01,701 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 6 states. [2018-02-02 09:51:01,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:01,947 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-02-02 09:51:01,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:51:01,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 09:51:01,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:01,951 INFO L225 Difference]: With dead ends: 39 [2018-02-02 09:51:01,951 INFO L226 Difference]: Without dead ends: 39 [2018-02-02 09:51:01,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:01,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-02 09:51:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-02-02 09:51:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-02 09:51:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-02-02 09:51:01,956 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2018-02-02 09:51:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:01,956 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-02-02 09:51:01,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:51:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-02-02 09:51:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:51:01,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:01,957 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:01,957 INFO L371 AbstractCegarLoop]: === Iteration 3 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 274771066, now seen corresponding path program 1 times [2018-02-02 09:51:01,958 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:01,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:51:02,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:51:02,002 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,002 INFO L182 omatonBuilderFactory]: Interpolants [234#true, 235#false, 236#(<= (+ SelectionSort_~j~0 1) SelectionSort_~array_size)] [2018-02-02 09:51:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:51:02,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:51:02,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:51:02,003 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2018-02-02 09:51:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:02,014 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 09:51:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:51:02,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 09:51:02,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:02,019 INFO L225 Difference]: With dead ends: 41 [2018-02-02 09:51:02,020 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:51:02,020 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:51:02,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:51:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-02 09:51:02,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 09:51:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 09:51:02,025 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 16 [2018-02-02 09:51:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:02,025 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 09:51:02,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:51:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 09:51:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:51:02,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:02,026 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:02,026 INFO L371 AbstractCegarLoop]: === Iteration 4 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:02,026 INFO L82 PathProgramCache]: Analyzing trace with hash 274771112, now seen corresponding path program 1 times [2018-02-02 09:51:02,027 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:02,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:51:02,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:51:02,196 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,196 INFO L182 omatonBuilderFactory]: Interpolants [320#false, 321#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 322#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 323#(and (= 0 |SelectionSort_#in~a.offset|) (<= (* 4 |SelectionSort_#in~array_size|) (select |#length| |SelectionSort_#in~a.base|))), 324#(and (= SelectionSort_~a.offset 0) (= SelectionSort_~i~0 0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 325#(and (= SelectionSort_~a.offset 0) (<= 1 SelectionSort_~j~0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 326#(and (= SelectionSort_~a.offset 0) (<= 1 SelectionSort_~j~0) (<= (+ (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base))), 319#true] [2018-02-02 09:51:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:51:02,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:51:02,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:02,197 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 8 states. [2018-02-02 09:51:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:02,594 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-02-02 09:51:02,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:51:02,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-02 09:51:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:02,598 INFO L225 Difference]: With dead ends: 69 [2018-02-02 09:51:02,598 INFO L226 Difference]: Without dead ends: 69 [2018-02-02 09:51:02,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:51:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-02-02 09:51:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2018-02-02 09:51:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:51:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 09:51:02,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 16 [2018-02-02 09:51:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:02,603 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 09:51:02,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:51:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 09:51:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 09:51:02,604 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:02,604 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:02,604 INFO L371 AbstractCegarLoop]: === Iteration 5 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash -72030156, now seen corresponding path program 1 times [2018-02-02 09:51:02,605 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:02,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:51:02,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:51:02,673 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,673 INFO L182 omatonBuilderFactory]: Interpolants [464#(and (= SelectionSort_~a.offset 0) (<= 4 (select |#length| SelectionSort_~a.base)) (= SelectionSort_~min~0 0)), 457#true, 458#false, 459#(= 0 |main_#t~malloc9.offset|), 460#(= 0 main_~numbers~0.offset), 461#(= 0 |SelectionSort_#in~a.offset|), 462#(and (= SelectionSort_~a.offset 0) (= 0 SelectionSort_~i~0)), 463#(and (= SelectionSort_~a.offset 0) (= SelectionSort_~min~0 0))] [2018-02-02 09:51:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:51:02,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:51:02,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:02,674 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-02 09:51:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:02,806 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2018-02-02 09:51:02,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:51:02,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-02 09:51:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:02,807 INFO L225 Difference]: With dead ends: 83 [2018-02-02 09:51:02,807 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 09:51:02,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:51:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 09:51:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-02 09:51:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:51:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-02 09:51:02,811 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 17 [2018-02-02 09:51:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:02,811 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-02 09:51:02,811 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:51:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-02 09:51:02,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:51:02,812 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:02,812 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:02,812 INFO L371 AbstractCegarLoop]: === Iteration 6 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1045798781, now seen corresponding path program 1 times [2018-02-02 09:51:02,813 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:02,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,876 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:51:02,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:51:02,876 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,877 INFO L182 omatonBuilderFactory]: Interpolants [624#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|), 621#true, 622#false, 623#(= |#valid| |old(#valid)|)] [2018-02-02 09:51:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:51:02,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:51:02,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:51:02,877 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 4 states. [2018-02-02 09:51:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:02,921 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-02-02 09:51:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:51:02,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-02 09:51:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:02,923 INFO L225 Difference]: With dead ends: 62 [2018-02-02 09:51:02,923 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 09:51:02,923 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:51:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 09:51:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 09:51:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:51:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-02-02 09:51:02,926 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 19 [2018-02-02 09:51:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:02,926 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-02-02 09:51:02,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:51:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-02-02 09:51:02,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:51:02,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:02,926 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:02,926 INFO L371 AbstractCegarLoop]: === Iteration 7 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:02,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1880509326, now seen corresponding path program 1 times [2018-02-02 09:51:02,927 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:02,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:02,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:51:02,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,988 INFO L182 omatonBuilderFactory]: Interpolants [752#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 8) (select |#length| SelectionSort_~a.base)) (= SelectionSort_~i~0 0)), 745#true, 746#false, 747#(= 0 |main_#t~malloc9.offset|), 748#(= 0 main_~numbers~0.offset), 749#(= 0 |SelectionSort_#in~a.offset|), 750#(and (= SelectionSort_~a.offset 0) (= SelectionSort_~i~0 0)), 751#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0) (= SelectionSort_~i~0 0))] [2018-02-02 09:51:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:02,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:51:02,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:51:02,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:02,989 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 8 states. [2018-02-02 09:51:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:03,063 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-02 09:51:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:51:03,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 09:51:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:03,064 INFO L225 Difference]: With dead ends: 67 [2018-02-02 09:51:03,064 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 09:51:03,065 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:51:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 09:51:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2018-02-02 09:51:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:51:03,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2018-02-02 09:51:03,067 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2018-02-02 09:51:03,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:03,067 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2018-02-02 09:51:03,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:51:03,067 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2018-02-02 09:51:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:51:03,068 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:03,068 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:03,068 INFO L371 AbstractCegarLoop]: === Iteration 8 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1833751648, now seen corresponding path program 1 times [2018-02-02 09:51:03,068 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:03,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:03,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 09:51:03,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,123 INFO L182 omatonBuilderFactory]: Interpolants [888#true, 889#false, 890#(<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))), 891#(and (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))) (<= SelectionSort_~min~0 SelectionSort_~j~0)), 892#(and (<= (+ SelectionSort_~min~0 1) SelectionSort_~j~0) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0)))), 893#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))))] [2018-02-02 09:51:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:51:03,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:51:03,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:51:03,124 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states. [2018-02-02 09:51:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:03,181 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-02-02 09:51:03,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:51:03,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 09:51:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:03,182 INFO L225 Difference]: With dead ends: 107 [2018-02-02 09:51:03,182 INFO L226 Difference]: Without dead ends: 107 [2018-02-02 09:51:03,182 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:51:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-02-02 09:51:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 70. [2018-02-02 09:51:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 09:51:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-02-02 09:51:03,185 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 23 [2018-02-02 09:51:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:03,185 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-02-02 09:51:03,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:51:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-02-02 09:51:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:51:03,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:03,186 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:03,186 INFO L371 AbstractCegarLoop]: === Iteration 9 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:03,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1011769969, now seen corresponding path program 1 times [2018-02-02 09:51:03,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:03,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:03,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:51:03,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,303 INFO L182 omatonBuilderFactory]: Interpolants [1074#true, 1075#false, 1076#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 1077#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 1078#(and (= 0 |SelectionSort_#in~a.offset|) (<= (* 4 |SelectionSort_#in~array_size|) (select |#length| |SelectionSort_#in~a.base|))), 1079#(and (= SelectionSort_~a.offset 0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 1080#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0) (<= (* 4 SelectionSort_~array_size) (select |#length| SelectionSort_~a.base))), 1081#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0) (<= (+ (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base))), 1082#(and (= SelectionSort_~a.offset 0) (<= (+ SelectionSort_~i~0 1) SelectionSort_~min~0) (<= (+ (* 4 SelectionSort_~min~0) 4) (select |#length| SelectionSort_~a.base))), 1083#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))) (= SelectionSort_~a.offset 0) (<= (+ (* 4 SelectionSort_~min~0) 4) (select |#length| SelectionSort_~a.base)))] [2018-02-02 09:51:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:51:03,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:51:03,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:51:03,304 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 10 states. [2018-02-02 09:51:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:03,566 INFO L93 Difference]: Finished difference Result 94 states and 107 transitions. [2018-02-02 09:51:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:51:03,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-02 09:51:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:03,567 INFO L225 Difference]: With dead ends: 94 [2018-02-02 09:51:03,567 INFO L226 Difference]: Without dead ends: 94 [2018-02-02 09:51:03,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:51:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-02-02 09:51:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 60. [2018-02-02 09:51:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 09:51:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2018-02-02 09:51:03,572 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 24 [2018-02-02 09:51:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:03,573 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2018-02-02 09:51:03,573 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:51:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2018-02-02 09:51:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 09:51:03,574 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:03,574 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:03,574 INFO L371 AbstractCegarLoop]: === Iteration 10 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1016956569, now seen corresponding path program 1 times [2018-02-02 09:51:03,575 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:03,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:03,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:03,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 09:51:03,730 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,731 INFO L182 omatonBuilderFactory]: Interpolants [1254#true, 1255#false, 1256#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 1257#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 1258#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 2)), 1259#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 1))] [2018-02-02 09:51:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:51:03,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:51:03,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:51:03,732 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand 6 states. [2018-02-02 09:51:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:03,796 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-02-02 09:51:03,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:51:03,797 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-02 09:51:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:03,798 INFO L225 Difference]: With dead ends: 114 [2018-02-02 09:51:03,798 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 09:51:03,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 09:51:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2018-02-02 09:51:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-02 09:51:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2018-02-02 09:51:03,803 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 33 [2018-02-02 09:51:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:03,803 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2018-02-02 09:51:03,804 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:51:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2018-02-02 09:51:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:51:03,804 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:03,805 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:03,805 INFO L371 AbstractCegarLoop]: === Iteration 11 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:03,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1805684219, now seen corresponding path program 2 times [2018-02-02 09:51:03,805 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:03,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,885 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:03,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:51:03,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,886 INFO L182 omatonBuilderFactory]: Interpolants [1464#true, 1465#false, 1466#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 1467#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 1468#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)), 1469#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0)))), 1470#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0))) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 8) (select |#length| SelectionSort_~a.base))), 1471#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 8 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:03,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:51:03,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:51:03,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:03,887 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand 8 states. [2018-02-02 09:51:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:04,085 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-02-02 09:51:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:51:04,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-02 09:51:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:04,086 INFO L225 Difference]: With dead ends: 93 [2018-02-02 09:51:04,088 INFO L226 Difference]: Without dead ends: 89 [2018-02-02 09:51:04,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:51:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-02 09:51:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-02-02 09:51:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 09:51:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2018-02-02 09:51:04,093 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 39 [2018-02-02 09:51:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:04,093 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2018-02-02 09:51:04,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:51:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2018-02-02 09:51:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 09:51:04,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:04,094 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:04,094 INFO L371 AbstractCegarLoop]: === Iteration 12 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:04,094 INFO L82 PathProgramCache]: Analyzing trace with hash -141635977, now seen corresponding path program 1 times [2018-02-02 09:51:04,094 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:04,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:04,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 09:51:04,177 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,177 INFO L182 omatonBuilderFactory]: Interpolants [1655#true, 1656#false, 1657#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 1658#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 1659#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)), 1660#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0)))), 1661#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0))) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 8) (select |#length| SelectionSort_~a.base))), 1662#(and (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0))) (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~min~0) 8) (select |#length| SelectionSort_~a.base)))] [2018-02-02 09:51:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:51:04,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:51:04,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:51:04,178 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand 8 states. [2018-02-02 09:51:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:04,362 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2018-02-02 09:51:04,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:51:04,363 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-02-02 09:51:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:04,363 INFO L225 Difference]: With dead ends: 88 [2018-02-02 09:51:04,364 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 09:51:04,364 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:51:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 09:51:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 51. [2018-02-02 09:51:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 09:51:04,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 09:51:04,367 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 40 [2018-02-02 09:51:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:04,368 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 09:51:04,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:51:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 09:51:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 09:51:04,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:04,369 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:04,369 INFO L371 AbstractCegarLoop]: === Iteration 13 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash -523184295, now seen corresponding path program 3 times [2018-02-02 09:51:04,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:04,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:04,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:51:04,439 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,439 INFO L182 omatonBuilderFactory]: Interpolants [1824#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 1825#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 3)), 1826#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 2)), 1827#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 1828#(<= SelectionSort_~array_size SelectionSort_~j~0), 1820#true, 1821#false, 1822#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 1823#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-02 09:51:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:51:04,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:51:04,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:51:04,440 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 9 states. [2018-02-02 09:51:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:04,506 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-02-02 09:51:04,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:51:04,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-02-02 09:51:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:04,507 INFO L225 Difference]: With dead ends: 90 [2018-02-02 09:51:04,507 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 09:51:04,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:51:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 09:51:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-02-02 09:51:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:51:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-02-02 09:51:04,509 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 45 [2018-02-02 09:51:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:04,510 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-02-02 09:51:04,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:51:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-02-02 09:51:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-02 09:51:04,510 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:04,510 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:04,510 INFO L371 AbstractCegarLoop]: === Iteration 14 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2058288955, now seen corresponding path program 4 times [2018-02-02 09:51:04,511 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:04,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:04,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 09:51:04,605 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,606 INFO L182 omatonBuilderFactory]: Interpolants [1989#true, 1990#false, 1991#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 1992#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 1993#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 1994#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 16) (select |#length| SelectionSort_~a.base)), 1995#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 12) (select |#length| SelectionSort_~a.base)), 1996#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 1997#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 1998#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:51:04,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:51:04,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:51:04,607 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 10 states. [2018-02-02 09:51:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:04,740 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-02-02 09:51:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:51:04,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-02-02 09:51:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:04,741 INFO L225 Difference]: With dead ends: 66 [2018-02-02 09:51:04,741 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 09:51:04,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:51:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 09:51:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2018-02-02 09:51:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:51:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-02-02 09:51:04,745 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 51 [2018-02-02 09:51:04,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:04,745 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-02-02 09:51:04,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:51:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-02-02 09:51:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-02 09:51:04,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:04,746 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:04,746 INFO L371 AbstractCegarLoop]: === Iteration 15 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:04,746 INFO L82 PathProgramCache]: Analyzing trace with hash -91466215, now seen corresponding path program 5 times [2018-02-02 09:51:04,746 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:04,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:04,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:51:04,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,840 INFO L182 omatonBuilderFactory]: Interpolants [2144#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 2145#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 2146#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 2147#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 4)), 2148#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 3)), 2149#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 2150#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 2151#(<= SelectionSort_~array_size SelectionSort_~j~0), 2141#true, 2142#false, 2143#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1))] [2018-02-02 09:51:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:04,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:51:04,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:51:04,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:51:04,840 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 11 states. [2018-02-02 09:51:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:04,933 INFO L93 Difference]: Finished difference Result 108 states and 124 transitions. [2018-02-02 09:51:04,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:51:04,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2018-02-02 09:51:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:04,934 INFO L225 Difference]: With dead ends: 108 [2018-02-02 09:51:04,934 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 09:51:04,934 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:51:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 09:51:04,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-02-02 09:51:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 09:51:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-02-02 09:51:04,937 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 57 [2018-02-02 09:51:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:04,937 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-02-02 09:51:04,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:51:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-02-02 09:51:04,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-02-02 09:51:04,938 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:04,938 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:04,938 INFO L371 AbstractCegarLoop]: === Iteration 16 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:04,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2052963717, now seen corresponding path program 6 times [2018-02-02 09:51:04,939 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:04,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 29 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,038 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:05,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:51:05,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,039 INFO L182 omatonBuilderFactory]: Interpolants [2352#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 2353#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 2354#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 2355#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 2344#true, 2345#false, 2346#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 2347#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 2348#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 2349#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 2350#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 20) (select |#length| SelectionSort_~a.base)), 2351#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 16) (select |#length| SelectionSort_~a.base))] [2018-02-02 09:51:05,039 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 29 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:51:05,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:51:05,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:51:05,039 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 12 states. [2018-02-02 09:51:05,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:05,238 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-02-02 09:51:05,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:51:05,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-02-02 09:51:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:05,239 INFO L225 Difference]: With dead ends: 78 [2018-02-02 09:51:05,239 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 09:51:05,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:51:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 09:51:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-02-02 09:51:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 09:51:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-02-02 09:51:05,242 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 63 [2018-02-02 09:51:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:05,242 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-02-02 09:51:05,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:51:05,242 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-02-02 09:51:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 09:51:05,244 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:05,244 INFO L351 BasicCegarLoop]: trace histogram [9, 8, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:05,244 INFO L371 AbstractCegarLoop]: === Iteration 17 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1228373287, now seen corresponding path program 7 times [2018-02-02 09:51:05,245 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:05,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 33 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:05,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:51:05,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,341 INFO L182 omatonBuilderFactory]: Interpolants [2528#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 2529#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 2530#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 2531#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 5)), 2532#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 4)), 2533#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 2534#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 2535#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 2536#(<= SelectionSort_~array_size SelectionSort_~j~0), 2524#true, 2525#false, 2526#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 2527#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-02 09:51:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 33 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:51:05,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:51:05,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:51:05,342 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 13 states. [2018-02-02 09:51:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:05,507 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-02 09:51:05,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:51:05,508 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-02-02 09:51:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:05,509 INFO L225 Difference]: With dead ends: 126 [2018-02-02 09:51:05,509 INFO L226 Difference]: Without dead ends: 97 [2018-02-02 09:51:05,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:51:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-02 09:51:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-02-02 09:51:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 09:51:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-02-02 09:51:05,511 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 69 [2018-02-02 09:51:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:05,512 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-02-02 09:51:05,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:51:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-02-02 09:51:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 09:51:05,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:05,513 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:05,513 INFO L371 AbstractCegarLoop]: === Iteration 18 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:05,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1543383109, now seen corresponding path program 8 times [2018-02-02 09:51:05,514 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:05,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 50 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:05,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:51:05,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,639 INFO L182 omatonBuilderFactory]: Interpolants [2761#true, 2762#false, 2763#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 2764#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 2765#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 2766#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 2767#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 2768#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 24) (select |#length| SelectionSort_~a.base)), 2769#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 20) (select |#length| SelectionSort_~a.base)), 2770#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 2771#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 2772#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 2773#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 2774#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 50 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:51:05,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:51:05,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:51:05,640 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 14 states. [2018-02-02 09:51:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:05,870 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-02-02 09:51:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:51:05,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 75 [2018-02-02 09:51:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:05,871 INFO L225 Difference]: With dead ends: 90 [2018-02-02 09:51:05,871 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 09:51:05,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:51:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 09:51:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-02-02 09:51:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-02 09:51:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2018-02-02 09:51:05,873 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 75 [2018-02-02 09:51:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:05,873 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2018-02-02 09:51:05,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:51:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2018-02-02 09:51:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 09:51:05,875 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:05,875 INFO L351 BasicCegarLoop]: trace histogram [11, 10, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:05,875 INFO L371 AbstractCegarLoop]: === Iteration 19 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash -509747815, now seen corresponding path program 9 times [2018-02-02 09:51:05,876 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:05,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 55 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,984 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:05,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:51:05,984 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,985 INFO L182 omatonBuilderFactory]: Interpolants [2976#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 2977#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 6)), 2978#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 5)), 2979#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 2980#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 2981#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 2982#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 2983#(<= SelectionSort_~array_size SelectionSort_~j~0), 2969#true, 2970#false, 2971#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 2972#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 2973#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 2974#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 2975#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-02 09:51:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 55 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:05,985 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:51:05,985 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:51:05,985 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:51:05,985 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand 15 states. [2018-02-02 09:51:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:06,248 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2018-02-02 09:51:06,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:51:06,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2018-02-02 09:51:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:06,249 INFO L225 Difference]: With dead ends: 144 [2018-02-02 09:51:06,249 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 09:51:06,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:51:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 09:51:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2018-02-02 09:51:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 09:51:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2018-02-02 09:51:06,251 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 81 [2018-02-02 09:51:06,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:06,252 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2018-02-02 09:51:06,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:51:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2018-02-02 09:51:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-02 09:51:06,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:06,252 INFO L351 BasicCegarLoop]: trace histogram [12, 11, 10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:06,253 INFO L371 AbstractCegarLoop]: === Iteration 20 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1909113093, now seen corresponding path program 10 times [2018-02-02 09:51:06,253 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:06,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:06,413 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 77 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:06,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:51:06,414 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,414 INFO L182 omatonBuilderFactory]: Interpolants [3240#true, 3241#false, 3242#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 3243#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 3244#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 3245#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 3246#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 3247#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 3248#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 28) (select |#length| SelectionSort_~a.base)), 3249#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 24) (select |#length| SelectionSort_~a.base)), 3250#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 3251#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 3252#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 3253#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 3254#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 3255#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 77 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:51:06,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:51:06,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:51:06,415 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand 16 states. [2018-02-02 09:51:06,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:06,686 INFO L93 Difference]: Finished difference Result 102 states and 117 transitions. [2018-02-02 09:51:06,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:51:06,686 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2018-02-02 09:51:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:06,686 INFO L225 Difference]: With dead ends: 102 [2018-02-02 09:51:06,687 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 09:51:06,687 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:51:06,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 09:51:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-02-02 09:51:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 09:51:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2018-02-02 09:51:06,688 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 87 [2018-02-02 09:51:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:06,688 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2018-02-02 09:51:06,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:51:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2018-02-02 09:51:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:51:06,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:06,689 INFO L351 BasicCegarLoop]: trace histogram [13, 12, 11, 11, 11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:06,689 INFO L371 AbstractCegarLoop]: === Iteration 21 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash -834345383, now seen corresponding path program 11 times [2018-02-02 09:51:06,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:06,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 83 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:06,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:51:06,808 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:06,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,809 INFO L182 omatonBuilderFactory]: Interpolants [3488#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 3489#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 3490#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 3491#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 3492#(<= SelectionSort_~array_size SelectionSort_~j~0), 3476#true, 3477#false, 3478#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 3479#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 3480#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 3481#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 3482#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 3483#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 3484#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 3485#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 7)), 3486#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 6)), 3487#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-02 09:51:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 83 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:06,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:51:06,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:51:06,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:51:06,810 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand 17 states. [2018-02-02 09:51:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:06,931 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 09:51:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:51:06,932 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-02-02 09:51:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:06,932 INFO L225 Difference]: With dead ends: 162 [2018-02-02 09:51:06,932 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 09:51:06,932 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:51:06,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 09:51:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2018-02-02 09:51:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 09:51:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2018-02-02 09:51:06,934 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 93 [2018-02-02 09:51:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:06,934 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2018-02-02 09:51:06,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:51:06,934 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2018-02-02 09:51:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 09:51:06,935 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:06,935 INFO L351 BasicCegarLoop]: trace histogram [14, 13, 12, 12, 12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:06,935 INFO L371 AbstractCegarLoop]: === Iteration 22 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:06,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1249642437, now seen corresponding path program 12 times [2018-02-02 09:51:06,935 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:06,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 110 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:07,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:51:07,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,116 INFO L182 omatonBuilderFactory]: Interpolants [3781#true, 3782#false, 3783#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 3784#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 3785#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 3786#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 3787#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 3788#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 3789#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 3790#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 32) (select |#length| SelectionSort_~a.base)), 3791#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 28) (select |#length| SelectionSort_~a.base)), 3792#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 3793#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 3794#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 3795#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 3796#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 3797#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 3798#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 110 proven. 350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:51:07,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:51:07,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:51:07,117 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 18 states. [2018-02-02 09:51:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:07,459 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2018-02-02 09:51:07,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:51:07,460 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 99 [2018-02-02 09:51:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:07,460 INFO L225 Difference]: With dead ends: 114 [2018-02-02 09:51:07,461 INFO L226 Difference]: Without dead ends: 114 [2018-02-02 09:51:07,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:51:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-02-02 09:51:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-02-02 09:51:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 09:51:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 128 transitions. [2018-02-02 09:51:07,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 128 transitions. Word has length 99 [2018-02-02 09:51:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:07,464 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 128 transitions. [2018-02-02 09:51:07,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:51:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 128 transitions. [2018-02-02 09:51:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-02-02 09:51:07,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:07,465 INFO L351 BasicCegarLoop]: trace histogram [15, 14, 13, 13, 13, 13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:07,465 INFO L371 AbstractCegarLoop]: === Iteration 23 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1058413849, now seen corresponding path program 13 times [2018-02-02 09:51:07,466 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:07,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 117 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:07,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:51:07,637 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,637 INFO L182 omatonBuilderFactory]: Interpolants [4045#true, 4046#false, 4047#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 4048#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 4049#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 4050#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 4051#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 4052#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 4053#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 4054#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 4055#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 8)), 4056#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 7)), 4057#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 4058#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 4059#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 4060#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 4061#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 4062#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 4063#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 537 backedges. 117 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:51:07,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:51:07,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:51:07,638 INFO L87 Difference]: Start difference. First operand 111 states and 128 transitions. Second operand 19 states. [2018-02-02 09:51:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:07,791 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2018-02-02 09:51:07,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 09:51:07,792 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 105 [2018-02-02 09:51:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:07,792 INFO L225 Difference]: With dead ends: 180 [2018-02-02 09:51:07,792 INFO L226 Difference]: Without dead ends: 133 [2018-02-02 09:51:07,793 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:51:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-02 09:51:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-02-02 09:51:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 09:51:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 143 transitions. [2018-02-02 09:51:07,794 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 143 transitions. Word has length 105 [2018-02-02 09:51:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:07,794 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 143 transitions. [2018-02-02 09:51:07,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:51:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 143 transitions. [2018-02-02 09:51:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-02-02 09:51:07,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:07,795 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 14, 14, 14, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:07,795 INFO L371 AbstractCegarLoop]: === Iteration 24 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1544913787, now seen corresponding path program 14 times [2018-02-02 09:51:07,796 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:07,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 149 proven. 471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,976 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:07,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 09:51:07,976 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,976 INFO L182 omatonBuilderFactory]: Interpolants [4384#true, 4385#false, 4386#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 4387#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 4388#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 4389#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 4390#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 4391#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 4392#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 4393#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 4394#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 36) (select |#length| SelectionSort_~a.base)), 4395#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 32) (select |#length| SelectionSort_~a.base)), 4396#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 4397#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 4398#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 4399#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 4400#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 4401#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 4402#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 4403#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 149 proven. 471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:07,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 09:51:07,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 09:51:07,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:51:07,977 INFO L87 Difference]: Start difference. First operand 123 states and 143 transitions. Second operand 20 states. [2018-02-02 09:51:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:08,341 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2018-02-02 09:51:08,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:51:08,341 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 111 [2018-02-02 09:51:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:08,342 INFO L225 Difference]: With dead ends: 126 [2018-02-02 09:51:08,342 INFO L226 Difference]: Without dead ends: 126 [2018-02-02 09:51:08,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:51:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-02 09:51:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-02-02 09:51:08,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-02 09:51:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2018-02-02 09:51:08,343 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 111 [2018-02-02 09:51:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:08,344 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2018-02-02 09:51:08,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 09:51:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2018-02-02 09:51:08,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-02-02 09:51:08,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:08,344 INFO L351 BasicCegarLoop]: trace histogram [17, 16, 15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:08,345 INFO L371 AbstractCegarLoop]: === Iteration 25 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:08,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1300890073, now seen corresponding path program 15 times [2018-02-02 09:51:08,345 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:08,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 157 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:08,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 09:51:08,508 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,509 INFO L182 omatonBuilderFactory]: Interpolants [4676#true, 4677#false, 4678#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 4679#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 4680#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 4681#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 4682#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 4683#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 4684#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 4685#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 4686#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 4687#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 9)), 4688#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 8)), 4689#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 4690#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 4691#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 4692#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 4693#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 4694#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 4695#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 4696#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 157 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:51:08,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:51:08,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:51:08,509 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand 21 states. [2018-02-02 09:51:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:08,672 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2018-02-02 09:51:08,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:51:08,673 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-02-02 09:51:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:08,673 INFO L225 Difference]: With dead ends: 198 [2018-02-02 09:51:08,673 INFO L226 Difference]: Without dead ends: 145 [2018-02-02 09:51:08,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:51:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-02-02 09:51:08,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2018-02-02 09:51:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:51:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2018-02-02 09:51:08,675 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 117 [2018-02-02 09:51:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:08,675 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2018-02-02 09:51:08,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:51:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2018-02-02 09:51:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-02-02 09:51:08,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:08,676 INFO L351 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 16, 16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:08,676 INFO L371 AbstractCegarLoop]: === Iteration 26 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:08,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1393467205, now seen corresponding path program 16 times [2018-02-02 09:51:08,677 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:08,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 194 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:08,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-02 09:51:08,940 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,941 INFO L182 omatonBuilderFactory]: Interpolants [5056#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 5057#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 5058#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 5059#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 5060#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 40) (select |#length| SelectionSort_~a.base)), 5061#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 36) (select |#length| SelectionSort_~a.base)), 5062#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 5063#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 5064#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 5065#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 5066#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 5067#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 5068#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 5069#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5070#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5049#true, 5050#false, 5051#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 5052#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 5053#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 5054#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 5055#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0)] [2018-02-02 09:51:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 804 backedges. 194 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:08,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:51:08,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:51:08,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:51:08,942 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand 22 states. [2018-02-02 09:51:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:09,406 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-02-02 09:51:09,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:51:09,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 123 [2018-02-02 09:51:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:09,406 INFO L225 Difference]: With dead ends: 138 [2018-02-02 09:51:09,406 INFO L226 Difference]: Without dead ends: 138 [2018-02-02 09:51:09,407 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=868, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:51:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-02-02 09:51:09,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-02-02 09:51:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 09:51:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2018-02-02 09:51:09,408 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 123 [2018-02-02 09:51:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:09,409 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2018-02-02 09:51:09,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:51:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2018-02-02 09:51:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-02-02 09:51:09,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:09,409 INFO L351 BasicCegarLoop]: trace histogram [19, 18, 17, 17, 17, 17, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:09,409 INFO L371 AbstractCegarLoop]: === Iteration 27 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1379472537, now seen corresponding path program 17 times [2018-02-02 09:51:09,410 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:09,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:09,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 203 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:09,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:09,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:51:09,610 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:09,610 INFO L182 omatonBuilderFactory]: Interpolants [5376#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 5377#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 5378#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 5379#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 5380#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 5381#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 10)), 5382#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 9)), 5383#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 5384#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 5385#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 5386#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 5387#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 5388#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 5389#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 5390#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 5391#(<= SelectionSort_~array_size SelectionSort_~j~0), 5369#true, 5370#false, 5371#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 5372#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 5373#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 5374#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 5375#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-02 09:51:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 203 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:09,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:51:09,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:51:09,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-02-02 09:51:09,611 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand 23 states. [2018-02-02 09:51:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:09,783 INFO L93 Difference]: Finished difference Result 216 states and 250 transitions. [2018-02-02 09:51:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:51:09,783 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-02-02 09:51:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:09,784 INFO L225 Difference]: With dead ends: 216 [2018-02-02 09:51:09,784 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 09:51:09,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:51:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 09:51:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 147. [2018-02-02 09:51:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 09:51:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2018-02-02 09:51:09,786 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 129 [2018-02-02 09:51:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:09,786 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2018-02-02 09:51:09,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:51:09,786 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2018-02-02 09:51:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-02-02 09:51:09,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:09,787 INFO L351 BasicCegarLoop]: trace histogram [20, 19, 18, 18, 18, 18, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:09,787 INFO L371 AbstractCegarLoop]: === Iteration 28 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 738258949, now seen corresponding path program 18 times [2018-02-02 09:51:09,788 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:09,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 245 proven. 767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,092 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:10,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 09:51:10,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,092 INFO L182 omatonBuilderFactory]: Interpolants [5792#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 5793#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 5794#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 5795#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 5796#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 5797#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 5798#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5799#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 5776#true, 5777#false, 5778#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 5779#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 5780#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 5781#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 5782#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 5783#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 5784#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 5785#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 5786#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 5787#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 5788#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 44) (select |#length| SelectionSort_~a.base)), 5789#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 40) (select |#length| SelectionSort_~a.base)), 5790#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 5791#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base))] [2018-02-02 09:51:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 245 proven. 767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 09:51:10,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 09:51:10,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:51:10,093 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 24 states. [2018-02-02 09:51:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:10,616 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2018-02-02 09:51:10,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:51:10,616 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 135 [2018-02-02 09:51:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:10,617 INFO L225 Difference]: With dead ends: 150 [2018-02-02 09:51:10,617 INFO L226 Difference]: Without dead ends: 150 [2018-02-02 09:51:10,617 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:51:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-02 09:51:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-02-02 09:51:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 09:51:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 170 transitions. [2018-02-02 09:51:10,620 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 170 transitions. Word has length 135 [2018-02-02 09:51:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:10,620 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 170 transitions. [2018-02-02 09:51:10,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 09:51:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2018-02-02 09:51:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-02-02 09:51:10,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:10,621 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 19, 19, 19, 19, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:10,621 INFO L371 AbstractCegarLoop]: === Iteration 29 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash -858008231, now seen corresponding path program 19 times [2018-02-02 09:51:10,622 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:10,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 255 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:10,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:51:10,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,925 INFO L182 omatonBuilderFactory]: Interpolants [6144#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 6145#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 6146#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 6147#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 6148#(<= SelectionSort_~array_size SelectionSort_~j~0), 6124#true, 6125#false, 6126#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 6127#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 6128#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 6129#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 6130#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 6131#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 6132#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 6133#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 6134#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 6135#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 6136#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 6137#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 11)), 6138#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 10)), 6139#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 6140#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 6141#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 6142#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 6143#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-02 09:51:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 255 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:10,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 09:51:10,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 09:51:10,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:51:10,926 INFO L87 Difference]: Start difference. First operand 147 states and 170 transitions. Second operand 25 states. [2018-02-02 09:51:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:11,172 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2018-02-02 09:51:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:51:11,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 141 [2018-02-02 09:51:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:11,172 INFO L225 Difference]: With dead ends: 234 [2018-02-02 09:51:11,173 INFO L226 Difference]: Without dead ends: 169 [2018-02-02 09:51:11,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=937, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:51:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-02-02 09:51:11,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2018-02-02 09:51:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 09:51:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 185 transitions. [2018-02-02 09:51:11,175 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 185 transitions. Word has length 141 [2018-02-02 09:51:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:11,175 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 185 transitions. [2018-02-02 09:51:11,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 09:51:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 185 transitions. [2018-02-02 09:51:11,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-02-02 09:51:11,176 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:11,176 INFO L351 BasicCegarLoop]: trace histogram [22, 21, 20, 20, 20, 20, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:11,177 INFO L371 AbstractCegarLoop]: === Iteration 30 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash -369496379, now seen corresponding path program 20 times [2018-02-02 09:51:11,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:11,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 302 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:11,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:11,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 09:51:11,480 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:11,481 INFO L182 omatonBuilderFactory]: Interpolants [6565#true, 6566#false, 6567#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 6568#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 6569#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 6570#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 6571#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 6572#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 6573#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 6574#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 6575#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 6576#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 6577#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 6578#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 48) (select |#length| SelectionSort_~a.base)), 6579#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 44) (select |#length| SelectionSort_~a.base)), 6580#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 6581#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 6582#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 6583#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 6584#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 6585#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 6586#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 6587#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 6588#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 6589#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 6590#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 302 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:11,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:51:11,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:51:11,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:51:11,481 INFO L87 Difference]: Start difference. First operand 159 states and 185 transitions. Second operand 26 states. [2018-02-02 09:51:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:12,267 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 09:51:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 09:51:12,267 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2018-02-02 09:51:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:12,268 INFO L225 Difference]: With dead ends: 162 [2018-02-02 09:51:12,268 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 09:51:12,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:51:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 09:51:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-02-02 09:51:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-02 09:51:12,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2018-02-02 09:51:12,270 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 147 [2018-02-02 09:51:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:12,271 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2018-02-02 09:51:12,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:51:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2018-02-02 09:51:12,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-02-02 09:51:12,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:12,271 INFO L351 BasicCegarLoop]: trace histogram [23, 22, 21, 21, 21, 21, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:12,271 INFO L371 AbstractCegarLoop]: === Iteration 31 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:12,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1279968281, now seen corresponding path program 21 times [2018-02-02 09:51:12,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:12,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 313 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:12,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:12,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:51:12,553 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:12,553 INFO L182 omatonBuilderFactory]: Interpolants [6941#true, 6942#false, 6943#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 6944#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 6945#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 6946#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 6947#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 6948#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 6949#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 6950#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 6951#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 6952#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 6953#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 6954#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 6955#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 12)), 6956#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 11)), 6957#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 6958#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 6959#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 6960#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 6961#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 6962#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 6963#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 6964#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 6965#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 6966#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 6967#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 313 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:12,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:51:12,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:51:12,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:51:12,555 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand 27 states. [2018-02-02 09:51:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:12,835 INFO L93 Difference]: Finished difference Result 252 states and 292 transitions. [2018-02-02 09:51:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 09:51:12,836 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 153 [2018-02-02 09:51:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:12,836 INFO L225 Difference]: With dead ends: 252 [2018-02-02 09:51:12,836 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 09:51:12,837 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:51:12,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 09:51:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 171. [2018-02-02 09:51:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 09:51:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2018-02-02 09:51:12,838 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 153 [2018-02-02 09:51:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:12,839 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2018-02-02 09:51:12,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:51:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2018-02-02 09:51:12,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-02-02 09:51:12,839 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:12,839 INFO L351 BasicCegarLoop]: trace histogram [24, 23, 22, 22, 22, 22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:12,839 INFO L371 AbstractCegarLoop]: === Iteration 32 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash 391256965, now seen corresponding path program 22 times [2018-02-02 09:51:12,840 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:12,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 365 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:13,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:13,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 09:51:13,151 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:13,151 INFO L182 omatonBuilderFactory]: Interpolants [7424#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 7425#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 7426#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 7427#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 7428#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 7429#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 7430#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 52) (select |#length| SelectionSort_~a.base)), 7431#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 48) (select |#length| SelectionSort_~a.base)), 7432#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 7433#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 7434#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 7435#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 7436#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 7437#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 7438#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 7439#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 7440#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 7441#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 7442#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 7443#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 7416#true, 7417#false, 7418#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 7419#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 7420#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 7421#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 7422#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 7423#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0)] [2018-02-02 09:51:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 365 proven. 1135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:13,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 09:51:13,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 09:51:13,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:51:13,152 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand 28 states. [2018-02-02 09:51:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:13,912 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2018-02-02 09:51:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 09:51:13,912 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 159 [2018-02-02 09:51:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:13,913 INFO L225 Difference]: With dead ends: 174 [2018-02-02 09:51:13,914 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 09:51:13,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 09:51:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 09:51:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-02-02 09:51:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 09:51:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2018-02-02 09:51:13,917 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 159 [2018-02-02 09:51:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:13,917 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2018-02-02 09:51:13,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 09:51:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2018-02-02 09:51:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-02 09:51:13,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:13,918 INFO L351 BasicCegarLoop]: trace histogram [25, 24, 23, 23, 23, 23, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:13,918 INFO L371 AbstractCegarLoop]: === Iteration 33 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:13,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1451122905, now seen corresponding path program 23 times [2018-02-02 09:51:13,919 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:13,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 377 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:14,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:51:14,236 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,236 INFO L182 omatonBuilderFactory]: Interpolants [7820#true, 7821#false, 7822#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 7823#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 7824#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 7825#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 7826#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 7827#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 7828#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 7829#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 7830#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 7831#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 7832#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 7833#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 7834#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 7835#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 13)), 7836#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 12)), 7837#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 7838#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 7839#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 7840#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 7841#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 7842#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 7843#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 7844#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 7845#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 7846#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 7847#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 7848#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1637 backedges. 377 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 09:51:14,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 09:51:14,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:51:14,237 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand 29 states. [2018-02-02 09:51:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:14,588 INFO L93 Difference]: Finished difference Result 270 states and 313 transitions. [2018-02-02 09:51:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 09:51:14,588 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 165 [2018-02-02 09:51:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:14,589 INFO L225 Difference]: With dead ends: 270 [2018-02-02 09:51:14,589 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 09:51:14,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 09:51:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 09:51:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 183. [2018-02-02 09:51:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 09:51:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2018-02-02 09:51:14,591 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 165 [2018-02-02 09:51:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:14,591 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2018-02-02 09:51:14,591 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 09:51:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2018-02-02 09:51:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-02-02 09:51:14,592 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:14,592 INFO L351 BasicCegarLoop]: trace histogram [26, 25, 24, 24, 24, 24, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:14,592 INFO L371 AbstractCegarLoop]: === Iteration 34 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -176032187, now seen corresponding path program 24 times [2018-02-02 09:51:14,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:14,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 434 proven. 1346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:14,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 09:51:14,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,926 INFO L182 omatonBuilderFactory]: Interpolants [8329#true, 8330#false, 8331#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 8332#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 8333#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 8334#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 8335#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 8336#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 8337#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 8338#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 8339#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 8340#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 8341#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 8342#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 8343#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 8344#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 56) (select |#length| SelectionSort_~a.base)), 8345#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 52) (select |#length| SelectionSort_~a.base)), 8346#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 8347#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 8348#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 8349#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 8350#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 8351#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 8352#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 8353#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 8354#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 8355#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 8356#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 8357#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 8358#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 434 proven. 1346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:14,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 09:51:14,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 09:51:14,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:51:14,927 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand 30 states. [2018-02-02 09:51:15,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:15,759 INFO L93 Difference]: Finished difference Result 186 states and 215 transitions. [2018-02-02 09:51:15,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 09:51:15,759 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 171 [2018-02-02 09:51:15,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:15,760 INFO L225 Difference]: With dead ends: 186 [2018-02-02 09:51:15,760 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 09:51:15,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=462, Invalid=1608, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:51:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 09:51:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2018-02-02 09:51:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 09:51:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2018-02-02 09:51:15,762 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 171 [2018-02-02 09:51:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:15,762 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2018-02-02 09:51:15,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 09:51:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2018-02-02 09:51:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-02-02 09:51:15,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:15,763 INFO L351 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 25, 25, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:15,763 INFO L371 AbstractCegarLoop]: === Iteration 35 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:15,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1351560089, now seen corresponding path program 25 times [2018-02-02 09:51:15,763 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:15,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 447 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:16,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:16,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 09:51:16,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:16,051 INFO L182 omatonBuilderFactory]: Interpolants [8768#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 8769#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 8770#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 8771#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 8772#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 8773#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 8774#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 8775#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 8776#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 8777#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 14)), 8778#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 13)), 8779#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 8780#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 8781#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 8782#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 8783#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 8784#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 8785#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 8786#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 8787#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 8788#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 8789#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 8790#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 8791#(<= SelectionSort_~array_size SelectionSort_~j~0), 8761#true, 8762#false, 8763#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 8764#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 8765#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 8766#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 8767#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5))] [2018-02-02 09:51:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1929 backedges. 447 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:16,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 09:51:16,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 09:51:16,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:51:16,052 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand 31 states. [2018-02-02 09:51:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:16,288 INFO L93 Difference]: Finished difference Result 288 states and 334 transitions. [2018-02-02 09:51:16,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:51:16,288 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 177 [2018-02-02 09:51:16,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:16,289 INFO L225 Difference]: With dead ends: 288 [2018-02-02 09:51:16,289 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 09:51:16,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 09:51:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 09:51:16,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 195. [2018-02-02 09:51:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 09:51:16,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 227 transitions. [2018-02-02 09:51:16,292 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 227 transitions. Word has length 177 [2018-02-02 09:51:16,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:16,292 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 227 transitions. [2018-02-02 09:51:16,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 09:51:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 227 transitions. [2018-02-02 09:51:16,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-02-02 09:51:16,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:16,293 INFO L351 BasicCegarLoop]: trace histogram [28, 27, 26, 26, 26, 26, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:16,294 INFO L371 AbstractCegarLoop]: === Iteration 36 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:16,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1696726789, now seen corresponding path program 26 times [2018-02-02 09:51:16,294 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:16,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 509 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:16,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:16,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-02-02 09:51:16,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:16,680 INFO L182 omatonBuilderFactory]: Interpolants [9304#true, 9305#false, 9306#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 9307#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 9308#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 9309#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 9310#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 9311#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 9312#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 9313#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 9314#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 9315#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 9316#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 9317#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 9318#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 9319#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 9320#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 60) (select |#length| SelectionSort_~a.base)), 9321#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 56) (select |#length| SelectionSort_~a.base)), 9322#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 9323#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 9324#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 9325#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 9326#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 9327#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 9328#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 9329#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 9330#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 9331#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 9332#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 9333#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 9334#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 9335#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 509 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:16,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 09:51:16,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 09:51:16,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:51:16,681 INFO L87 Difference]: Start difference. First operand 195 states and 227 transitions. Second operand 32 states. [2018-02-02 09:51:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:17,532 INFO L93 Difference]: Finished difference Result 198 states and 229 transitions. [2018-02-02 09:51:17,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:51:17,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 183 [2018-02-02 09:51:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:17,533 INFO L225 Difference]: With dead ends: 198 [2018-02-02 09:51:17,533 INFO L226 Difference]: Without dead ends: 198 [2018-02-02 09:51:17,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=524, Invalid=1828, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 09:51:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-02-02 09:51:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2018-02-02 09:51:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 09:51:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 226 transitions. [2018-02-02 09:51:17,534 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 226 transitions. Word has length 183 [2018-02-02 09:51:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:17,535 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 226 transitions. [2018-02-02 09:51:17,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 09:51:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 226 transitions. [2018-02-02 09:51:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-02-02 09:51:17,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:17,535 INFO L351 BasicCegarLoop]: trace histogram [29, 28, 27, 27, 27, 27, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:17,535 INFO L371 AbstractCegarLoop]: === Iteration 37 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1723180121, now seen corresponding path program 27 times [2018-02-02 09:51:17,536 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:17,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 523 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:17,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:17,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:51:17,860 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:17,861 INFO L182 omatonBuilderFactory]: Interpolants [9792#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 9793#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 9794#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 9795#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 9796#(<= SelectionSort_~array_size SelectionSort_~j~0), 9764#true, 9765#false, 9766#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 9767#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 9768#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 9769#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 9770#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 9771#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 9772#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 9773#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 9774#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 9775#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 9776#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 9777#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 9778#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 9779#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 9780#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 9781#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 15)), 9782#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 14)), 9783#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 9784#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 9785#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 9786#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 9787#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 9788#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 9789#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 9790#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 9791#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5))] [2018-02-02 09:51:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2245 backedges. 523 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:17,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 09:51:17,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 09:51:17,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:51:17,862 INFO L87 Difference]: Start difference. First operand 195 states and 226 transitions. Second operand 33 states. [2018-02-02 09:51:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:18,179 INFO L93 Difference]: Finished difference Result 306 states and 355 transitions. [2018-02-02 09:51:18,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:51:18,180 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 189 [2018-02-02 09:51:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:18,180 INFO L225 Difference]: With dead ends: 306 [2018-02-02 09:51:18,180 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 09:51:18,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=559, Invalid=1697, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:51:18,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 09:51:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 207. [2018-02-02 09:51:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 09:51:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-02-02 09:51:18,182 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 189 [2018-02-02 09:51:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:18,183 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-02-02 09:51:18,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 09:51:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-02-02 09:51:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-02-02 09:51:18,183 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:18,183 INFO L351 BasicCegarLoop]: trace histogram [30, 29, 28, 28, 28, 28, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:18,183 INFO L371 AbstractCegarLoop]: === Iteration 38 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash -840256059, now seen corresponding path program 28 times [2018-02-02 09:51:18,184 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:18,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:18,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 590 proven. 1822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:18,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:18,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 09:51:18,674 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:18,674 INFO L182 omatonBuilderFactory]: Interpolants [10368#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 10369#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 10370#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 10371#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 10372#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 10373#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 10374#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 10341#true, 10342#false, 10343#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 10344#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 10345#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 10346#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 10347#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 10348#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 10349#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 10350#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 10351#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 10352#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 10353#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 10354#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 10355#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 10356#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 10357#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 10358#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 64) (select |#length| SelectionSort_~a.base)), 10359#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 60) (select |#length| SelectionSort_~a.base)), 10360#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 10361#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 10362#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 10363#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 10364#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 10365#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 10366#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 10367#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base))] [2018-02-02 09:51:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 590 proven. 1822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:18,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 09:51:18,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 09:51:18,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=872, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:51:18,675 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 34 states. [2018-02-02 09:51:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:19,352 INFO L93 Difference]: Finished difference Result 210 states and 243 transitions. [2018-02-02 09:51:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 09:51:19,352 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 195 [2018-02-02 09:51:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:19,353 INFO L225 Difference]: With dead ends: 210 [2018-02-02 09:51:19,353 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 09:51:19,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=590, Invalid=2062, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:51:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 09:51:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-02-02 09:51:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 09:51:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 240 transitions. [2018-02-02 09:51:19,355 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 240 transitions. Word has length 195 [2018-02-02 09:51:19,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:19,356 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 240 transitions. [2018-02-02 09:51:19,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 09:51:19,356 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 240 transitions. [2018-02-02 09:51:19,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-02-02 09:51:19,356 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:19,356 INFO L351 BasicCegarLoop]: trace histogram [31, 30, 29, 29, 29, 29, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:19,356 INFO L371 AbstractCegarLoop]: === Iteration 39 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:19,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1951025945, now seen corresponding path program 29 times [2018-02-02 09:51:19,357 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:19,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2585 backedges. 605 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:19,778 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:19,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 09:51:19,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:19,779 INFO L182 omatonBuilderFactory]: Interpolants [10829#true, 10830#false, 10831#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 10832#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 10833#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 10834#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 10835#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 10836#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 10837#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 10838#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 10839#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 10840#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 10841#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 10842#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 10843#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 10844#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 10845#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 10846#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 10847#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 16)), 10848#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 15)), 10849#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 10850#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 10851#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 10852#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 10853#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 10854#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 10855#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 10856#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 10857#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 10858#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 10859#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 10860#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 10861#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 10862#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 10863#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2585 backedges. 605 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:19,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 09:51:19,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 09:51:19,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 09:51:19,779 INFO L87 Difference]: Start difference. First operand 207 states and 240 transitions. Second operand 35 states. [2018-02-02 09:51:20,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:20,142 INFO L93 Difference]: Finished difference Result 324 states and 376 transitions. [2018-02-02 09:51:20,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-02 09:51:20,142 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 201 [2018-02-02 09:51:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:20,143 INFO L225 Difference]: With dead ends: 324 [2018-02-02 09:51:20,143 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 09:51:20,143 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 09:51:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 09:51:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-02-02 09:51:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 09:51:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2018-02-02 09:51:20,145 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 201 [2018-02-02 09:51:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:20,145 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2018-02-02 09:51:20,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 09:51:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2018-02-02 09:51:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-02-02 09:51:20,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:20,146 INFO L351 BasicCegarLoop]: trace histogram [32, 31, 30, 30, 30, 30, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:20,146 INFO L371 AbstractCegarLoop]: === Iteration 40 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash 112499333, now seen corresponding path program 30 times [2018-02-02 09:51:20,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:20,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2764 backedges. 677 proven. 2087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:20,769 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:20,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-02 09:51:20,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:20,769 INFO L182 omatonBuilderFactory]: Interpolants [11456#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 11457#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 11458#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 68) (select |#length| SelectionSort_~a.base)), 11459#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 64) (select |#length| SelectionSort_~a.base)), 11460#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 11461#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 11462#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 11463#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 11464#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 11465#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 11466#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 11467#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 11468#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 11469#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 11470#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 11471#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 11472#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 11473#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 11474#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 11475#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 11440#true, 11441#false, 11442#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 11443#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 11444#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 11445#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 11446#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 11447#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 11448#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 11449#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 11450#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 11451#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 11452#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 11453#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 11454#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 11455#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0)] [2018-02-02 09:51:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2764 backedges. 677 proven. 2087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:20,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 09:51:20,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 09:51:20,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=978, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 09:51:20,770 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand 36 states. [2018-02-02 09:51:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:21,820 INFO L93 Difference]: Finished difference Result 222 states and 257 transitions. [2018-02-02 09:51:21,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 09:51:21,842 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-02-02 09:51:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:21,843 INFO L225 Difference]: With dead ends: 222 [2018-02-02 09:51:21,843 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 09:51:21,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=660, Invalid=2310, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 09:51:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 09:51:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2018-02-02 09:51:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 09:51:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 254 transitions. [2018-02-02 09:51:21,845 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 254 transitions. Word has length 207 [2018-02-02 09:51:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:21,845 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 254 transitions. [2018-02-02 09:51:21,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 09:51:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 254 transitions. [2018-02-02 09:51:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-02-02 09:51:21,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:21,846 INFO L351 BasicCegarLoop]: trace histogram [33, 32, 31, 31, 31, 31, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:21,846 INFO L371 AbstractCegarLoop]: === Iteration 41 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash -339370023, now seen corresponding path program 31 times [2018-02-02 09:51:21,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:21,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2949 backedges. 693 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:22,243 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:22,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 09:51:22,244 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:22,244 INFO L182 omatonBuilderFactory]: Interpolants [11968#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 11969#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 11970#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 11971#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 11972#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 11973#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 11974#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 11975#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 17)), 11976#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 16)), 11977#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 11978#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 11979#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 11980#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 11981#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 11982#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 11983#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 11984#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 11985#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 11986#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 11987#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 11988#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 11989#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 11990#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 11991#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 11992#(<= SelectionSort_~array_size SelectionSort_~j~0), 11956#true, 11957#false, 11958#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 11959#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 11960#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 11961#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 11962#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 11963#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 11964#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 11965#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 11966#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 11967#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10))] [2018-02-02 09:51:22,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2949 backedges. 693 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:22,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-02 09:51:22,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-02 09:51:22,245 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 09:51:22,245 INFO L87 Difference]: Start difference. First operand 219 states and 254 transitions. Second operand 37 states. [2018-02-02 09:51:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:22,578 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-02-02 09:51:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 09:51:22,578 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 213 [2018-02-02 09:51:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:22,579 INFO L225 Difference]: With dead ends: 342 [2018-02-02 09:51:22,579 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 09:51:22,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=701, Invalid=2161, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 09:51:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 09:51:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 231. [2018-02-02 09:51:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 09:51:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 269 transitions. [2018-02-02 09:51:22,581 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 269 transitions. Word has length 213 [2018-02-02 09:51:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:22,582 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 269 transitions. [2018-02-02 09:51:22,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-02 09:51:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 269 transitions. [2018-02-02 09:51:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-02-02 09:51:22,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:22,582 INFO L351 BasicCegarLoop]: trace histogram [34, 33, 32, 32, 32, 32, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:22,582 INFO L371 AbstractCegarLoop]: === Iteration 42 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1031286085, now seen corresponding path program 32 times [2018-02-02 09:51:22,583 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:22,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3140 backedges. 770 proven. 2370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:23,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:23,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-02-02 09:51:23,158 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:23,158 INFO L182 omatonBuilderFactory]: Interpolants [12608#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 12609#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 12610#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 12611#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 12612#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 12613#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 12614#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 12615#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 12616#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 12617#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 12618#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 12619#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 12620#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 72) (select |#length| SelectionSort_~a.base)), 12621#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 68) (select |#length| SelectionSort_~a.base)), 12622#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 12623#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 12624#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 12625#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 12626#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 12627#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 12628#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 12629#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 12630#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 12631#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 12632#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 12633#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 12634#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 12635#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 12636#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 12637#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 12638#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 12601#true, 12602#false, 12603#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 12604#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 12605#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 12606#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 12607#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0)] [2018-02-02 09:51:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3140 backedges. 770 proven. 2370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:23,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-02 09:51:23,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-02 09:51:23,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1090, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 09:51:23,159 INFO L87 Difference]: Start difference. First operand 231 states and 269 transitions. Second operand 38 states. [2018-02-02 09:51:24,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:24,296 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2018-02-02 09:51:24,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-02 09:51:24,296 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 219 [2018-02-02 09:51:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:24,297 INFO L225 Difference]: With dead ends: 234 [2018-02-02 09:51:24,297 INFO L226 Difference]: Without dead ends: 234 [2018-02-02 09:51:24,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=734, Invalid=2572, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 09:51:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-02 09:51:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-02-02 09:51:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-02-02 09:51:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2018-02-02 09:51:24,299 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 219 [2018-02-02 09:51:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:24,300 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2018-02-02 09:51:24,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-02 09:51:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2018-02-02 09:51:24,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-02-02 09:51:24,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:24,300 INFO L351 BasicCegarLoop]: trace histogram [35, 34, 33, 33, 33, 33, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:24,300 INFO L371 AbstractCegarLoop]: === Iteration 43 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:24,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1094704487, now seen corresponding path program 33 times [2018-02-02 09:51:24,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:24,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 787 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:24,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:24,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 09:51:24,752 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:24,753 INFO L182 omatonBuilderFactory]: Interpolants [13145#true, 13146#false, 13147#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 13148#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 13149#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 13150#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 13151#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 13152#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 13153#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 13154#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 13155#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 13156#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 13157#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 13158#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 13159#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 13160#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 13161#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 13162#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 13163#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 13164#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 13165#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 18)), 13166#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 17)), 13167#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 13168#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 13169#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 13170#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 13171#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 13172#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 13173#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 13174#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 13175#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 13176#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 13177#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 13178#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 13179#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 13180#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 13181#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 13182#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 13183#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 787 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:24,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 09:51:24,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 09:51:24,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1117, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:51:24,754 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand 39 states. [2018-02-02 09:51:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:25,197 INFO L93 Difference]: Finished difference Result 360 states and 418 transitions. [2018-02-02 09:51:25,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-02 09:51:25,197 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 225 [2018-02-02 09:51:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:25,198 INFO L225 Difference]: With dead ends: 360 [2018-02-02 09:51:25,198 INFO L226 Difference]: Without dead ends: 253 [2018-02-02 09:51:25,199 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=778, Invalid=2414, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 09:51:25,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-02-02 09:51:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2018-02-02 09:51:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 09:51:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 283 transitions. [2018-02-02 09:51:25,201 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 283 transitions. Word has length 225 [2018-02-02 09:51:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:25,202 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 283 transitions. [2018-02-02 09:51:25,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 09:51:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 283 transitions. [2018-02-02 09:51:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-02-02 09:51:25,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:25,202 INFO L351 BasicCegarLoop]: trace histogram [36, 35, 34, 34, 34, 34, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:25,202 INFO L371 AbstractCegarLoop]: === Iteration 44 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:25,203 INFO L82 PathProgramCache]: Analyzing trace with hash -548540923, now seen corresponding path program 34 times [2018-02-02 09:51:25,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:25,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:25,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 869 proven. 2671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:25,825 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:25,825 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-02-02 09:51:25,825 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:25,826 INFO L182 omatonBuilderFactory]: Interpolants [13824#true, 13825#false, 13826#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 13827#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 13828#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 13829#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 13830#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 13831#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 13832#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 13833#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 13834#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 13835#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 13836#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 13837#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 13838#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 13839#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 13840#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 13841#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 13842#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 13843#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 13844#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 76) (select |#length| SelectionSort_~a.base)), 13845#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 72) (select |#length| SelectionSort_~a.base)), 13846#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 13847#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 13848#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 13849#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 13850#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 13851#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 13852#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 13853#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 13854#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 13855#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 13856#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 13857#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 13858#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 13859#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 13860#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 13861#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 13862#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 13863#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 869 proven. 2671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:25,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 09:51:25,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 09:51:25,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1208, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 09:51:25,827 INFO L87 Difference]: Start difference. First operand 243 states and 283 transitions. Second operand 40 states. [2018-02-02 09:51:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:27,035 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2018-02-02 09:51:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 09:51:27,050 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 231 [2018-02-02 09:51:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:27,051 INFO L225 Difference]: With dead ends: 246 [2018-02-02 09:51:27,051 INFO L226 Difference]: Without dead ends: 246 [2018-02-02 09:51:27,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=812, Invalid=2848, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 09:51:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-02-02 09:51:27,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2018-02-02 09:51:27,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 09:51:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 282 transitions. [2018-02-02 09:51:27,054 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 282 transitions. Word has length 231 [2018-02-02 09:51:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:27,054 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 282 transitions. [2018-02-02 09:51:27,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 09:51:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 282 transitions. [2018-02-02 09:51:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-02-02 09:51:27,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:27,054 INFO L351 BasicCegarLoop]: trace histogram [37, 36, 35, 35, 35, 35, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:27,055 INFO L371 AbstractCegarLoop]: === Iteration 45 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1173508953, now seen corresponding path program 35 times [2018-02-02 09:51:27,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:27,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 887 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:27,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:27,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 09:51:27,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:27,542 INFO L182 omatonBuilderFactory]: Interpolants [14400#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 14401#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 14402#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 14403#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 14404#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 14405#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 14406#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 14407#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 14408#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 14409#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 14410#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 14411#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 14412#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 14413#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 14414#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 14415#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 14416#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 14417#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 19)), 14418#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 18)), 14419#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 14420#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 14421#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 14422#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 14423#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 14424#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 14425#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 14426#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 14427#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 14428#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 14429#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 14430#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 14431#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 14432#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 14433#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 14434#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 14435#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 14436#(<= SelectionSort_~array_size SelectionSort_~j~0), 14396#true, 14397#false, 14398#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 14399#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-02 09:51:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3749 backedges. 887 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:27,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-02 09:51:27,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-02 09:51:27,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=1236, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 09:51:27,543 INFO L87 Difference]: Start difference. First operand 243 states and 282 transitions. Second operand 41 states. [2018-02-02 09:51:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:27,947 INFO L93 Difference]: Finished difference Result 378 states and 439 transitions. [2018-02-02 09:51:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 09:51:27,947 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 237 [2018-02-02 09:51:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:27,948 INFO L225 Difference]: With dead ends: 378 [2018-02-02 09:51:27,948 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 09:51:27,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=859, Invalid=2681, Unknown=0, NotChecked=0, Total=3540 [2018-02-02 09:51:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 09:51:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 255. [2018-02-02 09:51:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 09:51:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 297 transitions. [2018-02-02 09:51:27,950 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 297 transitions. Word has length 237 [2018-02-02 09:51:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:27,951 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 297 transitions. [2018-02-02 09:51:27,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-02 09:51:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 297 transitions. [2018-02-02 09:51:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-02-02 09:51:27,951 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:27,951 INFO L351 BasicCegarLoop]: trace histogram [38, 37, 36, 36, 36, 36, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:27,951 INFO L371 AbstractCegarLoop]: === Iteration 46 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:27,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2140250939, now seen corresponding path program 36 times [2018-02-02 09:51:27,952 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:27,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3964 backedges. 974 proven. 2990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:28,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:28,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-02-02 09:51:28,572 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:28,573 INFO L182 omatonBuilderFactory]: Interpolants [15109#true, 15110#false, 15111#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 15112#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 15113#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 15114#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 15115#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 15116#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 15117#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 15118#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 15119#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 15120#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 15121#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 15122#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 15123#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 15124#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 15125#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 15126#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 15127#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 15128#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 15129#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 15130#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 80) (select |#length| SelectionSort_~a.base)), 15131#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 76) (select |#length| SelectionSort_~a.base)), 15132#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 15133#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 15134#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 15135#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 15136#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 15137#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 15138#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 15139#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 15140#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 15141#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 15142#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 15143#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 15144#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 15145#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 15146#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 15147#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 15148#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 15149#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 15150#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3964 backedges. 974 proven. 2990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:28,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-02 09:51:28,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-02 09:51:28,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 09:51:28,573 INFO L87 Difference]: Start difference. First operand 255 states and 297 transitions. Second operand 42 states. [2018-02-02 09:51:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:29,894 INFO L93 Difference]: Finished difference Result 258 states and 299 transitions. [2018-02-02 09:51:29,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-02-02 09:51:29,894 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 243 [2018-02-02 09:51:29,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:29,895 INFO L225 Difference]: With dead ends: 258 [2018-02-02 09:51:29,895 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 09:51:29,896 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=894, Invalid=3138, Unknown=0, NotChecked=0, Total=4032 [2018-02-02 09:51:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 09:51:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-02-02 09:51:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-02-02 09:51:29,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 296 transitions. [2018-02-02 09:51:29,897 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 296 transitions. Word has length 243 [2018-02-02 09:51:29,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:29,898 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 296 transitions. [2018-02-02 09:51:29,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-02 09:51:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 296 transitions. [2018-02-02 09:51:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-02-02 09:51:29,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:29,899 INFO L351 BasicCegarLoop]: trace histogram [39, 38, 37, 37, 37, 37, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:29,899 INFO L371 AbstractCegarLoop]: === Iteration 47 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:29,899 INFO L82 PathProgramCache]: Analyzing trace with hash 691319321, now seen corresponding path program 37 times [2018-02-02 09:51:29,900 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:29,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4185 backedges. 993 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:30,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:30,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 09:51:30,458 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:30,459 INFO L182 omatonBuilderFactory]: Interpolants [15744#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 15745#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 15746#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 15747#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 15748#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 15749#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 15750#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 15751#(<= SelectionSort_~array_size SelectionSort_~j~0), 15709#true, 15710#false, 15711#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 15712#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 15713#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 15714#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 15715#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 15716#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 15717#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 15718#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 15719#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 15720#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 15721#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 15722#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 15723#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 15724#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 15725#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 15726#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 15727#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 15728#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 15729#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 15730#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 15731#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 20)), 15732#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 19)), 15733#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 15734#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 15735#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 15736#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 15737#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 15738#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 15739#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 15740#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 15741#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 15742#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 15743#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8))] [2018-02-02 09:51:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4185 backedges. 993 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:30,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 09:51:30,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 09:51:30,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1361, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 09:51:30,459 INFO L87 Difference]: Start difference. First operand 255 states and 296 transitions. Second operand 43 states. [2018-02-02 09:51:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:30,937 INFO L93 Difference]: Finished difference Result 396 states and 460 transitions. [2018-02-02 09:51:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 09:51:30,937 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 249 [2018-02-02 09:51:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:30,938 INFO L225 Difference]: With dead ends: 396 [2018-02-02 09:51:30,938 INFO L226 Difference]: Without dead ends: 277 [2018-02-02 09:51:30,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=944, Invalid=2962, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 09:51:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-02-02 09:51:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 267. [2018-02-02 09:51:30,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 09:51:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 311 transitions. [2018-02-02 09:51:30,940 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 311 transitions. Word has length 249 [2018-02-02 09:51:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:30,941 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 311 transitions. [2018-02-02 09:51:30,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 09:51:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 311 transitions. [2018-02-02 09:51:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-02 09:51:30,942 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:30,942 INFO L351 BasicCegarLoop]: trace histogram [40, 39, 38, 38, 38, 38, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:30,942 INFO L371 AbstractCegarLoop]: === Iteration 48 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:30,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1003357819, now seen corresponding path program 38 times [2018-02-02 09:51:30,943 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:30,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4412 backedges. 1085 proven. 3327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:31,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:31,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 09:51:31,709 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:31,710 INFO L182 omatonBuilderFactory]: Interpolants [16456#true, 16457#false, 16458#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 16459#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 16460#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 16461#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 16462#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 16463#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 16464#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 16465#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 16466#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 16467#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 16468#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 16469#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 16470#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 16471#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 16472#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 16473#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 16474#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 16475#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 16476#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 16477#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 16478#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 84) (select |#length| SelectionSort_~a.base)), 16479#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 80) (select |#length| SelectionSort_~a.base)), 16480#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 16481#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 16482#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 16483#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 16484#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 16485#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 16486#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 16487#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 16488#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 16489#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 16490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 16491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 16492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 16493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 16494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 16495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 16496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 16497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 16498#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 16499#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4412 backedges. 1085 proven. 3327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:31,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 09:51:31,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 09:51:31,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=1462, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:51:31,710 INFO L87 Difference]: Start difference. First operand 267 states and 311 transitions. Second operand 44 states. [2018-02-02 09:51:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:33,179 INFO L93 Difference]: Finished difference Result 270 states and 313 transitions. [2018-02-02 09:51:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 09:51:33,179 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 255 [2018-02-02 09:51:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:33,180 INFO L225 Difference]: With dead ends: 270 [2018-02-02 09:51:33,180 INFO L226 Difference]: Without dead ends: 270 [2018-02-02 09:51:33,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=980, Invalid=3442, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 09:51:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-02 09:51:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-02-02 09:51:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 09:51:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 310 transitions. [2018-02-02 09:51:33,183 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 310 transitions. Word has length 255 [2018-02-02 09:51:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:33,183 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 310 transitions. [2018-02-02 09:51:33,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 09:51:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 310 transitions. [2018-02-02 09:51:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-02-02 09:51:33,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:33,184 INFO L351 BasicCegarLoop]: trace histogram [41, 40, 39, 39, 39, 39, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:33,185 INFO L371 AbstractCegarLoop]: === Iteration 49 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1199554265, now seen corresponding path program 39 times [2018-02-02 09:51:33,185 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:33,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 1105 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:33,840 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:33,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 09:51:33,841 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:33,841 INFO L182 omatonBuilderFactory]: Interpolants [17088#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 17089#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 17090#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 17091#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 17092#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 17093#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 17094#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 17095#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 17096#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 17097#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 17098#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 17099#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 17100#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 17101#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 17102#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 17103#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 17104#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 17105#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 17106#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 17107#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 21)), 17108#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 20)), 17109#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 17110#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 17111#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 17112#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 17113#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 17114#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 17115#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 17116#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 17117#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 17118#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 17119#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 17120#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 17121#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 17122#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 17123#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 17124#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 17125#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 17126#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 17127#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 17128#(<= SelectionSort_~array_size SelectionSort_~j~0), 17084#true, 17085#false, 17086#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 17087#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2))] [2018-02-02 09:51:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 1105 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:33,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-02-02 09:51:33,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-02-02 09:51:33,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=1492, Unknown=0, NotChecked=0, Total=1980 [2018-02-02 09:51:33,842 INFO L87 Difference]: Start difference. First operand 267 states and 310 transitions. Second operand 45 states. [2018-02-02 09:51:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:34,441 INFO L93 Difference]: Finished difference Result 414 states and 481 transitions. [2018-02-02 09:51:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 09:51:34,442 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 261 [2018-02-02 09:51:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:34,442 INFO L225 Difference]: With dead ends: 414 [2018-02-02 09:51:34,442 INFO L226 Difference]: Without dead ends: 289 [2018-02-02 09:51:34,443 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 09:51:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-02-02 09:51:34,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 279. [2018-02-02 09:51:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 09:51:34,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 325 transitions. [2018-02-02 09:51:34,446 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 325 transitions. Word has length 261 [2018-02-02 09:51:34,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:34,446 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 325 transitions. [2018-02-02 09:51:34,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-02-02 09:51:34,447 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 325 transitions. [2018-02-02 09:51:34,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-02-02 09:51:34,448 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:34,448 INFO L351 BasicCegarLoop]: trace histogram [42, 41, 40, 40, 40, 40, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:34,448 INFO L371 AbstractCegarLoop]: === Iteration 50 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1158759493, now seen corresponding path program 40 times [2018-02-02 09:51:34,449 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:34,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 1202 proven. 3682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:35,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:35,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-02-02 09:51:35,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:35,148 INFO L182 omatonBuilderFactory]: Interpolants [17865#true, 17866#false, 17867#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 17868#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 17869#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 17870#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 17871#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 17872#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 17873#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 17874#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 17875#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 17876#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 17877#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 17878#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 17879#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 17880#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 17881#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 17882#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 17883#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 17884#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 17885#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 17886#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 17887#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 17888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 88) (select |#length| SelectionSort_~a.base)), 17889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 84) (select |#length| SelectionSort_~a.base)), 17890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 17891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 17892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 17893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 17894#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 17895#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 17896#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 17897#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 17898#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 17899#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 17900#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 17901#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 17902#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 17903#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 17904#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 17905#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 17906#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 17907#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 17908#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 17909#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 17910#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:35,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4884 backedges. 1202 proven. 3682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:35,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 09:51:35,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 09:51:35,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 09:51:35,149 INFO L87 Difference]: Start difference. First operand 279 states and 325 transitions. Second operand 46 states. [2018-02-02 09:51:36,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:36,828 INFO L93 Difference]: Finished difference Result 282 states and 327 transitions. [2018-02-02 09:51:36,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-02-02 09:51:36,828 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 267 [2018-02-02 09:51:36,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:36,829 INFO L225 Difference]: With dead ends: 282 [2018-02-02 09:51:36,829 INFO L226 Difference]: Without dead ends: 282 [2018-02-02 09:51:36,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1002 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1070, Invalid=3760, Unknown=0, NotChecked=0, Total=4830 [2018-02-02 09:51:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-02 09:51:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2018-02-02 09:51:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-02-02 09:51:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2018-02-02 09:51:36,831 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 267 [2018-02-02 09:51:36,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:36,831 INFO L432 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2018-02-02 09:51:36,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 09:51:36,831 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2018-02-02 09:51:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-02-02 09:51:36,832 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:36,832 INFO L351 BasicCegarLoop]: trace histogram [43, 42, 41, 41, 41, 41, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:36,832 INFO L371 AbstractCegarLoop]: === Iteration 51 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1628702311, now seen corresponding path program 41 times [2018-02-02 09:51:36,833 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:36,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5129 backedges. 1223 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:37,529 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:37,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 09:51:37,529 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:37,529 INFO L182 omatonBuilderFactory]: Interpolants [18560#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 18561#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 18562#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 18563#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 18564#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 18565#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 18566#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 18567#(<= SelectionSort_~array_size SelectionSort_~j~0), 18521#true, 18522#false, 18523#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 18524#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 18525#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 18526#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 18527#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 18528#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 18529#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 18530#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 18531#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 18532#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 18533#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 18534#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 18535#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 18536#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 18537#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 18538#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 18539#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 18540#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 18541#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 18542#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 18543#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 18544#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 18545#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 22)), 18546#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 21)), 18547#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 18548#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 18549#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 18550#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 18551#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 18552#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 18553#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 18554#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 18555#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 18556#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 18557#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 18558#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 18559#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8))] [2018-02-02 09:51:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5129 backedges. 1223 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:37,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-02 09:51:37,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-02 09:51:37,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=1629, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 09:51:37,530 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand 47 states. [2018-02-02 09:51:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:38,154 INFO L93 Difference]: Finished difference Result 432 states and 502 transitions. [2018-02-02 09:51:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-02 09:51:38,154 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 273 [2018-02-02 09:51:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:38,155 INFO L225 Difference]: With dead ends: 432 [2018-02-02 09:51:38,155 INFO L226 Difference]: Without dead ends: 301 [2018-02-02 09:51:38,156 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1126, Invalid=3566, Unknown=0, NotChecked=0, Total=4692 [2018-02-02 09:51:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-02-02 09:51:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 291. [2018-02-02 09:51:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 09:51:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 339 transitions. [2018-02-02 09:51:38,159 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 339 transitions. Word has length 273 [2018-02-02 09:51:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:38,159 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 339 transitions. [2018-02-02 09:51:38,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-02 09:51:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 339 transitions. [2018-02-02 09:51:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-02-02 09:51:38,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:38,161 INFO L351 BasicCegarLoop]: trace histogram [44, 43, 42, 42, 42, 42, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:38,161 INFO L371 AbstractCegarLoop]: === Iteration 52 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2091171077, now seen corresponding path program 42 times [2018-02-02 09:51:38,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:38,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 1325 proven. 4055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:38,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:38,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-02-02 09:51:38,928 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:38,929 INFO L182 omatonBuilderFactory]: Interpolants [19336#true, 19337#false, 19338#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 19339#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 19340#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 19341#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 19342#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 19343#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 19344#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 19345#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 19346#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 19347#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 19348#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 19349#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 19350#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 19351#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 19352#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 19353#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 19354#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 19355#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 19356#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 19357#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 19358#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 19359#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 19360#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 92) (select |#length| SelectionSort_~a.base)), 19361#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 88) (select |#length| SelectionSort_~a.base)), 19362#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 19363#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 19364#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 19365#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 19366#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 19367#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 19368#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 19369#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 19370#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 19371#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 19372#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 19373#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 19374#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 19375#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 19376#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 19377#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 19378#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 19379#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 19380#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 19381#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 19382#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 19383#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 1325 proven. 4055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:38,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 09:51:38,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 09:51:38,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=1740, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 09:51:38,930 INFO L87 Difference]: Start difference. First operand 291 states and 339 transitions. Second operand 48 states. [2018-02-02 09:51:40,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:40,762 INFO L93 Difference]: Finished difference Result 294 states and 341 transitions. [2018-02-02 09:51:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-02 09:51:40,763 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 279 [2018-02-02 09:51:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:40,763 INFO L225 Difference]: With dead ends: 294 [2018-02-02 09:51:40,763 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 09:51:40,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1164, Invalid=4092, Unknown=0, NotChecked=0, Total=5256 [2018-02-02 09:51:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 09:51:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-02-02 09:51:40,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-02 09:51:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 338 transitions. [2018-02-02 09:51:40,766 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 338 transitions. Word has length 279 [2018-02-02 09:51:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:40,766 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 338 transitions. [2018-02-02 09:51:40,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 09:51:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 338 transitions. [2018-02-02 09:51:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-02-02 09:51:40,767 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:40,767 INFO L351 BasicCegarLoop]: trace histogram [45, 44, 43, 43, 43, 43, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:40,767 INFO L371 AbstractCegarLoop]: === Iteration 53 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:40,767 INFO L82 PathProgramCache]: Analyzing trace with hash 884073049, now seen corresponding path program 43 times [2018-02-02 09:51:40,767 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:40,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5637 backedges. 1347 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:41,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:41,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 09:51:41,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:41,470 INFO L182 omatonBuilderFactory]: Interpolants [20020#true, 20021#false, 20022#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 20023#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 20024#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 20025#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 20026#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 20027#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 20028#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 20029#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 20030#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 20031#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 20032#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 20033#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 20034#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 20035#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 20036#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 20037#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 20038#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 20039#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 20040#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 20041#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 20042#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 20043#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 20044#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 20045#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 23)), 20046#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 22)), 20047#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 20048#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 20049#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 20050#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 20051#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 20052#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 20053#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 20054#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 20055#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 20056#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 20057#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 20058#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 20059#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 20060#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 20061#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 20062#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 20063#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 20064#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 20065#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 20066#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 20067#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 20068#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:41,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5637 backedges. 1347 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:41,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-02 09:51:41,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-02 09:51:41,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=580, Invalid=1772, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 09:51:41,471 INFO L87 Difference]: Start difference. First operand 291 states and 338 transitions. Second operand 49 states. [2018-02-02 09:51:42,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:42,013 INFO L93 Difference]: Finished difference Result 450 states and 523 transitions. [2018-02-02 09:51:42,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-02 09:51:42,013 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 285 [2018-02-02 09:51:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:42,014 INFO L225 Difference]: With dead ends: 450 [2018-02-02 09:51:42,014 INFO L226 Difference]: Without dead ends: 313 [2018-02-02 09:51:42,015 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1223, Invalid=3889, Unknown=0, NotChecked=0, Total=5112 [2018-02-02 09:51:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-02-02 09:51:42,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 303. [2018-02-02 09:51:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 09:51:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 353 transitions. [2018-02-02 09:51:42,016 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 353 transitions. Word has length 285 [2018-02-02 09:51:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:42,017 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 353 transitions. [2018-02-02 09:51:42,017 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-02 09:51:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 353 transitions. [2018-02-02 09:51:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-02-02 09:51:42,017 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:42,018 INFO L351 BasicCegarLoop]: trace histogram [46, 45, 44, 44, 44, 44, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:42,018 INFO L371 AbstractCegarLoop]: === Iteration 54 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:42,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1415257147, now seen corresponding path program 44 times [2018-02-02 09:51:42,018 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:42,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5900 backedges. 1454 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:42,871 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:42,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-02-02 09:51:42,871 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:42,872 INFO L182 omatonBuilderFactory]: Interpolants [20869#true, 20870#false, 20871#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 20872#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 20873#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 20874#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 20875#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 20876#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 20877#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 20878#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 20879#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 20880#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 20881#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 20882#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 20883#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 20884#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 20885#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 20886#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 20887#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 20888#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 20889#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 20890#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 20891#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 20892#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 20893#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 20894#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 96) (select |#length| SelectionSort_~a.base)), 20895#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 92) (select |#length| SelectionSort_~a.base)), 20896#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 20897#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 20898#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 20899#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 20900#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 20901#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 20902#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 20903#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 20904#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 20905#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 20906#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 20907#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 20908#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 20909#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 20910#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 20911#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 20912#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 20913#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 20914#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 20915#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 20916#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 20917#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 20918#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5900 backedges. 1454 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:42,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-02 09:51:42,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-02 09:51:42,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=1888, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 09:51:42,873 INFO L87 Difference]: Start difference. First operand 303 states and 353 transitions. Second operand 50 states. [2018-02-02 09:51:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:44,844 INFO L93 Difference]: Finished difference Result 306 states and 355 transitions. [2018-02-02 09:51:44,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-02-02 09:51:44,844 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 291 [2018-02-02 09:51:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:44,845 INFO L225 Difference]: With dead ends: 306 [2018-02-02 09:51:44,845 INFO L226 Difference]: Without dead ends: 306 [2018-02-02 09:51:44,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1262, Invalid=4438, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 09:51:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-02-02 09:51:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2018-02-02 09:51:44,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-02-02 09:51:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 352 transitions. [2018-02-02 09:51:44,847 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 352 transitions. Word has length 291 [2018-02-02 09:51:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:44,847 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 352 transitions. [2018-02-02 09:51:44,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-02 09:51:44,847 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 352 transitions. [2018-02-02 09:51:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-02-02 09:51:44,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:44,848 INFO L351 BasicCegarLoop]: trace histogram [47, 46, 45, 45, 45, 45, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:44,848 INFO L371 AbstractCegarLoop]: === Iteration 55 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -47580903, now seen corresponding path program 45 times [2018-02-02 09:51:44,849 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:44,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 1477 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:45,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:45,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 09:51:45,634 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:45,634 INFO L182 omatonBuilderFactory]: Interpolants [21581#true, 21582#false, 21583#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 21584#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 21585#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 21586#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 21587#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 21588#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 21589#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 21590#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 21591#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 21592#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 21593#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 21594#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 21595#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 21596#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 21597#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 21598#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 21599#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 21600#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 21601#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 21602#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 21603#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 21604#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 21605#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 21606#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 21607#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 24)), 21608#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 23)), 21609#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 21610#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 21611#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 21612#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 21613#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 21614#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 21615#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 21616#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 21617#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 21618#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 21619#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 21620#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 21621#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 21622#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 21623#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 21624#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 21625#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 21626#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 21627#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 21628#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 21629#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 21630#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 21631#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 1477 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:45,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-02 09:51:45,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-02 09:51:45,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=1921, Unknown=0, NotChecked=0, Total=2550 [2018-02-02 09:51:45,635 INFO L87 Difference]: Start difference. First operand 303 states and 352 transitions. Second operand 51 states. [2018-02-02 09:51:46,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:46,342 INFO L93 Difference]: Finished difference Result 468 states and 544 transitions. [2018-02-02 09:51:46,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-02 09:51:46,342 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 297 [2018-02-02 09:51:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:46,343 INFO L225 Difference]: With dead ends: 468 [2018-02-02 09:51:46,343 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 09:51:46,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1324, Invalid=4226, Unknown=0, NotChecked=0, Total=5550 [2018-02-02 09:51:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 09:51:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 315. [2018-02-02 09:51:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 09:51:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 367 transitions. [2018-02-02 09:51:46,345 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 367 transitions. Word has length 297 [2018-02-02 09:51:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:46,345 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 367 transitions. [2018-02-02 09:51:46,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-02 09:51:46,345 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 367 transitions. [2018-02-02 09:51:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-02-02 09:51:46,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:46,346 INFO L351 BasicCegarLoop]: trace histogram [48, 47, 46, 46, 46, 46, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:46,346 INFO L371 AbstractCegarLoop]: === Iteration 56 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:46,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1041614715, now seen corresponding path program 46 times [2018-02-02 09:51:46,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:46,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 1589 proven. 4855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:47,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:47,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-02-02 09:51:47,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:47,250 INFO L182 omatonBuilderFactory]: Interpolants [22464#true, 22465#false, 22466#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 22467#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 22468#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 22469#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 22470#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 22471#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 22472#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 22473#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 22474#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 22475#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 22476#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 22477#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 22478#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 22479#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 22480#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 22481#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 22482#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 22483#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 22484#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 22485#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 22486#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 22487#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 22488#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 22489#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 22490#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 100) (select |#length| SelectionSort_~a.base)), 22491#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 96) (select |#length| SelectionSort_~a.base)), 22492#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 22493#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 22494#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 22495#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 22496#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 22497#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 22498#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 22499#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 22500#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 22501#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 22502#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 22503#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 22504#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 22505#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 22506#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 22507#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 22508#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 22509#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 22510#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 22511#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 22512#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 22513#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 22514#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 22515#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6444 backedges. 1589 proven. 4855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:47,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 09:51:47,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 09:51:47,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=2042, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 09:51:47,251 INFO L87 Difference]: Start difference. First operand 315 states and 367 transitions. Second operand 52 states. [2018-02-02 09:51:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:49,307 INFO L93 Difference]: Finished difference Result 318 states and 369 transitions. [2018-02-02 09:51:49,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-02-02 09:51:49,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 303 [2018-02-02 09:51:49,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:49,308 INFO L225 Difference]: With dead ends: 318 [2018-02-02 09:51:49,309 INFO L226 Difference]: Without dead ends: 318 [2018-02-02 09:51:49,309 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1364, Invalid=4798, Unknown=0, NotChecked=0, Total=6162 [2018-02-02 09:51:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-02 09:51:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 315. [2018-02-02 09:51:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 09:51:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 366 transitions. [2018-02-02 09:51:49,311 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 366 transitions. Word has length 303 [2018-02-02 09:51:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:49,311 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 366 transitions. [2018-02-02 09:51:49,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 09:51:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 366 transitions. [2018-02-02 09:51:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-02-02 09:51:49,312 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:49,312 INFO L351 BasicCegarLoop]: trace histogram [49, 48, 47, 47, 47, 47, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:49,312 INFO L371 AbstractCegarLoop]: === Iteration 57 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1009992231, now seen corresponding path program 47 times [2018-02-02 09:51:49,313 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:49,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 1613 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:50,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:50,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 09:51:50,188 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:50,189 INFO L182 omatonBuilderFactory]: Interpolants [23204#true, 23205#false, 23206#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 23207#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 23208#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 23209#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 23210#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 23211#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 23212#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 23213#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 23214#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 23215#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 23216#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 23217#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 23218#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 23219#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 23220#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 23221#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 23222#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 23223#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 23224#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 23225#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 23226#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 23227#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 23228#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 23229#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 23230#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 23231#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 25)), 23232#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 24)), 23233#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 23234#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 23235#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 23236#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 23237#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 23238#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 23239#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 23240#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 23241#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 23242#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 23243#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 23244#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 23245#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 23246#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 23247#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 23248#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 23249#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 23250#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 23251#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 23252#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 23253#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 23254#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 23255#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 23256#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 1613 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:50,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-02 09:51:50,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-02 09:51:50,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=680, Invalid=2076, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 09:51:50,190 INFO L87 Difference]: Start difference. First operand 315 states and 366 transitions. Second operand 53 states. [2018-02-02 09:51:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:50,915 INFO L93 Difference]: Finished difference Result 486 states and 565 transitions. [2018-02-02 09:51:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-02 09:51:50,915 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 309 [2018-02-02 09:51:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:50,916 INFO L225 Difference]: With dead ends: 486 [2018-02-02 09:51:50,916 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 09:51:50,917 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1429, Invalid=4577, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 09:51:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 09:51:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 327. [2018-02-02 09:51:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 09:51:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 381 transitions. [2018-02-02 09:51:50,919 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 381 transitions. Word has length 309 [2018-02-02 09:51:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:50,919 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 381 transitions. [2018-02-02 09:51:50,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-02 09:51:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 381 transitions. [2018-02-02 09:51:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-02-02 09:51:50,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:50,921 INFO L351 BasicCegarLoop]: trace histogram [50, 49, 48, 48, 48, 48, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:50,921 INFO L371 AbstractCegarLoop]: === Iteration 58 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:50,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1181563717, now seen corresponding path program 48 times [2018-02-02 09:51:50,922 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:50,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7012 backedges. 1730 proven. 5282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:51,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:51,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-02-02 09:51:51,867 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:51,868 INFO L182 omatonBuilderFactory]: Interpolants [24121#true, 24122#false, 24123#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 24124#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 24125#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 24126#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 24127#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 24128#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 24129#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 24130#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 24131#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 24132#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 24133#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 24134#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 24135#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 24136#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0), 24137#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 24138#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 24139#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 24140#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 24141#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 24142#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 24143#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 24144#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 24145#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 24146#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 24147#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 24148#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 104) (select |#length| SelectionSort_~a.base)), 24149#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 100) (select |#length| SelectionSort_~a.base)), 24150#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 24151#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 24152#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 24153#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 24154#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 24155#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 24156#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 24157#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 24158#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 24159#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 24160#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 24161#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 24162#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 24163#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 24164#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 24165#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 24166#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 24167#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 24168#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 24169#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 24170#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 24171#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 24172#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 24173#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 24174#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0))))] [2018-02-02 09:51:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7012 backedges. 1730 proven. 5282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:51,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-02 09:51:51,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-02 09:51:51,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=2202, Unknown=0, NotChecked=0, Total=2862 [2018-02-02 09:51:51,869 INFO L87 Difference]: Start difference. First operand 327 states and 381 transitions. Second operand 54 states. [2018-02-02 09:51:54,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:54,166 INFO L93 Difference]: Finished difference Result 330 states and 383 transitions. [2018-02-02 09:51:54,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-02-02 09:51:54,166 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 315 [2018-02-02 09:51:54,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:54,167 INFO L225 Difference]: With dead ends: 330 [2018-02-02 09:51:54,167 INFO L226 Difference]: Without dead ends: 330 [2018-02-02 09:51:54,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1470, Invalid=5172, Unknown=0, NotChecked=0, Total=6642 [2018-02-02 09:51:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-02 09:51:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2018-02-02 09:51:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 09:51:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 380 transitions. [2018-02-02 09:51:54,169 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 380 transitions. Word has length 315 [2018-02-02 09:51:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:54,169 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 380 transitions. [2018-02-02 09:51:54,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-02 09:51:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 380 transitions. [2018-02-02 09:51:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-02-02 09:51:54,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:54,170 INFO L351 BasicCegarLoop]: trace histogram [51, 50, 49, 49, 49, 49, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:54,170 INFO L371 AbstractCegarLoop]: === Iteration 59 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:54,170 INFO L82 PathProgramCache]: Analyzing trace with hash 322089113, now seen corresponding path program 49 times [2018-02-02 09:51:54,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:54,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7305 backedges. 1755 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:55,156 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:55,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 09:51:55,157 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:55,157 INFO L182 omatonBuilderFactory]: Interpolants [24889#true, 24890#false, 24891#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 1)), 24892#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 2)), 24893#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 3)), 24894#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 4)), 24895#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 5)), 24896#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 6)), 24897#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 7)), 24898#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 8)), 24899#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 9)), 24900#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 10)), 24901#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 11)), 24902#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 12)), 24903#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 13)), 24904#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 14)), 24905#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 15)), 24906#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 16)), 24907#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 17)), 24908#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 18)), 24909#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 19)), 24910#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 20)), 24911#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 21)), 24912#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 22)), 24913#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 23)), 24914#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 24)), 24915#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 25)), 24916#(<= SelectionSort_~j~0 (+ SelectionSort_~i~0 26)), 24917#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 26)), 24918#(<= SelectionSort_~array_size (+ SelectionSort_~i~0 25)), 24919#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 24)), 24920#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 23)), 24921#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 22)), 24922#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 21)), 24923#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 20)), 24924#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 19)), 24925#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 18)), 24926#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 17)), 24927#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 16)), 24928#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 15)), 24929#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 14)), 24930#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 13)), 24931#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 12)), 24932#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 11)), 24933#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 10)), 24934#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 9)), 24935#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 8)), 24936#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 7)), 24937#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 6)), 24938#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 5)), 24939#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 4)), 24940#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 3)), 24941#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 2)), 24942#(<= SelectionSort_~array_size (+ SelectionSort_~j~0 1)), 24943#(<= SelectionSort_~array_size SelectionSort_~j~0)] [2018-02-02 09:51:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7305 backedges. 1755 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:55,157 INFO L409 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-02-02 09:51:55,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-02-02 09:51:55,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=2237, Unknown=0, NotChecked=0, Total=2970 [2018-02-02 09:51:55,158 INFO L87 Difference]: Start difference. First operand 327 states and 380 transitions. Second operand 55 states. [2018-02-02 09:51:55,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:55,947 INFO L93 Difference]: Finished difference Result 504 states and 586 transitions. [2018-02-02 09:51:55,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-02-02 09:51:55,948 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 321 [2018-02-02 09:51:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:55,949 INFO L225 Difference]: With dead ends: 504 [2018-02-02 09:51:55,949 INFO L226 Difference]: Without dead ends: 349 [2018-02-02 09:51:55,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1538, Invalid=4942, Unknown=0, NotChecked=0, Total=6480 [2018-02-02 09:51:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-02-02 09:51:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 339. [2018-02-02 09:51:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 09:51:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 395 transitions. [2018-02-02 09:51:55,952 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 395 transitions. Word has length 321 [2018-02-02 09:51:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:55,952 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 395 transitions. [2018-02-02 09:51:55,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-02-02 09:51:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 395 transitions. [2018-02-02 09:51:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-02-02 09:51:55,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:55,953 INFO L351 BasicCegarLoop]: trace histogram [52, 51, 50, 50, 50, 50, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:55,953 INFO L371 AbstractCegarLoop]: === Iteration 60 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1061579781, now seen corresponding path program 50 times [2018-02-02 09:51:55,953 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:55,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:51:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7604 backedges. 1877 proven. 5727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:57,008 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:51:57,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-02-02 09:51:57,008 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:51:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:57,009 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= (+ SelectionSort_~i~0 15) SelectionSort_~j~0), 25857#(<= (+ SelectionSort_~i~0 16) SelectionSort_~j~0), 25858#(<= (+ SelectionSort_~i~0 17) SelectionSort_~j~0), 25859#(<= (+ SelectionSort_~i~0 18) SelectionSort_~j~0), 25860#(<= (+ SelectionSort_~i~0 19) SelectionSort_~j~0), 25861#(<= (+ SelectionSort_~i~0 20) SelectionSort_~j~0), 25862#(<= (+ SelectionSort_~i~0 21) SelectionSort_~j~0), 25863#(<= (+ SelectionSort_~i~0 22) SelectionSort_~j~0), 25864#(<= (+ SelectionSort_~i~0 23) SelectionSort_~j~0), 25865#(<= (+ SelectionSort_~i~0 24) SelectionSort_~j~0), 25866#(<= (+ SelectionSort_~i~0 25) SelectionSort_~j~0), 25867#(<= (+ SelectionSort_~i~0 26) SelectionSort_~j~0), 25868#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 108) (select |#length| SelectionSort_~a.base)), 25869#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~i~0) 104) (select |#length| SelectionSort_~a.base)), 25870#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 100) (select |#length| SelectionSort_~a.base)), 25871#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 96) (select |#length| SelectionSort_~a.base)), 25872#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 92) (select |#length| SelectionSort_~a.base)), 25873#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 88) (select |#length| SelectionSort_~a.base)), 25874#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 84) (select |#length| SelectionSort_~a.base)), 25875#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 80) (select |#length| SelectionSort_~a.base)), 25876#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 76) (select |#length| SelectionSort_~a.base)), 25877#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 72) (select |#length| SelectionSort_~a.base)), 25878#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 68) (select |#length| SelectionSort_~a.base)), 25879#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 64) (select |#length| SelectionSort_~a.base)), 25880#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 60) (select |#length| SelectionSort_~a.base)), 25881#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 56) (select |#length| SelectionSort_~a.base)), 25882#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 52) (select |#length| SelectionSort_~a.base)), 25883#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 48) (select |#length| SelectionSort_~a.base)), 25884#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 44) (select |#length| SelectionSort_~a.base)), 25885#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 40) (select |#length| SelectionSort_~a.base)), 25886#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 36) (select |#length| SelectionSort_~a.base)), 25887#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 32) (select |#length| SelectionSort_~a.base)), 25888#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 28) (select |#length| SelectionSort_~a.base)), 25889#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 24) (select |#length| SelectionSort_~a.base)), 25890#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 20) (select |#length| SelectionSort_~a.base)), 25891#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 16) (select |#length| SelectionSort_~a.base)), 25892#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 12) (select |#length| SelectionSort_~a.base)), 25893#(<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)), 25894#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 8) (select |#length| SelectionSort_~a.base)) (<= 0 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 25895#(and (<= (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0) 4) (select |#length| SelectionSort_~a.base)) (<= 4 (+ SelectionSort_~a.offset (* 4 SelectionSort_~j~0)))), 25840#true, 25841#false, 25842#(<= (+ SelectionSort_~i~0 1) SelectionSort_~j~0), 25843#(<= (+ SelectionSort_~i~0 2) SelectionSort_~j~0), 25844#(<= (+ SelectionSort_~i~0 3) SelectionSort_~j~0), 25845#(<= (+ SelectionSort_~i~0 4) SelectionSort_~j~0), 25846#(<= (+ SelectionSort_~i~0 5) SelectionSort_~j~0), 25847#(<= (+ SelectionSort_~i~0 6) SelectionSort_~j~0), 25848#(<= (+ SelectionSort_~i~0 7) SelectionSort_~j~0), 25849#(<= (+ SelectionSort_~i~0 8) SelectionSort_~j~0), 25850#(<= (+ SelectionSort_~i~0 9) SelectionSort_~j~0), 25851#(<= (+ SelectionSort_~i~0 10) SelectionSort_~j~0), 25852#(<= (+ SelectionSort_~i~0 11) SelectionSort_~j~0), 25853#(<= (+ SelectionSort_~i~0 12) SelectionSort_~j~0), 25854#(<= (+ SelectionSort_~i~0 13) SelectionSort_~j~0), 25855#(<= (+ SelectionSort_~i~0 14) SelectionSort_~j~0)] [2018-02-02 09:51:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7604 backedges. 1877 proven. 5727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:51:57,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-02 09:51:57,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-02 09:51:57,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=2368, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 09:51:57,010 INFO L87 Difference]: Start difference. First operand 339 states and 395 transitions. Second operand 56 states. [2018-02-02 09:51:59,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:51:59,470 INFO L93 Difference]: Finished difference Result 342 states and 397 transitions. [2018-02-02 09:51:59,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-02-02 09:51:59,471 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 327 [2018-02-02 09:51:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:51:59,471 INFO L225 Difference]: With dead ends: 342 [2018-02-02 09:51:59,471 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 09:51:59,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1502 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1580, Invalid=5560, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 09:51:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 09:51:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 339. [2018-02-02 09:51:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 09:51:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 394 transitions. [2018-02-02 09:51:59,474 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 394 transitions. Word has length 327 [2018-02-02 09:51:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:51:59,474 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 394 transitions. [2018-02-02 09:51:59,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-02 09:51:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 394 transitions. [2018-02-02 09:51:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-02-02 09:51:59,475 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:51:59,475 INFO L351 BasicCegarLoop]: trace histogram [53, 52, 51, 51, 51, 51, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:51:59,475 INFO L371 AbstractCegarLoop]: === Iteration 61 === [SelectionSortErr2RequiresViolation, SelectionSortErr4RequiresViolation, SelectionSortErr8RequiresViolation, SelectionSortErr9RequiresViolation, SelectionSortErr3RequiresViolation, SelectionSortErr1RequiresViolation, SelectionSortErr5RequiresViolation, SelectionSortErr11RequiresViolation, SelectionSortErr7RequiresViolation, SelectionSortErr10RequiresViolation, SelectionSortErr0RequiresViolation, SelectionSortErr6RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 09:51:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash 487870809, now seen corresponding path program 51 times [2018-02-02 09:51:59,475 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:51:59,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:51:59,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 09:51:59,549 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 09:51:59,552 INFO L168 Benchmark]: Toolchain (without parser) took 58663.19 ms. Allocated memory was 401.6 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 359.6 MB in the beginning and 1.2 GB in the end (delta: -823.9 MB). Peak memory consumption was 615.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:59,553 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:51:59,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.25 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:59,554 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:59,554 INFO L168 Benchmark]: RCFGBuilder took 209.90 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 327.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:59,554 INFO L168 Benchmark]: TraceAbstraction took 58258.02 ms. Allocated memory was 401.6 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 326.5 MB in the beginning and 1.2 GB in the end (delta: -857.0 MB). Peak memory consumption was 582.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:51:59,556 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 162.25 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.91 ms. Allocated memory is still 401.6 MB. Free memory was 347.7 MB in the beginning and 346.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 209.90 ms. Allocated memory is still 401.6 MB. Free memory was 346.4 MB in the beginning and 327.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58258.02 ms. Allocated memory was 401.6 MB in the beginning and 1.8 GB in the end (delta: 1.4 GB). Free memory was 326.5 MB in the beginning and 1.2 GB in the end (delta: -857.0 MB). Peak memory consumption was 582.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/selectionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-51-59-562.csv Completed graceful shutdown