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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:36:15,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:36:15,646 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:36:15,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:36:15,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:36:15,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:36:15,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:36:15,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:36:15,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:36:15,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:36:15,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:36:15,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:36:15,664 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:36:15,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:36:15,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:36:15,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:36:15,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:36:15,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:36:15,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:36:15,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:36:15,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:36:15,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:36:15,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:36:15,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:36:15,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:36:15,677 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:36:15,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:36:15,677 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:36:15,678 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:36:15,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:36:15,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:36:15,678 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:36:15,687 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:36:15,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:36:15,688 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:36:15,688 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:36:15,689 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:36:15,689 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:36:15,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:36:15,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:36:15,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:36:15,691 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:36:15,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:36:15,691 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:36:15,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:36:15,724 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:36:15,727 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:36:15,728 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:36:15,728 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:36:15,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-02-04 19:36:15,851 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:36:15,852 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:36:15,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:36:15,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:36:15,856 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:36:15,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:36:15" (1/1) ... [2018-02-04 19:36:15,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c932427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:15, skipping insertion in model container [2018-02-04 19:36:15,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:36:15" (1/1) ... [2018-02-04 19:36:15,868 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:36:15,915 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:36:16,007 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:36:16,026 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:36:16,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16 WrapperNode [2018-02-04 19:36:16,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:36:16,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:36:16,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:36:16,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:36:16,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (1/1) ... [2018-02-04 19:36:16,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:36:16,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:36:16,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:36:16,072 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:36:16,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (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-04 19:36:16,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:36:16,108 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:36:16,108 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-02-04 19:36:16,108 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-02-04 19:36:16,108 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-02-04 19:36:16,108 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-02-04 19:36:16,109 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-02-04 19:36:16,109 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-02-04 19:36:16,109 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:36:16,109 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:36:16,110 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:36:16,621 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:36:16,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:36:16 BoogieIcfgContainer [2018-02-04 19:36:16,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:36:16,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:36:16,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:36:16,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:36:16,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:36:15" (1/3) ... [2018-02-04 19:36:16,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3515d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:36:16, skipping insertion in model container [2018-02-04 19:36:16,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:36:16" (2/3) ... [2018-02-04 19:36:16,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3515d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:36:16, skipping insertion in model container [2018-02-04 19:36:16,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:36:16" (3/3) ... [2018-02-04 19:36:16,628 INFO L107 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-02-04 19:36:16,635 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:36:16,641 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 109 error locations. [2018-02-04 19:36:16,671 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:36:16,671 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:36:16,671 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:36:16,672 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:36:16,672 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:36:16,672 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:36:16,672 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:36:16,672 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:36:16,672 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:36:16,687 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states. [2018-02-04 19:36:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 19:36:16,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:16,696 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:16,696 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:16,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1556477250, now seen corresponding path program 1 times [2018-02-04 19:36:16,702 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:16,702 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:16,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:16,734 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:16,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:16,767 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:16,786 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-04 19:36:16,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:16,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:36:16,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 19:36:16,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 19:36:16,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 19:36:16,880 INFO L87 Difference]: Start difference. First operand 315 states. Second operand 2 states. [2018-02-04 19:36:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:16,904 INFO L93 Difference]: Finished difference Result 313 states and 338 transitions. [2018-02-04 19:36:16,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 19:36:16,905 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 19:36:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:16,914 INFO L225 Difference]: With dead ends: 313 [2018-02-04 19:36:16,915 INFO L226 Difference]: Without dead ends: 296 [2018-02-04 19:36:16,916 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-04 19:36:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-04 19:36:16,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-02-04 19:36:16,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 19:36:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 309 transitions. [2018-02-04 19:36:16,950 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 309 transitions. Word has length 9 [2018-02-04 19:36:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:16,950 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 309 transitions. [2018-02-04 19:36:16,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 19:36:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 309 transitions. [2018-02-04 19:36:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 19:36:16,950 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:16,950 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:16,950 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1087749341, now seen corresponding path program 1 times [2018-02-04 19:36:16,951 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:16,951 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:16,952 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:16,952 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:16,953 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:16,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:16,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-04 19:36:16,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:16,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:36:16,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:36:16,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:36:16,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:36:16,990 INFO L87 Difference]: Start difference. First operand 296 states and 309 transitions. Second operand 3 states. [2018-02-04 19:36:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:17,232 INFO L93 Difference]: Finished difference Result 339 states and 361 transitions. [2018-02-04 19:36:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:36:17,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 19:36:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:17,236 INFO L225 Difference]: With dead ends: 339 [2018-02-04 19:36:17,236 INFO L226 Difference]: Without dead ends: 338 [2018-02-04 19:36:17,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 19:36:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-04 19:36:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 300. [2018-02-04 19:36:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-02-04 19:36:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 314 transitions. [2018-02-04 19:36:17,262 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 314 transitions. Word has length 11 [2018-02-04 19:36:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:17,268 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 314 transitions. [2018-02-04 19:36:17,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:36:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 314 transitions. [2018-02-04 19:36:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 19:36:17,269 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:17,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:17,269 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:17,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764336, now seen corresponding path program 1 times [2018-02-04 19:36:17,270 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:17,270 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:17,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,271 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:17,271 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:17,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:17,343 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-04 19:36:17,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:17,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:36:17,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:36:17,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:36:17,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:36:17,344 INFO L87 Difference]: Start difference. First operand 300 states and 314 transitions. Second operand 4 states. [2018-02-04 19:36:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:17,516 INFO L93 Difference]: Finished difference Result 328 states and 346 transitions. [2018-02-04 19:36:17,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:36:17,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 19:36:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:17,519 INFO L225 Difference]: With dead ends: 328 [2018-02-04 19:36:17,519 INFO L226 Difference]: Without dead ends: 328 [2018-02-04 19:36:17,519 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:36:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-04 19:36:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 298. [2018-02-04 19:36:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-02-04 19:36:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 312 transitions. [2018-02-04 19:36:17,529 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 312 transitions. Word has length 13 [2018-02-04 19:36:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:17,530 INFO L432 AbstractCegarLoop]: Abstraction has 298 states and 312 transitions. [2018-02-04 19:36:17,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:36:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 312 transitions. [2018-02-04 19:36:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 19:36:17,531 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:17,531 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:17,531 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1650764335, now seen corresponding path program 1 times [2018-02-04 19:36:17,531 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:17,531 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:17,532 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:17,533 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:17,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:17,558 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-04 19:36:17,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:17,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:36:17,559 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:36:17,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:36:17,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:36:17,560 INFO L87 Difference]: Start difference. First operand 298 states and 312 transitions. Second operand 4 states. [2018-02-04 19:36:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:17,734 INFO L93 Difference]: Finished difference Result 315 states and 332 transitions. [2018-02-04 19:36:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:36:17,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 19:36:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:17,736 INFO L225 Difference]: With dead ends: 315 [2018-02-04 19:36:17,736 INFO L226 Difference]: Without dead ends: 315 [2018-02-04 19:36:17,736 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-04 19:36:17,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-02-04 19:36:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 296. [2018-02-04 19:36:17,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-02-04 19:36:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 310 transitions. [2018-02-04 19:36:17,742 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 310 transitions. Word has length 13 [2018-02-04 19:36:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:17,743 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 310 transitions. [2018-02-04 19:36:17,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:36:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 310 transitions. [2018-02-04 19:36:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:36:17,743 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:17,743 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:17,744 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:17,744 INFO L82 PathProgramCache]: Analyzing trace with hash 45229303, now seen corresponding path program 1 times [2018-02-04 19:36:17,744 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:17,744 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:17,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:17,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:17,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:17,765 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-04 19:36:17,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:17,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:36:17,765 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:36:17,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:36:17,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:36:17,766 INFO L87 Difference]: Start difference. First operand 296 states and 310 transitions. Second operand 3 states. [2018-02-04 19:36:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:17,779 INFO L93 Difference]: Finished difference Result 315 states and 327 transitions. [2018-02-04 19:36:17,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:36:17,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:36:17,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:17,780 INFO L225 Difference]: With dead ends: 315 [2018-02-04 19:36:17,780 INFO L226 Difference]: Without dead ends: 314 [2018-02-04 19:36:17,780 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-04 19:36:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-02-04 19:36:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 295. [2018-02-04 19:36:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-02-04 19:36:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 308 transitions. [2018-02-04 19:36:17,786 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 308 transitions. Word has length 17 [2018-02-04 19:36:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:17,786 INFO L432 AbstractCegarLoop]: Abstraction has 295 states and 308 transitions. [2018-02-04 19:36:17,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:36:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 308 transitions. [2018-02-04 19:36:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:36:17,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:17,787 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:17,787 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:17,787 INFO L82 PathProgramCache]: Analyzing trace with hash 963226955, now seen corresponding path program 1 times [2018-02-04 19:36:17,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:17,787 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:17,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:17,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:17,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:17,848 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-04 19:36:17,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:17,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:36:17,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:36:17,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:36:17,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:36:17,849 INFO L87 Difference]: Start difference. First operand 295 states and 308 transitions. Second operand 4 states. [2018-02-04 19:36:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:17,975 INFO L93 Difference]: Finished difference Result 329 states and 345 transitions. [2018-02-04 19:36:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:36:17,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 19:36:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:17,976 INFO L225 Difference]: With dead ends: 329 [2018-02-04 19:36:17,976 INFO L226 Difference]: Without dead ends: 329 [2018-02-04 19:36:17,976 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:36:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-02-04 19:36:17,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2018-02-04 19:36:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-02-04 19:36:17,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 306 transitions. [2018-02-04 19:36:17,981 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 306 transitions. Word has length 20 [2018-02-04 19:36:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:17,981 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 306 transitions. [2018-02-04 19:36:17,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:36:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 306 transitions. [2018-02-04 19:36:17,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:36:17,982 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:17,982 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:17,982 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:17,982 INFO L82 PathProgramCache]: Analyzing trace with hash 963226954, now seen corresponding path program 1 times [2018-02-04 19:36:17,982 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:17,982 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:17,983 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,983 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:17,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:17,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:18,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-04 19:36:18,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:18,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:36:18,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:36:18,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:36:18,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:36:18,010 INFO L87 Difference]: Start difference. First operand 293 states and 306 transitions. Second operand 4 states. [2018-02-04 19:36:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:18,133 INFO L93 Difference]: Finished difference Result 316 states and 331 transitions. [2018-02-04 19:36:18,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:36:18,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 19:36:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:18,134 INFO L225 Difference]: With dead ends: 316 [2018-02-04 19:36:18,134 INFO L226 Difference]: Without dead ends: 316 [2018-02-04 19:36:18,134 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-04 19:36:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-02-04 19:36:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 291. [2018-02-04 19:36:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 19:36:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 304 transitions. [2018-02-04 19:36:18,137 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 304 transitions. Word has length 20 [2018-02-04 19:36:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:18,138 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 304 transitions. [2018-02-04 19:36:18,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:36:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 304 transitions. [2018-02-04 19:36:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:36:18,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:18,138 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 19:36:18,138 INFO L371 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1725402921, now seen corresponding path program 1 times [2018-02-04 19:36:18,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:18,138 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:18,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:18,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:18,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:18,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:18,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:18,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:36:18,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:36:18,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:36:18,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:36:18,174 INFO L87 Difference]: Start difference. First operand 291 states and 304 transitions. Second operand 5 states. [2018-02-04 19:36:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:18,227 INFO L93 Difference]: Finished difference Result 331 states and 347 transitions. [2018-02-04 19:36:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:36:18,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-02-04 19:36:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:18,229 INFO L225 Difference]: With dead ends: 331 [2018-02-04 19:36:18,229 INFO L226 Difference]: Without dead ends: 331 [2018-02-04 19:36:18,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:36:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-04 19:36:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2018-02-04 19:36:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-02-04 19:36:18,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 303 transitions. [2018-02-04 19:36:18,234 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 303 transitions. Word has length 27 [2018-02-04 19:36:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:18,235 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 303 transitions. [2018-02-04 19:36:18,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:36:18,235 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 303 transitions. [2018-02-04 19:36:18,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 19:36:18,235 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:18,235 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-04 19:36:18,236 INFO L371 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:18,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365059, now seen corresponding path program 1 times [2018-02-04 19:36:18,236 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:18,236 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:18,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:18,237 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:18,237 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:18,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:18,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:18,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:36:18,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:36:18,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:36:18,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:36:18,280 INFO L87 Difference]: Start difference. First operand 291 states and 303 transitions. Second operand 6 states. [2018-02-04 19:36:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:18,552 INFO L93 Difference]: Finished difference Result 309 states and 324 transitions. [2018-02-04 19:36:18,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:36:18,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-02-04 19:36:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:18,554 INFO L225 Difference]: With dead ends: 309 [2018-02-04 19:36:18,554 INFO L226 Difference]: Without dead ends: 309 [2018-02-04 19:36:18,554 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-04 19:36:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-02-04 19:36:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2018-02-04 19:36:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-02-04 19:36:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 300 transitions. [2018-02-04 19:36:18,558 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 300 transitions. Word has length 33 [2018-02-04 19:36:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:18,559 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 300 transitions. [2018-02-04 19:36:18,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:36:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 300 transitions. [2018-02-04 19:36:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 19:36:18,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:18,559 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-02-04 19:36:18,560 INFO L371 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1961365060, now seen corresponding path program 1 times [2018-02-04 19:36:18,560 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:18,560 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:18,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:18,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:18,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:18,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:18,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:18,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:36:18,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:36:18,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:36:18,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:36:18,649 INFO L87 Difference]: Start difference. First operand 286 states and 300 transitions. Second operand 7 states. [2018-02-04 19:36:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:19,079 INFO L93 Difference]: Finished difference Result 359 states and 375 transitions. [2018-02-04 19:36:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:36:19,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 19:36:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:19,080 INFO L225 Difference]: With dead ends: 359 [2018-02-04 19:36:19,080 INFO L226 Difference]: Without dead ends: 359 [2018-02-04 19:36:19,080 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:36:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-02-04 19:36:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 322. [2018-02-04 19:36:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-02-04 19:36:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 339 transitions. [2018-02-04 19:36:19,090 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 339 transitions. Word has length 33 [2018-02-04 19:36:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:19,090 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 339 transitions. [2018-02-04 19:36:19,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:36:19,091 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 339 transitions. [2018-02-04 19:36:19,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:36:19,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:19,092 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:19,092 INFO L371 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:19,092 INFO L82 PathProgramCache]: Analyzing trace with hash 816569686, now seen corresponding path program 1 times [2018-02-04 19:36:19,092 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:19,092 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:19,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:19,093 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:19,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:19,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:19,115 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:19,115 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:19,115 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:19,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:19,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:19,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:19,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:36:19,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:36:19,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 19:36:19,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:19,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:19,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 19:36:19,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:36:19,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:19,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:36:19,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-02-04 19:36:19,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:36:19,394 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:19,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:36:19,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:19,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:19,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2018-02-04 19:36:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:19,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:19,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:36:19,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:36:19,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:36:19,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:36:19,444 INFO L87 Difference]: Start difference. First operand 322 states and 339 transitions. Second operand 12 states. [2018-02-04 19:36:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:20,059 INFO L93 Difference]: Finished difference Result 341 states and 357 transitions. [2018-02-04 19:36:20,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:36:20,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-02-04 19:36:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:20,061 INFO L225 Difference]: With dead ends: 341 [2018-02-04 19:36:20,061 INFO L226 Difference]: Without dead ends: 341 [2018-02-04 19:36:20,061 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-02-04 19:36:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-02-04 19:36:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 323. [2018-02-04 19:36:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-04 19:36:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 341 transitions. [2018-02-04 19:36:20,066 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 341 transitions. Word has length 48 [2018-02-04 19:36:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:20,067 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 341 transitions. [2018-02-04 19:36:20,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:36:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 341 transitions. [2018-02-04 19:36:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:36:20,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:20,068 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:20,068 INFO L371 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 816569687, now seen corresponding path program 1 times [2018-02-04 19:36:20,068 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:20,068 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:20,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:20,069 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:20,069 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:20,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:20,084 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:20,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:20,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:20,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:20,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:20,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:20,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:36:20,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:36:20,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-02-04 19:36:20,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:20,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:20,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:20,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:20,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,208 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 [2018-02-04 19:36:20,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:36:20,232 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:20,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:36:20,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-02-04 19:36:20,263 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:20,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30 [2018-02-04 19:36:20,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2018-02-04 19:36:20,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:36:20,403 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:20,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:36:20,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-04 19:36:20,427 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:20,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:36:20,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:20,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:20,442 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:17 [2018-02-04 19:36:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:20,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:20,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:36:20,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:36:20,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:36:20,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:36:20,484 INFO L87 Difference]: Start difference. First operand 323 states and 341 transitions. Second operand 13 states. [2018-02-04 19:36:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:21,334 INFO L93 Difference]: Finished difference Result 353 states and 369 transitions. [2018-02-04 19:36:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:36:21,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-02-04 19:36:21,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:21,335 INFO L225 Difference]: With dead ends: 353 [2018-02-04 19:36:21,335 INFO L226 Difference]: Without dead ends: 353 [2018-02-04 19:36:21,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-02-04 19:36:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-02-04 19:36:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 323. [2018-02-04 19:36:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-04 19:36:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 340 transitions. [2018-02-04 19:36:21,340 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 340 transitions. Word has length 48 [2018-02-04 19:36:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:21,340 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 340 transitions. [2018-02-04 19:36:21,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:36:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 340 transitions. [2018-02-04 19:36:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 19:36:21,341 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:21,341 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:21,341 INFO L371 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1119918648, now seen corresponding path program 1 times [2018-02-04 19:36:21,341 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:21,341 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:21,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:21,342 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:21,342 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:21,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:21,353 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:21,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:21,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:21,354 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:21,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:21,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:21,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:21,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:21,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:21,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-02-04 19:36:21,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:21,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:36:21,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:21,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:36:21,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:21,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-04 19:36:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:21,548 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:21,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 19:36:21,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:36:21,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:36:21,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:36:21,549 INFO L87 Difference]: Start difference. First operand 323 states and 340 transitions. Second operand 11 states. [2018-02-04 19:36:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:21,876 INFO L93 Difference]: Finished difference Result 399 states and 420 transitions. [2018-02-04 19:36:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:36:21,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-02-04 19:36:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:21,878 INFO L225 Difference]: With dead ends: 399 [2018-02-04 19:36:21,878 INFO L226 Difference]: Without dead ends: 393 [2018-02-04 19:36:21,878 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:36:21,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-02-04 19:36:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2018-02-04 19:36:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-04 19:36:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 384 transitions. [2018-02-04 19:36:21,885 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 384 transitions. Word has length 48 [2018-02-04 19:36:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:21,885 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 384 transitions. [2018-02-04 19:36:21,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:36:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 384 transitions. [2018-02-04 19:36:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:36:21,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:21,886 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:21,886 INFO L371 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 387977136, now seen corresponding path program 1 times [2018-02-04 19:36:21,887 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:21,887 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:21,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:21,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:21,888 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:21,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:36:21,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:21,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:36:21,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:36:21,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:36:21,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:36:21,929 INFO L87 Difference]: Start difference. First operand 366 states and 384 transitions. Second operand 5 states. [2018-02-04 19:36:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:22,165 INFO L93 Difference]: Finished difference Result 386 states and 407 transitions. [2018-02-04 19:36:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:36:22,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-02-04 19:36:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:22,167 INFO L225 Difference]: With dead ends: 386 [2018-02-04 19:36:22,167 INFO L226 Difference]: Without dead ends: 386 [2018-02-04 19:36:22,167 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:36:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-02-04 19:36:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 367. [2018-02-04 19:36:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-04 19:36:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 387 transitions. [2018-02-04 19:36:22,171 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 387 transitions. Word has length 60 [2018-02-04 19:36:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:22,171 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 387 transitions. [2018-02-04 19:36:22,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:36:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 387 transitions. [2018-02-04 19:36:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 19:36:22,172 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:22,172 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:22,172 INFO L371 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash 387977137, now seen corresponding path program 1 times [2018-02-04 19:36:22,172 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:22,172 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:22,173 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:22,173 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:22,173 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:22,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:22,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:22,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:36:22,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:36:22,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:36:22,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:36:22,263 INFO L87 Difference]: Start difference. First operand 367 states and 387 transitions. Second operand 7 states. [2018-02-04 19:36:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:22,696 INFO L93 Difference]: Finished difference Result 398 states and 422 transitions. [2018-02-04 19:36:22,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:36:22,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-02-04 19:36:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:22,698 INFO L225 Difference]: With dead ends: 398 [2018-02-04 19:36:22,698 INFO L226 Difference]: Without dead ends: 398 [2018-02-04 19:36:22,698 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:36:22,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-04 19:36:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 380. [2018-02-04 19:36:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-02-04 19:36:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 403 transitions. [2018-02-04 19:36:22,704 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 403 transitions. Word has length 60 [2018-02-04 19:36:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:22,704 INFO L432 AbstractCegarLoop]: Abstraction has 380 states and 403 transitions. [2018-02-04 19:36:22,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:36:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 403 transitions. [2018-02-04 19:36:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 19:36:22,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:22,705 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:22,705 INFO L371 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:22,706 INFO L82 PathProgramCache]: Analyzing trace with hash -555377704, now seen corresponding path program 1 times [2018-02-04 19:36:22,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:22,706 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:22,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:22,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:22,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:22,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:22,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:36:22,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:22,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:36:22,749 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:36:22,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:36:22,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:36:22,749 INFO L87 Difference]: Start difference. First operand 380 states and 403 transitions. Second operand 5 states. [2018-02-04 19:36:22,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:22,940 INFO L93 Difference]: Finished difference Result 377 states and 400 transitions. [2018-02-04 19:36:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:36:22,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-02-04 19:36:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:22,941 INFO L225 Difference]: With dead ends: 377 [2018-02-04 19:36:22,941 INFO L226 Difference]: Without dead ends: 377 [2018-02-04 19:36:22,942 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:36:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-02-04 19:36:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-02-04 19:36:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-02-04 19:36:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 400 transitions. [2018-02-04 19:36:22,947 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 400 transitions. Word has length 62 [2018-02-04 19:36:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:22,947 INFO L432 AbstractCegarLoop]: Abstraction has 377 states and 400 transitions. [2018-02-04 19:36:22,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:36:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 400 transitions. [2018-02-04 19:36:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-02-04 19:36:22,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:22,948 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:22,948 INFO L371 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:22,948 INFO L82 PathProgramCache]: Analyzing trace with hash -555377703, now seen corresponding path program 1 times [2018-02-04 19:36:22,948 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:22,948 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:22,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:22,949 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:22,949 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:22,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:23,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:23,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:36:23,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:36:23,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:36:23,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:36:23,032 INFO L87 Difference]: Start difference. First operand 377 states and 400 transitions. Second operand 7 states. [2018-02-04 19:36:23,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:23,400 INFO L93 Difference]: Finished difference Result 422 states and 445 transitions. [2018-02-04 19:36:23,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:36:23,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-02-04 19:36:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:23,401 INFO L225 Difference]: With dead ends: 422 [2018-02-04 19:36:23,402 INFO L226 Difference]: Without dead ends: 422 [2018-02-04 19:36:23,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:36:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-02-04 19:36:23,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 403. [2018-02-04 19:36:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-02-04 19:36:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 432 transitions. [2018-02-04 19:36:23,407 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 432 transitions. Word has length 62 [2018-02-04 19:36:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:23,408 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 432 transitions. [2018-02-04 19:36:23,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:36:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 432 transitions. [2018-02-04 19:36:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 19:36:23,408 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:23,409 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:23,409 INFO L371 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1681231164, now seen corresponding path program 1 times [2018-02-04 19:36:23,409 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:23,409 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:23,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:23,410 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:23,410 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:23,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:23,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:23,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:23,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:23,649 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:23,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:23,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:36:23,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:23,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:23,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:23,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:36:23,765 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:23,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:23,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:23,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-02-04 19:36:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:23,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:23,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [11] total 22 [2018-02-04 19:36:23,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:36:23,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:36:23,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:36:23,791 INFO L87 Difference]: Start difference. First operand 403 states and 432 transitions. Second operand 22 states. [2018-02-04 19:36:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:24,363 INFO L93 Difference]: Finished difference Result 463 states and 493 transitions. [2018-02-04 19:36:24,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:36:24,364 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-02-04 19:36:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:24,365 INFO L225 Difference]: With dead ends: 463 [2018-02-04 19:36:24,365 INFO L226 Difference]: Without dead ends: 463 [2018-02-04 19:36:24,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 19:36:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-02-04 19:36:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 410. [2018-02-04 19:36:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 19:36:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 439 transitions. [2018-02-04 19:36:24,369 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 439 transitions. Word has length 64 [2018-02-04 19:36:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:24,369 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 439 transitions. [2018-02-04 19:36:24,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:36:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 439 transitions. [2018-02-04 19:36:24,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 19:36:24,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:24,370 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:24,370 INFO L371 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash 576751468, now seen corresponding path program 2 times [2018-02-04 19:36:24,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:24,370 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:24,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:24,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:24,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:24,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:24,381 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:24,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:24,381 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:24,381 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:36:24,407 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:36:24,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:36:24,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:24,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:24,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:36:24,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:36:24,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 19:36:24,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:24,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:24,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 19:36:24,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:36:24,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:24,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:36:24,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-02-04 19:36:24,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:36:24,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 19:36:24,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:24,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:24,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:11 [2018-02-04 19:36:24,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:36:24,557 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:24,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:36:24,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:36:24,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:36:24,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:36:24,558 INFO L87 Difference]: Start difference. First operand 410 states and 439 transitions. Second operand 11 states. [2018-02-04 19:36:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:24,982 INFO L93 Difference]: Finished difference Result 412 states and 439 transitions. [2018-02-04 19:36:24,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:36:24,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-02-04 19:36:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:24,983 INFO L225 Difference]: With dead ends: 412 [2018-02-04 19:36:24,983 INFO L226 Difference]: Without dead ends: 412 [2018-02-04 19:36:24,983 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:36:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-04 19:36:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-02-04 19:36:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 19:36:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 438 transitions. [2018-02-04 19:36:24,987 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 438 transitions. Word has length 64 [2018-02-04 19:36:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:24,987 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 438 transitions. [2018-02-04 19:36:24,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:36:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 438 transitions. [2018-02-04 19:36:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-02-04 19:36:24,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:24,988 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:24,988 INFO L371 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:24,988 INFO L82 PathProgramCache]: Analyzing trace with hash 576751469, now seen corresponding path program 1 times [2018-02-04 19:36:24,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:24,988 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:24,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:24,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:36:24,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:24,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:25,000 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:25,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:25,000 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:25,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:25,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:25,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-02-04 19:36:25,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:25,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-02-04 19:36:25,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:25,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:25,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:25,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:25,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-02-04 19:36:25,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 19:36:25,114 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:25,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:36:25,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:36:25,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:25,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:36:25,132 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,142 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:28 [2018-02-04 19:36:25,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:36:25,254 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:25,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:36:25,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:25,267 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:25,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 19:36:25,268 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:25,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:25,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:48, output treesize:14 [2018-02-04 19:36:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:36:25,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:25,295 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:36:25,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:36:25,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:36:25,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:36:25,295 INFO L87 Difference]: Start difference. First operand 410 states and 438 transitions. Second operand 13 states. [2018-02-04 19:36:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:25,978 INFO L93 Difference]: Finished difference Result 424 states and 451 transitions. [2018-02-04 19:36:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 19:36:25,978 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-02-04 19:36:25,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:25,979 INFO L225 Difference]: With dead ends: 424 [2018-02-04 19:36:25,979 INFO L226 Difference]: Without dead ends: 424 [2018-02-04 19:36:25,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:36:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-02-04 19:36:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 410. [2018-02-04 19:36:25,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-02-04 19:36:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 437 transitions. [2018-02-04 19:36:25,983 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 437 transitions. Word has length 64 [2018-02-04 19:36:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:25,983 INFO L432 AbstractCegarLoop]: Abstraction has 410 states and 437 transitions. [2018-02-04 19:36:25,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:36:25,983 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 437 transitions. [2018-02-04 19:36:25,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 19:36:25,983 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:25,983 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:25,984 INFO L371 AbstractCegarLoop]: === Iteration 21 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:25,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1652785484, now seen corresponding path program 1 times [2018-02-04 19:36:25,984 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:25,984 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:25,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:25,984 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:25,984 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:25,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:25,996 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:25,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:25,996 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:25,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:26,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:26,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:26,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:36:26,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:26,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:26,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:36:26,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:26,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:36:26,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:36:26,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:26,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-02-04 19:36:26,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:26,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:26,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:26,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:35 [2018-02-04 19:36:26,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 19:36:26,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 19:36:26,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:26,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:26,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2018-02-04 19:36:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:26,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:26,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 19:36:26,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:36:26,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:36:26,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:36:26,266 INFO L87 Difference]: Start difference. First operand 410 states and 437 transitions. Second operand 15 states. [2018-02-04 19:36:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:27,115 INFO L93 Difference]: Finished difference Result 430 states and 458 transitions. [2018-02-04 19:36:27,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 19:36:27,115 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2018-02-04 19:36:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:27,116 INFO L225 Difference]: With dead ends: 430 [2018-02-04 19:36:27,116 INFO L226 Difference]: Without dead ends: 430 [2018-02-04 19:36:27,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:36:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-02-04 19:36:27,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 413. [2018-02-04 19:36:27,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-02-04 19:36:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 441 transitions. [2018-02-04 19:36:27,120 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 441 transitions. Word has length 70 [2018-02-04 19:36:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:27,120 INFO L432 AbstractCegarLoop]: Abstraction has 413 states and 441 transitions. [2018-02-04 19:36:27,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:36:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 441 transitions. [2018-02-04 19:36:27,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 19:36:27,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:27,121 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:36:27,121 INFO L371 AbstractCegarLoop]: === Iteration 22 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:27,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1652785483, now seen corresponding path program 1 times [2018-02-04 19:36:27,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:27,121 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:27,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:27,121 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:27,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:27,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:27,135 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:27,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:27,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:27,136 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:27,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:27,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:27,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 19:36:27,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:27,222 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:27,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-02-04 19:36:27,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:27,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 19:36:27,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 27 [2018-02-04 19:36:27,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:27,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:27,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-02-04 19:36:27,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:27,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:27,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:27,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:27,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:27,335 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:44 [2018-02-04 19:36:27,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 19:36:27,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-02-04 19:36:27,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:27,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:36:27,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,438 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:27,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:27,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:23 [2018-02-04 19:36:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:27,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:27,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-04 19:36:27,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 19:36:27,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 19:36:27,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:36:27,495 INFO L87 Difference]: Start difference. First operand 413 states and 441 transitions. Second operand 17 states. [2018-02-04 19:36:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:28,537 INFO L93 Difference]: Finished difference Result 483 states and 512 transitions. [2018-02-04 19:36:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:36:28,537 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-02-04 19:36:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:28,538 INFO L225 Difference]: With dead ends: 483 [2018-02-04 19:36:28,538 INFO L226 Difference]: Without dead ends: 483 [2018-02-04 19:36:28,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 19:36:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-02-04 19:36:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 444. [2018-02-04 19:36:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-02-04 19:36:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 474 transitions. [2018-02-04 19:36:28,542 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 474 transitions. Word has length 70 [2018-02-04 19:36:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:28,543 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 474 transitions. [2018-02-04 19:36:28,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 19:36:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 474 transitions. [2018-02-04 19:36:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 19:36:28,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:28,543 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:28,543 INFO L371 AbstractCegarLoop]: === Iteration 23 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:28,543 INFO L82 PathProgramCache]: Analyzing trace with hash -416395486, now seen corresponding path program 1 times [2018-02-04 19:36:28,543 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:28,543 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:28,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:28,544 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:28,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:28,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:36:28,616 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:28,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:36:28,616 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:36:28,616 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:36:28,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:36:28,617 INFO L87 Difference]: Start difference. First operand 444 states and 474 transitions. Second operand 10 states. [2018-02-04 19:36:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:28,947 INFO L93 Difference]: Finished difference Result 479 states and 508 transitions. [2018-02-04 19:36:28,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:36:28,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-02-04 19:36:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:28,948 INFO L225 Difference]: With dead ends: 479 [2018-02-04 19:36:28,948 INFO L226 Difference]: Without dead ends: 479 [2018-02-04 19:36:28,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:36:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-02-04 19:36:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 471. [2018-02-04 19:36:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-02-04 19:36:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 505 transitions. [2018-02-04 19:36:28,952 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 505 transitions. Word has length 73 [2018-02-04 19:36:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:28,953 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 505 transitions. [2018-02-04 19:36:28,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:36:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 505 transitions. [2018-02-04 19:36:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 19:36:28,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:28,953 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:28,953 INFO L371 AbstractCegarLoop]: === Iteration 24 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash -416395485, now seen corresponding path program 1 times [2018-02-04 19:36:28,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:28,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:28,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:28,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:28,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:28,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:28,968 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:28,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:28,968 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:28,969 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:28,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:28,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:28,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:36:29,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:29,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 19:36:29,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:29,027 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:29,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:36:29,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 19:36:29,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:29,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:29,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:29,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:29,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-02-04 19:36:29,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 19:36:29,110 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:29,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 19:36:29,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 19:36:29,135 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:29,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:36:29,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:36 [2018-02-04 19:36:29,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-04 19:36:29,268 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:29,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-02-04 19:36:29,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:29,283 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:29,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 19:36:29,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:29,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:29,293 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:56, output treesize:18 [2018-02-04 19:36:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:29,336 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:29,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 19:36:29,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 19:36:29,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 19:36:29,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:36:29,336 INFO L87 Difference]: Start difference. First operand 471 states and 505 transitions. Second operand 15 states. [2018-02-04 19:36:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:30,265 INFO L93 Difference]: Finished difference Result 590 states and 627 transitions. [2018-02-04 19:36:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:36:30,265 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-02-04 19:36:30,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:30,266 INFO L225 Difference]: With dead ends: 590 [2018-02-04 19:36:30,266 INFO L226 Difference]: Without dead ends: 590 [2018-02-04 19:36:30,267 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:36:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-02-04 19:36:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 495. [2018-02-04 19:36:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-02-04 19:36:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 536 transitions. [2018-02-04 19:36:30,271 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 536 transitions. Word has length 73 [2018-02-04 19:36:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:30,271 INFO L432 AbstractCegarLoop]: Abstraction has 495 states and 536 transitions. [2018-02-04 19:36:30,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 19:36:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 536 transitions. [2018-02-04 19:36:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 19:36:30,272 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:30,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:30,272 INFO L371 AbstractCegarLoop]: === Iteration 25 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:30,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2030774639, now seen corresponding path program 1 times [2018-02-04 19:36:30,272 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:30,272 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:30,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:30,273 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:30,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:30,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:36:30,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:30,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:36:30,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:36:30,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:36:30,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:36:30,393 INFO L87 Difference]: Start difference. First operand 495 states and 536 transitions. Second operand 12 states. [2018-02-04 19:36:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:30,724 INFO L93 Difference]: Finished difference Result 503 states and 538 transitions. [2018-02-04 19:36:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:36:30,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 78 [2018-02-04 19:36:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:30,725 INFO L225 Difference]: With dead ends: 503 [2018-02-04 19:36:30,725 INFO L226 Difference]: Without dead ends: 503 [2018-02-04 19:36:30,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-04 19:36:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-02-04 19:36:30,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 487. [2018-02-04 19:36:30,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-02-04 19:36:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 522 transitions. [2018-02-04 19:36:30,729 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 522 transitions. Word has length 78 [2018-02-04 19:36:30,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:30,729 INFO L432 AbstractCegarLoop]: Abstraction has 487 states and 522 transitions. [2018-02-04 19:36:30,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:36:30,729 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 522 transitions. [2018-02-04 19:36:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 19:36:30,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:30,730 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:30,730 INFO L371 AbstractCegarLoop]: === Iteration 26 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2087785373, now seen corresponding path program 1 times [2018-02-04 19:36:30,730 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:30,730 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:30,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:30,731 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:30,731 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:30,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:30,740 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:30,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:30,740 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:30,741 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:30,768 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:30,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:30,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:36:30,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:30,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:30,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:36:30,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 19:36:30,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:30,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:30,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 19:36:30,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 19:36:30,866 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:30,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 19:36:30,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:30,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:30,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-02-04 19:36:31,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-02-04 19:36:31,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 19:36:31,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 8 xjuncts. [2018-02-04 19:36:31,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 19:36:31,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-02-04 19:36:31,431 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:31,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 19:36:31,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 19:36:31,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-04 19:36:31,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-02-04 19:36:31,561 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:117, output treesize:214 [2018-02-04 19:36:31,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:31,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:36:31,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:31,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:31,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-02-04 19:36:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:31,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:31,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 19:36:31,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 19:36:31,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 19:36:31,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-02-04 19:36:31,682 INFO L87 Difference]: Start difference. First operand 487 states and 522 transitions. Second operand 20 states. [2018-02-04 19:36:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:32,909 INFO L93 Difference]: Finished difference Result 574 states and 611 transitions. [2018-02-04 19:36:32,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 19:36:32,910 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-02-04 19:36:32,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:32,911 INFO L225 Difference]: With dead ends: 574 [2018-02-04 19:36:32,911 INFO L226 Difference]: Without dead ends: 574 [2018-02-04 19:36:32,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 19:36:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-02-04 19:36:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 492. [2018-02-04 19:36:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-02-04 19:36:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 530 transitions. [2018-02-04 19:36:32,917 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 530 transitions. Word has length 86 [2018-02-04 19:36:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:32,918 INFO L432 AbstractCegarLoop]: Abstraction has 492 states and 530 transitions. [2018-02-04 19:36:32,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 19:36:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 530 transitions. [2018-02-04 19:36:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-04 19:36:32,919 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:32,919 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:32,919 INFO L371 AbstractCegarLoop]: === Iteration 27 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2087785372, now seen corresponding path program 1 times [2018-02-04 19:36:32,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:32,919 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:32,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:32,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:32,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:32,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:32,945 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:32,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:32,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:32,946 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:32,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:33,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 19:36:33,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:36:33,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:36:33,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:36:33,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-04 19:36:33,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-02-04 19:36:33,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:33,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:33,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-02-04 19:36:33,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2018-02-04 19:36:33,106 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:33,113 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:36:33,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-02-04 19:36:33,126 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2018-02-04 19:36:33,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:36:33,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:33,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:36:33,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:36:33,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:36:33,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:36:33,201 INFO L87 Difference]: Start difference. First operand 492 states and 530 transitions. Second operand 11 states. [2018-02-04 19:36:39,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:39,807 INFO L93 Difference]: Finished difference Result 516 states and 555 transitions. [2018-02-04 19:36:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:36:39,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2018-02-04 19:36:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:39,808 INFO L225 Difference]: With dead ends: 516 [2018-02-04 19:36:39,808 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 19:36:39,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-02-04 19:36:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 19:36:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 498. [2018-02-04 19:36:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-02-04 19:36:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 537 transitions. [2018-02-04 19:36:39,813 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 537 transitions. Word has length 86 [2018-02-04 19:36:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:39,814 INFO L432 AbstractCegarLoop]: Abstraction has 498 states and 537 transitions. [2018-02-04 19:36:39,814 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:36:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 537 transitions. [2018-02-04 19:36:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:36:39,815 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:39,815 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-04 19:36:39,815 INFO L371 AbstractCegarLoop]: === Iteration 28 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:39,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1341367099, now seen corresponding path program 1 times [2018-02-04 19:36:39,815 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:39,815 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:39,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:39,816 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:39,816 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:39,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:39,838 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:39,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:39,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:39,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:39,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:39,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:39,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:39,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:36:39,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 19:36:39,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:39,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:39,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:26 [2018-02-04 19:36:39,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 19:36:39,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:39,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 19:36:39,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:39,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-02-04 19:36:40,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,011 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-04 19:36:40,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:43 [2018-02-04 19:36:40,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:36:40,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:40,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:50 [2018-02-04 19:36:40,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-02-04 19:36:40,106 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:36:40,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-02-04 19:36:40,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,142 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-02-04 19:36:40,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:74 [2018-02-04 19:36:40,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2018-02-04 19:36:40,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:36:40,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:90 [2018-02-04 19:36:40,318 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,322 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 98 [2018-02-04 19:36:40,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,343 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 93 [2018-02-04 19:36:40,344 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:36:40,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:40,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:40,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:138 [2018-02-04 19:36:40,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:40,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-02-04 19:36:40,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:133, output treesize:122 [2018-02-04 19:36:40,742 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:40,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 88 [2018-02-04 19:36:40,749 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:40,757 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2018-02-04 19:36:40,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:36:40,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 40 [2018-02-04 19:36:40,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:40,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:40,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:40,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:129, output treesize:45 [2018-02-04 19:36:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:40,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:40,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 19:36:40,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:36:40,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:36:40,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:36:40,946 INFO L87 Difference]: Start difference. First operand 498 states and 537 transitions. Second operand 23 states. [2018-02-04 19:36:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:43,065 INFO L93 Difference]: Finished difference Result 518 states and 556 transitions. [2018-02-04 19:36:43,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:36:43,065 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-04 19:36:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:43,066 INFO L225 Difference]: With dead ends: 518 [2018-02-04 19:36:43,066 INFO L226 Difference]: Without dead ends: 518 [2018-02-04 19:36:43,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 19:36:43,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-02-04 19:36:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 499. [2018-02-04 19:36:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 19:36:43,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 539 transitions. [2018-02-04 19:36:43,071 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 539 transitions. Word has length 85 [2018-02-04 19:36:43,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:43,071 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 539 transitions. [2018-02-04 19:36:43,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:36:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 539 transitions. [2018-02-04 19:36:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:36:43,071 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:43,072 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-04 19:36:43,072 INFO L371 AbstractCegarLoop]: === Iteration 29 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:43,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1341367098, now seen corresponding path program 1 times [2018-02-04 19:36:43,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:43,072 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:43,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:43,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:43,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:43,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:43,089 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:43,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:43,090 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:43,090 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:43,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:43,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-02-04 19:36:43,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:43,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:43,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2018-02-04 19:36:43,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:43,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:43,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:43,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:43,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,230 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-02-04 19:36:43,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 19:36:43,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:36:43,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:36:43,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:36:43,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:33 [2018-02-04 19:36:43,331 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 35 [2018-02-04 19:36:43,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:43,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,373 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 19:36:43,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:43,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:53 [2018-02-04 19:36:43,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-02-04 19:36:43,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:43,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:36:43,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:43,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:43,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:75, output treesize:67 [2018-02-04 19:36:43,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-04 19:36:43,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:36:43,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:36:43,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:36:43,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:43,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:67 [2018-02-04 19:36:43,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,632 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2018-02-04 19:36:43,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:43,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-02-04 19:36:43,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:43,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:73 [2018-02-04 19:36:43,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 19:36:43,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:43,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-02-04 19:36:43,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:43,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:43,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:95, output treesize:97 [2018-02-04 19:36:43,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 54 [2018-02-04 19:36:43,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:36:43,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-02-04 19:36:43,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:43,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-02-04 19:36:43,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:43,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:43,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:123, output treesize:133 [2018-02-04 19:36:44,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 97 [2018-02-04 19:36:44,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2018-02-04 19:36:44,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:44,273 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:44,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:36:44,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:44,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-02-04 19:36:44,301 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:44,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 9 [2018-02-04 19:36:44,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:44,306 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:44,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 19:36:44,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:44,309 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:44,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:44,317 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:155, output treesize:39 [2018-02-04 19:36:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:44,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:44,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 19:36:44,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:36:44,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:36:44,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:36:44,402 INFO L87 Difference]: Start difference. First operand 499 states and 539 transitions. Second operand 23 states. [2018-02-04 19:36:45,464 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 127 DAG size of output 111 [2018-02-04 19:36:45,627 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 130 DAG size of output 118 [2018-02-04 19:36:45,836 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 137 DAG size of output 125 [2018-02-04 19:36:46,043 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 131 DAG size of output 119 [2018-02-04 19:36:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:48,074 INFO L93 Difference]: Finished difference Result 548 states and 588 transitions. [2018-02-04 19:36:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 19:36:48,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-04 19:36:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:48,075 INFO L225 Difference]: With dead ends: 548 [2018-02-04 19:36:48,075 INFO L226 Difference]: Without dead ends: 548 [2018-02-04 19:36:48,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=366, Invalid=1704, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 19:36:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-02-04 19:36:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 499. [2018-02-04 19:36:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 19:36:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 538 transitions. [2018-02-04 19:36:48,080 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 538 transitions. Word has length 85 [2018-02-04 19:36:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:48,080 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 538 transitions. [2018-02-04 19:36:48,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:36:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 538 transitions. [2018-02-04 19:36:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:36:48,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:48,081 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 19:36:48,081 INFO L371 AbstractCegarLoop]: === Iteration 30 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:48,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1038018137, now seen corresponding path program 1 times [2018-02-04 19:36:48,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:48,081 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:48,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:48,081 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:48,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:48,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:48,100 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:48,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:48,100 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:48,101 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:48,140 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:48,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 19:36:48,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 19:36:48,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:48,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:48,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-02-04 19:36:48,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 19:36:48,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 19:36:48,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:29 [2018-02-04 19:36:48,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,235 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-02-04 19:36:48,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:49 [2018-02-04 19:36:48,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:36:48,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:48,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:56 [2018-02-04 19:36:48,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-02-04 19:36:48,329 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:36:48,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:56 [2018-02-04 19:36:48,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,370 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-02-04 19:36:48,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:70, output treesize:80 [2018-02-04 19:36:48,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 70 [2018-02-04 19:36:48,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:36:48,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:96 [2018-02-04 19:36:48,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:36:48,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:36:48,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,515 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 98 [2018-02-04 19:36:48,519 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,526 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 93 [2018-02-04 19:36:48,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:36:48,555 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:122, output treesize:144 [2018-02-04 19:36:48,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 19:36:48,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 19:36:48,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:48,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:139, output treesize:128 [2018-02-04 19:36:48,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 88 [2018-02-04 19:36:48,810 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 57 [2018-02-04 19:36:48,812 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-02-04 19:36:48,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:48,843 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,871 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:48,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-02-04 19:36:48,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,873 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,874 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:48,874 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:48,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2018-02-04 19:36:48,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:48,877 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:36:48,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 59 [2018-02-04 19:36:48,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:48,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-02-04 19:36:48,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-02-04 19:36:48,965 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:135, output treesize:136 [2018-02-04 19:36:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:49,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:49,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 19:36:49,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:36:49,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:36:49,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-02-04 19:36:49,063 INFO L87 Difference]: Start difference. First operand 499 states and 538 transitions. Second operand 23 states. [2018-02-04 19:36:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:51,758 INFO L93 Difference]: Finished difference Result 516 states and 554 transitions. [2018-02-04 19:36:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:36:51,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-04 19:36:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:51,760 INFO L225 Difference]: With dead ends: 516 [2018-02-04 19:36:51,761 INFO L226 Difference]: Without dead ends: 516 [2018-02-04 19:36:51,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=312, Invalid=1668, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 19:36:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-02-04 19:36:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 499. [2018-02-04 19:36:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 19:36:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 537 transitions. [2018-02-04 19:36:51,767 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 537 transitions. Word has length 85 [2018-02-04 19:36:51,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:51,768 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 537 transitions. [2018-02-04 19:36:51,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:36:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 537 transitions. [2018-02-04 19:36:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-04 19:36:51,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:51,769 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-02-04 19:36:51,769 INFO L371 AbstractCegarLoop]: === Iteration 31 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1038018136, now seen corresponding path program 1 times [2018-02-04 19:36:51,769 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:51,769 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:51,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:51,770 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:51,770 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:51,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:51,793 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:51,793 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:51,793 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:51,794 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:51,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:51,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 20 [2018-02-04 19:36:51,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:51,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:36:51,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:24 [2018-02-04 19:36:51,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:51,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:51,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:36:51,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:51,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:30 [2018-02-04 19:36:51,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-02-04 19:36:51,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:51,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 19:36:51,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-02-04 19:36:51,974 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:51,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:36:51,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:51,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:30 [2018-02-04 19:36:51,996 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 35 [2018-02-04 19:36:52,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:52,017 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 19:36:52,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:47 [2018-02-04 19:36:52,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-02-04 19:36:52,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:52,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:36:52,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:52,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:61 [2018-02-04 19:36:52,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-04 19:36:52,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:36:52,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:36:52,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:36:52,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:61 [2018-02-04 19:36:52,161 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,162 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-02-04 19:36:52,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 48 [2018-02-04 19:36:52,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:52,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-02-04 19:36:52,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-02-04 19:36:52,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:52,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 19:36:52,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:36:52,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:91 [2018-02-04 19:36:52,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-02-04 19:36:52,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 63 [2018-02-04 19:36:52,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 60 [2018-02-04 19:36:52,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:36:52,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 19:36:52,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,372 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:114, output treesize:127 [2018-02-04 19:36:52,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:52,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:52,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:131, output treesize:126 [2018-02-04 19:36:52,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 97 [2018-02-04 19:36:52,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:36:52,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2018-02-04 19:36:52,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:52,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:52,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2018-02-04 19:36:52,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:36:52,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-02-04 19:36:52,651 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,652 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:52,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:36:52,658 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:142, output treesize:36 [2018-02-04 19:36:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:36:52,739 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:36:52,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-02-04 19:36:52,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:36:52,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:36:52,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:36:52,740 INFO L87 Difference]: Start difference. First operand 499 states and 537 transitions. Second operand 22 states. [2018-02-04 19:36:53,582 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 106 DAG size of output 103 [2018-02-04 19:36:53,741 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 114 DAG size of output 110 [2018-02-04 19:36:53,939 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 121 DAG size of output 117 [2018-02-04 19:36:54,112 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 115 DAG size of output 111 [2018-02-04 19:36:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:36:55,664 INFO L93 Difference]: Finished difference Result 546 states and 586 transitions. [2018-02-04 19:36:55,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 19:36:55,664 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-02-04 19:36:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:36:55,665 INFO L225 Difference]: With dead ends: 546 [2018-02-04 19:36:55,666 INFO L226 Difference]: Without dead ends: 546 [2018-02-04 19:36:55,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 19:36:55,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-04 19:36:55,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 499. [2018-02-04 19:36:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 19:36:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 536 transitions. [2018-02-04 19:36:55,670 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 536 transitions. Word has length 85 [2018-02-04 19:36:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:36:55,670 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 536 transitions. [2018-02-04 19:36:55,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:36:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 536 transitions. [2018-02-04 19:36:55,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 19:36:55,671 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:36:55,671 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:36:55,671 INFO L371 AbstractCegarLoop]: === Iteration 32 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:36:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash -296838353, now seen corresponding path program 1 times [2018-02-04 19:36:55,671 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:36:55,671 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:36:55,671 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:55,671 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:55,672 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:36:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:55,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:36:55,687 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:36:55,687 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:36:55,687 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:36:55,688 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:36:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:36:55,705 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:36:55,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-02-04 19:36:55,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 19:36:55,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:55,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:36:55,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:36:55,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:55,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:36:55,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:55,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-02-04 19:36:55,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 13 [2018-02-04 19:36:55,846 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 19:36:55,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:36:55,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:36:55,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:55,867 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-02-04 19:36:55,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:36:55,871 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,874 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:36:55,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 19:36:55,887 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:65, output treesize:24 [2018-02-04 19:36:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:36:55,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:36:55,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:36:55,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:36:55,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:36:55,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=68, Unknown=3, NotChecked=0, Total=90 [2018-02-04 19:36:55,935 INFO L87 Difference]: Start difference. First operand 499 states and 536 transitions. Second operand 10 states. [2018-02-04 19:37:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:32,470 INFO L93 Difference]: Finished difference Result 514 states and 551 transitions. [2018-02-04 19:37:32,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:37:32,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-02-04 19:37:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:32,472 INFO L225 Difference]: With dead ends: 514 [2018-02-04 19:37:32,472 INFO L226 Difference]: Without dead ends: 514 [2018-02-04 19:37:32,472 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=159, Unknown=6, NotChecked=0, Total=210 [2018-02-04 19:37:32,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-02-04 19:37:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 499. [2018-02-04 19:37:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 19:37:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 535 transitions. [2018-02-04 19:37:32,476 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 535 transitions. Word has length 87 [2018-02-04 19:37:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:32,476 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 535 transitions. [2018-02-04 19:37:32,476 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:37:32,476 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 535 transitions. [2018-02-04 19:37:32,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 19:37:32,477 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:32,477 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:32,477 INFO L371 AbstractCegarLoop]: === Iteration 33 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:32,477 INFO L82 PathProgramCache]: Analyzing trace with hash -612005276, now seen corresponding path program 1 times [2018-02-04 19:37:32,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:32,478 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:32,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:32,478 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:32,478 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:32,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:32,489 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:32,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:32,489 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:32,490 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:32,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:32,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:37:32,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:32,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:32,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:32,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:32,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-02-04 19:37:32,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-02-04 19:37:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:32,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30 [2018-02-04 19:37:32,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:32,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:32,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:32,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2018-02-04 19:37:32,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-04 19:37:32,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2018-02-04 19:37:32,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 19:37:32,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:37:32,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:37:32,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2018-02-04 19:37:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:37:32,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:32,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 19:37:32,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 19:37:32,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 19:37:32,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-02-04 19:37:32,911 INFO L87 Difference]: Start difference. First operand 499 states and 535 transitions. Second operand 18 states. [2018-02-04 19:37:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:33,897 INFO L93 Difference]: Finished difference Result 583 states and 618 transitions. [2018-02-04 19:37:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:37:33,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 88 [2018-02-04 19:37:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:33,899 INFO L225 Difference]: With dead ends: 583 [2018-02-04 19:37:33,899 INFO L226 Difference]: Without dead ends: 583 [2018-02-04 19:37:33,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=294, Invalid=896, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 19:37:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-02-04 19:37:33,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 499. [2018-02-04 19:37:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-02-04 19:37:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 534 transitions. [2018-02-04 19:37:33,904 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 534 transitions. Word has length 88 [2018-02-04 19:37:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:33,904 INFO L432 AbstractCegarLoop]: Abstraction has 499 states and 534 transitions. [2018-02-04 19:37:33,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 19:37:33,904 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 534 transitions. [2018-02-04 19:37:33,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-04 19:37:33,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:33,905 INFO L351 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:33,905 INFO L371 AbstractCegarLoop]: === Iteration 34 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:33,905 INFO L82 PathProgramCache]: Analyzing trace with hash 802425175, now seen corresponding path program 1 times [2018-02-04 19:37:33,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:33,905 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:33,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:33,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:33,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:33,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:33,923 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:33,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:33,923 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:33,924 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:33,957 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:33,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:37:33,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:33,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:33,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:33,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:37:33,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:33,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:33,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:33,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:33,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 19:37:34,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 19:37:34,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:37:34,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-02-04 19:37:34,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:37:34,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:26 [2018-02-04 19:37:34,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,044 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:37:34,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-02-04 19:37:34,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:37:34,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:34,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:37:34,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:34,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:73 [2018-02-04 19:37:34,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-02-04 19:37:34,169 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 63 [2018-02-04 19:37:34,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2018-02-04 19:37:34,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-02-04 19:37:34,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:34,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:73 [2018-02-04 19:37:34,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-02-04 19:37:34,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:34,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:81, output treesize:62 [2018-02-04 19:37:34,607 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:34,609 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:37:34,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-02-04 19:37:34,614 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:37:34,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-02-04 19:37:34,615 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:34,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:37:34,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:37:34,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:37:34,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-02-04 19:37:34,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:34,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 19:37:34,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-02-04 19:37:34,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 19:37:34,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-02-04 19:37:34,676 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:37:34,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2018-02-04 19:37:34,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-02-04 19:37:34,694 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:34,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:37:34,701 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,705 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:34,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 19:37:34,724 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:90, output treesize:28 [2018-02-04 19:37:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:37:34,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:37:34,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-04 19:37:34,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 19:37:34,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 19:37:34,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=475, Unknown=3, NotChecked=0, Total=552 [2018-02-04 19:37:34,843 INFO L87 Difference]: Start difference. First operand 499 states and 534 transitions. Second operand 24 states. [2018-02-04 19:37:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:36,609 INFO L93 Difference]: Finished difference Result 579 states and 612 transitions. [2018-02-04 19:37:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 19:37:36,609 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 92 [2018-02-04 19:37:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:36,611 INFO L225 Difference]: With dead ends: 579 [2018-02-04 19:37:36,611 INFO L226 Difference]: Without dead ends: 579 [2018-02-04 19:37:36,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=1496, Unknown=3, NotChecked=0, Total=1806 [2018-02-04 19:37:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-02-04 19:37:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 502. [2018-02-04 19:37:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-02-04 19:37:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 537 transitions. [2018-02-04 19:37:36,618 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 537 transitions. Word has length 92 [2018-02-04 19:37:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:36,618 INFO L432 AbstractCegarLoop]: Abstraction has 502 states and 537 transitions. [2018-02-04 19:37:36,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 19:37:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 537 transitions. [2018-02-04 19:37:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 19:37:36,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:36,619 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:37:36,619 INFO L371 AbstractCegarLoop]: === Iteration 35 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash -334022481, now seen corresponding path program 2 times [2018-02-04 19:37:36,620 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:36,620 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:36,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:36,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:36,621 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:36,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:36,645 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:36,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:36,645 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:36,646 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:37:36,695 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:37:36,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:37:36,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:36,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:37:36,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-04 19:37:36,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:37:36,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:36,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-02-04 19:37:36,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:36,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:36,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:36,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:36,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-02-04 19:37:36,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,776 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:37:36,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2018-02-04 19:37:36,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:37:36,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:36,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:37:36,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:36,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-02-04 19:37:36,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:37:36,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:37:36,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:37:36,883 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:37:36,884 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:84, output treesize:46 [2018-02-04 19:37:36,899 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,900 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:36,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 19:37:36,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-02-04 19:37:36,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-04 19:37:36,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:36,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 19:37:36,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:36,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:36,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:71 [2018-02-04 19:37:37,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2018-02-04 19:37:37,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:37,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2018-02-04 19:37:37,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-02-04 19:37:37,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:37,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 19:37:37,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:101 [2018-02-04 19:37:37,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 95 [2018-02-04 19:37:37,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:37:37,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,283 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:37:37,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:37:37,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2018-02-04 19:37:37,292 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:37,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:37,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2018-02-04 19:37:37,326 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:37:37,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:37:37,326 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:37,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-04 19:37:37,334 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:37,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:37:37,338 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:37,345 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:143, output treesize:12 [2018-02-04 19:37:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:37:37,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:37:37,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-04 19:37:37,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:37:37,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:37:37,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=437, Unknown=14, NotChecked=0, Total=506 [2018-02-04 19:37:37,392 INFO L87 Difference]: Start difference. First operand 502 states and 537 transitions. Second operand 23 states. [2018-02-04 19:37:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:39,137 INFO L93 Difference]: Finished difference Result 631 states and 675 transitions. [2018-02-04 19:37:39,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:37:39,137 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-02-04 19:37:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:39,139 INFO L225 Difference]: With dead ends: 631 [2018-02-04 19:37:39,139 INFO L226 Difference]: Without dead ends: 625 [2018-02-04 19:37:39,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=1422, Unknown=28, NotChecked=0, Total=1640 [2018-02-04 19:37:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2018-02-04 19:37:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 584. [2018-02-04 19:37:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-02-04 19:37:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 621 transitions. [2018-02-04 19:37:39,143 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 621 transitions. Word has length 91 [2018-02-04 19:37:39,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:39,144 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 621 transitions. [2018-02-04 19:37:39,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:37:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 621 transitions. [2018-02-04 19:37:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-04 19:37:39,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:39,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:39,144 INFO L371 AbstractCegarLoop]: === Iteration 36 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -894624581, now seen corresponding path program 1 times [2018-02-04 19:37:39,144 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:39,144 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:39,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:39,145 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:37:39,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:39,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:39,159 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:39,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:39,159 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:39,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:39,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:39,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:37:39,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:39,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:41 [2018-02-04 19:37:39,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-02-04 19:37:39,269 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2018-02-04 19:37:39,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:39,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:41 [2018-02-04 19:37:39,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-02-04 19:37:39,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-04 19:37:39,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,416 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-02-04 19:37:39,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-04 19:37:39,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,425 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:37:39,441 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:87, output treesize:63 [2018-02-04 19:37:39,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-02-04 19:37:39,650 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 19:37:39,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-02-04 19:37:39,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-02-04 19:37:39,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,694 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:39,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:37:39,707 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:87, output treesize:63 [2018-02-04 19:37:39,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-02-04 19:37:39,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 31 [2018-02-04 19:37:39,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:37:39,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:37:39,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-02-04 19:37:39,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:39,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-02-04 19:37:39,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:39,854 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:39,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-02-04 19:37:39,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:100 [2018-02-04 19:37:40,051 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~node~2.base Int) (v_prenex_56 Int)) (let ((.cse0 (store |c_old(#valid)| main_~node~2.base 1))) (and (not (= v_prenex_56 0)) (not (= 0 main_~node~2.base)) (= 0 (select .cse0 v_prenex_56)) (= 0 (select |c_old(#valid)| main_~node~2.base)) (= |c_#valid| (store (store .cse0 v_prenex_56 0) main_~node~2.base 0))))) is different from true [2018-02-04 19:37:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-02-04 19:37:40,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:37:40,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-04 19:37:40,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 19:37:40,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 19:37:40,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=4, NotChecked=40, Total=506 [2018-02-04 19:37:40,080 INFO L87 Difference]: Start difference. First operand 584 states and 621 transitions. Second operand 23 states. [2018-02-04 19:37:41,405 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 89 DAG size of output 49 [2018-02-04 19:37:42,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:42,171 INFO L93 Difference]: Finished difference Result 640 states and 678 transitions. [2018-02-04 19:37:42,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 19:37:42,171 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2018-02-04 19:37:42,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:42,173 INFO L225 Difference]: With dead ends: 640 [2018-02-04 19:37:42,173 INFO L226 Difference]: Without dead ends: 572 [2018-02-04 19:37:42,173 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=1082, Unknown=4, NotChecked=68, Total=1332 [2018-02-04 19:37:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-02-04 19:37:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 550. [2018-02-04 19:37:42,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 19:37:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 583 transitions. [2018-02-04 19:37:42,178 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 583 transitions. Word has length 93 [2018-02-04 19:37:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:42,179 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 583 transitions. [2018-02-04 19:37:42,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 19:37:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 583 transitions. [2018-02-04 19:37:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 19:37:42,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:42,180 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:42,180 INFO L371 AbstractCegarLoop]: === Iteration 37 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1650413227, now seen corresponding path program 1 times [2018-02-04 19:37:42,180 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:42,180 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:42,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:42,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:42,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:42,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:42,470 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:37:42,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:42,471 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:42,471 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:42,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:42,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:37:42,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-02-04 19:37:42,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:42,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:42,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:42,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-02-04 19:37:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:37:42,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:37:42,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 23 [2018-02-04 19:37:42,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 19:37:42,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 19:37:42,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-02-04 19:37:42,643 INFO L87 Difference]: Start difference. First operand 550 states and 583 transitions. Second operand 24 states. [2018-02-04 19:37:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:43,548 INFO L93 Difference]: Finished difference Result 562 states and 596 transitions. [2018-02-04 19:37:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:37:43,548 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-02-04 19:37:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:43,549 INFO L225 Difference]: With dead ends: 562 [2018-02-04 19:37:43,549 INFO L226 Difference]: Without dead ends: 562 [2018-02-04 19:37:43,550 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 19:37:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-02-04 19:37:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 550. [2018-02-04 19:37:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 19:37:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 584 transitions. [2018-02-04 19:37:43,553 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 584 transitions. Word has length 101 [2018-02-04 19:37:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:43,553 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 584 transitions. [2018-02-04 19:37:43,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 19:37:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 584 transitions. [2018-02-04 19:37:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-04 19:37:43,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:43,554 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:43,555 INFO L371 AbstractCegarLoop]: === Iteration 38 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1650413228, now seen corresponding path program 1 times [2018-02-04 19:37:43,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:43,555 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:43,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:43,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:43,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:43,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:43,572 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:43,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:43,572 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:43,573 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:43,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:43,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:43,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:43,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:43,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:43,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,625 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-02-04 19:37:43,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-02-04 19:37:43,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-02-04 19:37:43,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-02-04 19:37:43,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-02-04 19:37:43,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:43,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-02-04 19:37:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:37:43,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:37:43,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 19:37:43,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 19:37:43,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 19:37:43,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-02-04 19:37:43,763 INFO L87 Difference]: Start difference. First operand 550 states and 584 transitions. Second operand 16 states. [2018-02-04 19:37:44,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:44,571 INFO L93 Difference]: Finished difference Result 570 states and 602 transitions. [2018-02-04 19:37:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 19:37:44,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 101 [2018-02-04 19:37:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:44,572 INFO L225 Difference]: With dead ends: 570 [2018-02-04 19:37:44,572 INFO L226 Difference]: Without dead ends: 570 [2018-02-04 19:37:44,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:37:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-02-04 19:37:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 550. [2018-02-04 19:37:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 19:37:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 583 transitions. [2018-02-04 19:37:44,576 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 583 transitions. Word has length 101 [2018-02-04 19:37:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:44,576 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 583 transitions. [2018-02-04 19:37:44,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 19:37:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 583 transitions. [2018-02-04 19:37:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-02-04 19:37:44,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:44,577 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:44,577 INFO L371 AbstractCegarLoop]: === Iteration 39 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:44,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1101824494, now seen corresponding path program 1 times [2018-02-04 19:37:44,577 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:44,577 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:44,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,578 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:44,578 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:44,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-02-04 19:37:44,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:44,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 19:37:44,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:37:44,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:37:44,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:37:44,611 INFO L87 Difference]: Start difference. First operand 550 states and 583 transitions. Second operand 7 states. [2018-02-04 19:37:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:44,706 INFO L93 Difference]: Finished difference Result 578 states and 607 transitions. [2018-02-04 19:37:44,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:37:44,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-02-04 19:37:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:44,708 INFO L225 Difference]: With dead ends: 578 [2018-02-04 19:37:44,708 INFO L226 Difference]: Without dead ends: 575 [2018-02-04 19:37:44,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:37:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-02-04 19:37:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 550. [2018-02-04 19:37:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 19:37:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 582 transitions. [2018-02-04 19:37:44,713 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 582 transitions. Word has length 102 [2018-02-04 19:37:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:44,713 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 582 transitions. [2018-02-04 19:37:44,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:37:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 582 transitions. [2018-02-04 19:37:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 19:37:44,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:44,714 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:44,714 INFO L371 AbstractCegarLoop]: === Iteration 40 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1324593485, now seen corresponding path program 1 times [2018-02-04 19:37:44,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:44,714 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:44,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:44,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:44,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:37:44,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:44,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:37:44,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:37:44,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:37:44,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:37:44,742 INFO L87 Difference]: Start difference. First operand 550 states and 582 transitions. Second operand 3 states. [2018-02-04 19:37:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:44,797 INFO L93 Difference]: Finished difference Result 546 states and 578 transitions. [2018-02-04 19:37:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:37:44,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-02-04 19:37:44,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:44,798 INFO L225 Difference]: With dead ends: 546 [2018-02-04 19:37:44,798 INFO L226 Difference]: Without dead ends: 546 [2018-02-04 19:37:44,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 19:37:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-02-04 19:37:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2018-02-04 19:37:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-02-04 19:37:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 578 transitions. [2018-02-04 19:37:44,802 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 578 transitions. Word has length 104 [2018-02-04 19:37:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:44,802 INFO L432 AbstractCegarLoop]: Abstraction has 546 states and 578 transitions. [2018-02-04 19:37:44,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:37:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 578 transitions. [2018-02-04 19:37:44,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 19:37:44,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:44,803 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:44,803 INFO L371 AbstractCegarLoop]: === Iteration 41 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1324593484, now seen corresponding path program 1 times [2018-02-04 19:37:44,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:44,803 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:44,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,804 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:44,804 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:44,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:44,862 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:37:44,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:44,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:37:44,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:37:44,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:37:44,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:37:44,863 INFO L87 Difference]: Start difference. First operand 546 states and 578 transitions. Second operand 3 states. [2018-02-04 19:37:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:44,947 INFO L93 Difference]: Finished difference Result 542 states and 574 transitions. [2018-02-04 19:37:44,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:37:44,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-02-04 19:37:44,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:44,948 INFO L225 Difference]: With dead ends: 542 [2018-02-04 19:37:44,949 INFO L226 Difference]: Without dead ends: 542 [2018-02-04 19:37:44,949 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-04 19:37:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-02-04 19:37:44,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2018-02-04 19:37:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-02-04 19:37:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 574 transitions. [2018-02-04 19:37:44,952 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 574 transitions. Word has length 104 [2018-02-04 19:37:44,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:44,952 INFO L432 AbstractCegarLoop]: Abstraction has 542 states and 574 transitions. [2018-02-04 19:37:44,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:37:44,952 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 574 transitions. [2018-02-04 19:37:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 19:37:44,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:44,953 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:44,953 INFO L371 AbstractCegarLoop]: === Iteration 42 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1595111753, now seen corresponding path program 1 times [2018-02-04 19:37:44,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:44,953 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:44,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:44,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:44,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:44,965 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:44,965 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:44,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:44,965 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:44,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:44,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:37:44,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:44,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:44,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:37:44,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:37:44,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:44,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:44,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:37:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:37:45,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:45,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:37:45,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:37:45,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:37:45,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:37:45,002 INFO L87 Difference]: Start difference. First operand 542 states and 574 transitions. Second operand 3 states. [2018-02-04 19:37:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:45,066 INFO L93 Difference]: Finished difference Result 537 states and 569 transitions. [2018-02-04 19:37:45,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:37:45,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-02-04 19:37:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:45,067 INFO L225 Difference]: With dead ends: 537 [2018-02-04 19:37:45,067 INFO L226 Difference]: Without dead ends: 537 [2018-02-04 19:37:45,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:37:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-02-04 19:37:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2018-02-04 19:37:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-02-04 19:37:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 569 transitions. [2018-02-04 19:37:45,072 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 569 transitions. Word has length 108 [2018-02-04 19:37:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:45,073 INFO L432 AbstractCegarLoop]: Abstraction has 537 states and 569 transitions. [2018-02-04 19:37:45,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:37:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 569 transitions. [2018-02-04 19:37:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-02-04 19:37:45,074 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:45,074 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:45,074 INFO L371 AbstractCegarLoop]: === Iteration 43 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:45,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1595111752, now seen corresponding path program 1 times [2018-02-04 19:37:45,074 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:45,074 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:45,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:45,075 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:45,075 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:45,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:45,091 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:45,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:45,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:45,092 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:45,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:45,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:37:45,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:45,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:45,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:37:45,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 19:37:45,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:45,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:45,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-02-04 19:37:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:37:45,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:45,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:37:45,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:37:45,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:37:45,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:37:45,135 INFO L87 Difference]: Start difference. First operand 537 states and 569 transitions. Second operand 3 states. [2018-02-04 19:37:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:45,230 INFO L93 Difference]: Finished difference Result 532 states and 564 transitions. [2018-02-04 19:37:45,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:37:45,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-02-04 19:37:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:45,232 INFO L225 Difference]: With dead ends: 532 [2018-02-04 19:37:45,232 INFO L226 Difference]: Without dead ends: 532 [2018-02-04 19:37:45,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:37:45,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-02-04 19:37:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-02-04 19:37:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-02-04 19:37:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 564 transitions. [2018-02-04 19:37:45,238 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 564 transitions. Word has length 108 [2018-02-04 19:37:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:45,239 INFO L432 AbstractCegarLoop]: Abstraction has 532 states and 564 transitions. [2018-02-04 19:37:45,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:37:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 564 transitions. [2018-02-04 19:37:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 19:37:45,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:45,240 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:45,240 INFO L371 AbstractCegarLoop]: === Iteration 44 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2144112081, now seen corresponding path program 1 times [2018-02-04 19:37:45,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:45,241 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:45,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:45,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:45,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:45,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:37:45,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:45,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:37:45,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 19:37:45,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 19:37:45,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:37:45,298 INFO L87 Difference]: Start difference. First operand 532 states and 564 transitions. Second operand 7 states. [2018-02-04 19:37:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:45,581 INFO L93 Difference]: Finished difference Result 542 states and 575 transitions. [2018-02-04 19:37:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 19:37:45,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-02-04 19:37:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:45,583 INFO L225 Difference]: With dead ends: 542 [2018-02-04 19:37:45,583 INFO L226 Difference]: Without dead ends: 542 [2018-02-04 19:37:45,583 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:37:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-02-04 19:37:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 541. [2018-02-04 19:37:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-02-04 19:37:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 575 transitions. [2018-02-04 19:37:45,587 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 575 transitions. Word has length 107 [2018-02-04 19:37:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:45,587 INFO L432 AbstractCegarLoop]: Abstraction has 541 states and 575 transitions. [2018-02-04 19:37:45,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 19:37:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 575 transitions. [2018-02-04 19:37:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 19:37:45,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:45,588 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:45,588 INFO L371 AbstractCegarLoop]: === Iteration 45 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2144112082, now seen corresponding path program 1 times [2018-02-04 19:37:45,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:45,588 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:45,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:45,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:45,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:45,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-02-04 19:37:45,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:37:45,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:37:45,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:37:45,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:37:45,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:37:45,683 INFO L87 Difference]: Start difference. First operand 541 states and 575 transitions. Second operand 10 states. [2018-02-04 19:37:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:46,285 INFO L93 Difference]: Finished difference Result 601 states and 647 transitions. [2018-02-04 19:37:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:37:46,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 107 [2018-02-04 19:37:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:46,287 INFO L225 Difference]: With dead ends: 601 [2018-02-04 19:37:46,287 INFO L226 Difference]: Without dead ends: 601 [2018-02-04 19:37:46,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:37:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-02-04 19:37:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 550. [2018-02-04 19:37:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-02-04 19:37:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 590 transitions. [2018-02-04 19:37:46,291 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 590 transitions. Word has length 107 [2018-02-04 19:37:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:46,291 INFO L432 AbstractCegarLoop]: Abstraction has 550 states and 590 transitions. [2018-02-04 19:37:46,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:37:46,291 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 590 transitions. [2018-02-04 19:37:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 19:37:46,292 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:46,292 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:37:46,292 INFO L371 AbstractCegarLoop]: === Iteration 46 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1800760581, now seen corresponding path program 3 times [2018-02-04 19:37:46,293 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:46,293 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:46,293 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:46,293 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:37:46,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:46,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:46,328 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:46,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:46,328 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:46,329 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 19:37:46,375 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 19:37:46,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:37:46,380 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:46,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:37:46,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:37:46,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:37:46,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:37:46,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:37:46,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2018-02-04 19:37:46,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:46,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:46,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:35 [2018-02-04 19:37:46,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,509 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-02-04 19:37:46,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:55 [2018-02-04 19:37:46,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:37:46,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:46,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:62 [2018-02-04 19:37:46,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-02-04 19:37:46,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-02-04 19:37:46,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:59 [2018-02-04 19:37:46,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,659 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2018-02-04 19:37:46,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:87 [2018-02-04 19:37:46,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-02-04 19:37:46,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:46,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:101, output treesize:114 [2018-02-04 19:37:46,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:46,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:46,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-02-04 19:37:46,841 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:46,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 72 [2018-02-04 19:37:46,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:46,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:46,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:152 [2018-02-04 19:37:47,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:37:47,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-02-04 19:37:47,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:47,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:47,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:47,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:170, output treesize:155 [2018-02-04 19:37:47,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:47,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 96 [2018-02-04 19:37:47,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2018-02-04 19:37:47,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:47,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 18 [2018-02-04 19:37:47,203 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:47,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:47,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:47,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:156, output treesize:58 [2018-02-04 19:37:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:37:47,344 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:37:47,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-04 19:37:47,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 19:37:47,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 19:37:47,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-02-04 19:37:47,345 INFO L87 Difference]: Start difference. First operand 550 states and 590 transitions. Second operand 27 states. [2018-02-04 19:37:48,448 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 124 DAG size of output 101 [2018-02-04 19:37:48,920 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 130 DAG size of output 105 [2018-02-04 19:37:49,837 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 92 DAG size of output 84 [2018-02-04 19:37:50,020 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-02-04 19:37:50,446 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 116 DAG size of output 86 [2018-02-04 19:37:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:51,104 INFO L93 Difference]: Finished difference Result 584 states and 630 transitions. [2018-02-04 19:37:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 19:37:51,104 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 107 [2018-02-04 19:37:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:51,105 INFO L225 Difference]: With dead ends: 584 [2018-02-04 19:37:51,105 INFO L226 Difference]: Without dead ends: 584 [2018-02-04 19:37:51,106 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=626, Invalid=2566, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 19:37:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-02-04 19:37:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 553. [2018-02-04 19:37:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-02-04 19:37:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 594 transitions. [2018-02-04 19:37:51,110 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 594 transitions. Word has length 107 [2018-02-04 19:37:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:51,110 INFO L432 AbstractCegarLoop]: Abstraction has 553 states and 594 transitions. [2018-02-04 19:37:51,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 19:37:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 594 transitions. [2018-02-04 19:37:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-02-04 19:37:51,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:51,111 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:37:51,111 INFO L371 AbstractCegarLoop]: === Iteration 47 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:51,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1800760580, now seen corresponding path program 2 times [2018-02-04 19:37:51,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:51,111 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:51,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:51,111 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:37:51,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:51,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:51,128 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:37:51,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:51,128 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:51,129 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:37:51,176 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:37:51,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:37:51,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:51,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:37:51,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:37:51,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:37:51,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 19:37:51,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,228 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,229 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:37:51,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:28 [2018-02-04 19:37:51,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:37:51,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:37:51,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:41 [2018-02-04 19:37:51,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:51,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:51,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 19:37:51,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:37:51,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:65 [2018-02-04 19:37:51,380 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-02-04 19:37:51,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 49 [2018-02-04 19:37:51,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:83 [2018-02-04 19:37:51,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-02-04 19:37:51,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:51,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-02-04 19:37:51,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:51,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:97 [2018-02-04 19:37:51,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-02-04 19:37:51,565 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:37:51,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2018-02-04 19:37:51,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:37:51,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:135, output treesize:97 [2018-02-04 19:37:51,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 74 [2018-02-04 19:37:51,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,649 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,655 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-02-04 19:37:51,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:111, output treesize:101 [2018-02-04 19:37:51,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 61 [2018-02-04 19:37:51,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:51,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2018-02-04 19:37:51,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:51,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:123, output treesize:137 [2018-02-04 19:37:51,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 104 [2018-02-04 19:37:51,875 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 91 [2018-02-04 19:37:51,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 70 [2018-02-04 19:37:51,923 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:51,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 19:37:51,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:51,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:51,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:163, output treesize:191 [2018-02-04 19:37:52,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:37:52,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 151 [2018-02-04 19:37:52,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:37:52,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:52,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 72 [2018-02-04 19:37:52,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:52,399 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:37:52,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-02-04 19:37:52,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:52,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:52,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-02-04 19:37:52,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 19:37:52,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:52,443 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:37:52,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 19:37:52,443 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:52,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 19:37:52,447 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:52,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:52,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-04 19:37:52,461 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:235, output treesize:61 [2018-02-04 19:37:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:37:52,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:37:52,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-04 19:37:52,618 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 19:37:52,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 19:37:52,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-02-04 19:37:52,618 INFO L87 Difference]: Start difference. First operand 553 states and 594 transitions. Second operand 28 states. [2018-02-04 19:37:53,886 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 128 DAG size of output 107 [2018-02-04 19:37:54,106 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 160 DAG size of output 128 [2018-02-04 19:37:54,286 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 150 DAG size of output 114 [2018-02-04 19:37:54,533 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 161 DAG size of output 123 [2018-02-04 19:37:54,805 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 169 DAG size of output 132 [2018-02-04 19:37:55,118 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 125 DAG size of output 104 [2018-02-04 19:37:55,840 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 111 DAG size of output 101 [2018-02-04 19:37:56,689 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 137 DAG size of output 107 [2018-02-04 19:37:58,320 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 108 DAG size of output 100 [2018-02-04 19:37:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:37:58,389 INFO L93 Difference]: Finished difference Result 634 states and 681 transitions. [2018-02-04 19:37:58,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 19:37:58,389 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 107 [2018-02-04 19:37:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:37:58,391 INFO L225 Difference]: With dead ends: 634 [2018-02-04 19:37:58,391 INFO L226 Difference]: Without dead ends: 634 [2018-02-04 19:37:58,391 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=428, Invalid=2328, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 19:37:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-02-04 19:37:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 584. [2018-02-04 19:37:58,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-02-04 19:37:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 627 transitions. [2018-02-04 19:37:58,397 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 627 transitions. Word has length 107 [2018-02-04 19:37:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:37:58,397 INFO L432 AbstractCegarLoop]: Abstraction has 584 states and 627 transitions. [2018-02-04 19:37:58,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 19:37:58,397 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 627 transitions. [2018-02-04 19:37:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-02-04 19:37:58,398 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:37:58,398 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:37:58,398 INFO L371 AbstractCegarLoop]: === Iteration 48 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:37:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1680665593, now seen corresponding path program 2 times [2018-02-04 19:37:58,398 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:37:58,399 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:37:58,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:58,399 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:37:58,399 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:37:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:37:58,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:37:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:37:58,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:37:58,643 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:37:58,644 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:37:58,668 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:37:58,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:37:58,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:37:58,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:37:58,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:37:58,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-02-04 19:37:58,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-02-04 19:37:58,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 19:37:58,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 19:37:58,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:37:58,845 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:6 [2018-02-04 19:37:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:37:58,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:37:58,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 26 [2018-02-04 19:37:58,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 19:37:58,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 19:37:58,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-02-04 19:37:58,884 INFO L87 Difference]: Start difference. First operand 584 states and 627 transitions. Second operand 26 states. [2018-02-04 19:38:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:38:41,567 INFO L93 Difference]: Finished difference Result 564 states and 600 transitions. [2018-02-04 19:38:41,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 19:38:41,567 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 109 [2018-02-04 19:38:41,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:38:41,568 INFO L225 Difference]: With dead ends: 564 [2018-02-04 19:38:41,568 INFO L226 Difference]: Without dead ends: 528 [2018-02-04 19:38:41,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 101 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 19:38:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-02-04 19:38:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 514. [2018-02-04 19:38:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2018-02-04 19:38:41,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 555 transitions. [2018-02-04 19:38:41,572 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 555 transitions. Word has length 109 [2018-02-04 19:38:41,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:38:41,572 INFO L432 AbstractCegarLoop]: Abstraction has 514 states and 555 transitions. [2018-02-04 19:38:41,572 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 19:38:41,572 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 555 transitions. [2018-02-04 19:38:41,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 19:38:41,573 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:38:41,573 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:38:41,573 INFO L371 AbstractCegarLoop]: === Iteration 49 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:38:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 289782419, now seen corresponding path program 1 times [2018-02-04 19:38:41,573 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:38:41,573 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:38:41,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:41,574 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 19:38:41,574 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:41,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:38:41,639 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-02-04 19:38:41,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:38:41,639 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:38:41,640 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:41,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:38:41,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-02-04 19:38:41,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-02-04 19:38:41,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-02-04 19:38:41,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-02-04 19:38:41,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-02-04 19:38:41,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:38:41,795 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,795 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 19:38:41,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-02-04 19:38:41,800 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,802 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:41,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:38:41,804 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:61, output treesize:12 [2018-02-04 19:38:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:38:41,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:38:41,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 22 [2018-02-04 19:38:41,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 19:38:41,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 19:38:41,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-04 19:38:41,831 INFO L87 Difference]: Start difference. First operand 514 states and 555 transitions. Second operand 22 states. [2018-02-04 19:38:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:38:42,480 INFO L93 Difference]: Finished difference Result 477 states and 508 transitions. [2018-02-04 19:38:42,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 19:38:42,480 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 110 [2018-02-04 19:38:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:38:42,482 INFO L225 Difference]: With dead ends: 477 [2018-02-04 19:38:42,482 INFO L226 Difference]: Without dead ends: 477 [2018-02-04 19:38:42,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 19:38:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-02-04 19:38:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 470. [2018-02-04 19:38:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-02-04 19:38:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 501 transitions. [2018-02-04 19:38:42,486 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 501 transitions. Word has length 110 [2018-02-04 19:38:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:38:42,486 INFO L432 AbstractCegarLoop]: Abstraction has 470 states and 501 transitions. [2018-02-04 19:38:42,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 19:38:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 501 transitions. [2018-02-04 19:38:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-02-04 19:38:42,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:38:42,487 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:38:42,487 INFO L371 AbstractCegarLoop]: === Iteration 50 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:38:42,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1347778353, now seen corresponding path program 1 times [2018-02-04 19:38:42,487 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:38:42,487 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:38:42,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:42,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:42,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:42,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:38:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-04 19:38:42,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:38:42,611 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:38:42,612 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:42,628 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:38:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-04 19:38:42,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:38:42,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 28 [2018-02-04 19:38:42,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 19:38:42,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 19:38:42,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=693, Unknown=0, NotChecked=0, Total=756 [2018-02-04 19:38:42,878 INFO L87 Difference]: Start difference. First operand 470 states and 501 transitions. Second operand 28 states. [2018-02-04 19:38:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:38:45,173 INFO L93 Difference]: Finished difference Result 496 states and 522 transitions. [2018-02-04 19:38:45,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-04 19:38:45,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2018-02-04 19:38:45,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:38:45,175 INFO L225 Difference]: With dead ends: 496 [2018-02-04 19:38:45,175 INFO L226 Difference]: Without dead ends: 491 [2018-02-04 19:38:45,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=359, Invalid=3181, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 19:38:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-02-04 19:38:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 456. [2018-02-04 19:38:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-02-04 19:38:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 480 transitions. [2018-02-04 19:38:45,179 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 480 transitions. Word has length 113 [2018-02-04 19:38:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:38:45,179 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 480 transitions. [2018-02-04 19:38:45,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 19:38:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 480 transitions. [2018-02-04 19:38:45,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 19:38:45,180 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:38:45,180 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:38:45,180 INFO L371 AbstractCegarLoop]: === Iteration 51 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:38:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash 62678655, now seen corresponding path program 1 times [2018-02-04 19:38:45,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:38:45,181 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:38:45,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:45,181 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:45,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:45,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:38:45,196 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:38:45,196 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:38:45,197 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:38:45,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:45,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:38:45,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:38:45,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:38:45,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,227 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 19:38:45,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:45,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:38:45,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:38:45,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:45,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-02-04 19:38:45,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:38:45,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:45,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2018-02-04 19:38:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:38:45,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:38:45,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:38:45,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:38:45,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:38:45,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:38:45,285 INFO L87 Difference]: Start difference. First operand 456 states and 480 transitions. Second operand 4 states. [2018-02-04 19:38:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:38:45,355 INFO L93 Difference]: Finished difference Result 452 states and 476 transitions. [2018-02-04 19:38:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:38:45,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-02-04 19:38:45,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:38:45,357 INFO L225 Difference]: With dead ends: 452 [2018-02-04 19:38:45,357 INFO L226 Difference]: Without dead ends: 452 [2018-02-04 19:38:45,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:38:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-02-04 19:38:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2018-02-04 19:38:45,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-02-04 19:38:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 476 transitions. [2018-02-04 19:38:45,362 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 476 transitions. Word has length 116 [2018-02-04 19:38:45,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:38:45,362 INFO L432 AbstractCegarLoop]: Abstraction has 452 states and 476 transitions. [2018-02-04 19:38:45,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:38:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 476 transitions. [2018-02-04 19:38:45,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-02-04 19:38:45,363 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:38:45,363 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 19:38:45,363 INFO L371 AbstractCegarLoop]: === Iteration 52 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:38:45,364 INFO L82 PathProgramCache]: Analyzing trace with hash 62678656, now seen corresponding path program 1 times [2018-02-04 19:38:45,364 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:38:45,364 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:38:45,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:45,364 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:45,364 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:45,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:38:45,388 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:38:45,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:38:45,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:38:45,389 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:45,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:38:45,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:38:45,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:38:45,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:38:45,456 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 19:38:45,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 19:38:45,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:45,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 19:38:45,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:38:45,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:45,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-02-04 19:38:45,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-02-04 19:38:45,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:45,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:23 [2018-02-04 19:38:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-02-04 19:38:45,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:38:45,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 19:38:45,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:38:45,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:38:45,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:38:45,547 INFO L87 Difference]: Start difference. First operand 452 states and 476 transitions. Second operand 4 states. [2018-02-04 19:38:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:38:45,739 INFO L93 Difference]: Finished difference Result 448 states and 472 transitions. [2018-02-04 19:38:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:38:45,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-02-04 19:38:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:38:45,740 INFO L225 Difference]: With dead ends: 448 [2018-02-04 19:38:45,740 INFO L226 Difference]: Without dead ends: 448 [2018-02-04 19:38:45,741 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:38:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-02-04 19:38:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2018-02-04 19:38:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-02-04 19:38:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 472 transitions. [2018-02-04 19:38:45,744 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 472 transitions. Word has length 116 [2018-02-04 19:38:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:38:45,744 INFO L432 AbstractCegarLoop]: Abstraction has 448 states and 472 transitions. [2018-02-04 19:38:45,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:38:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 472 transitions. [2018-02-04 19:38:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-02-04 19:38:45,744 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:38:45,745 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:38:45,745 INFO L371 AbstractCegarLoop]: === Iteration 53 === [merge_pairErr19RequiresViolation, merge_pairErr24RequiresViolation, merge_pairErr4RequiresViolation, merge_pairErr11RequiresViolation, merge_pairErr16RequiresViolation, merge_pairErr7RequiresViolation, merge_pairErr9RequiresViolation, merge_pairErr2RequiresViolation, merge_pairErr14RequiresViolation, merge_pairErr29RequiresViolation, merge_pairErr17RequiresViolation, merge_pairErr6RequiresViolation, merge_pairErr27RequiresViolation, merge_pairErr26RequiresViolation, merge_pairErr3RequiresViolation, merge_pairErr13RequiresViolation, merge_pairErr23RequiresViolation, merge_pairErr15RequiresViolation, merge_pairErr0RequiresViolation, merge_pairErr10RequiresViolation, merge_pairErr25RequiresViolation, merge_pairErr20RequiresViolation, merge_pairErr22RequiresViolation, merge_pairErr12RequiresViolation, merge_pairErr5RequiresViolation, merge_pairErr18RequiresViolation, merge_pairErr21RequiresViolation, merge_pairErr1RequiresViolation, merge_pairErr28RequiresViolation, merge_pairErr8RequiresViolation, merge_single_nodeErr4RequiresViolation, merge_single_nodeErr0RequiresViolation, merge_single_nodeErr9RequiresViolation, merge_single_nodeErr7RequiresViolation, merge_single_nodeErr11RequiresViolation, merge_single_nodeErr2RequiresViolation, merge_single_nodeErr1RequiresViolation, merge_single_nodeErr13RequiresViolation, merge_single_nodeErr6RequiresViolation, merge_single_nodeErr5RequiresViolation, merge_single_nodeErr10RequiresViolation, merge_single_nodeErr3RequiresViolation, merge_single_nodeErr12RequiresViolation, merge_single_nodeErr8RequiresViolation, seq_sort_coreErr13RequiresViolation, seq_sort_coreErr7RequiresViolation, seq_sort_coreErr6RequiresViolation, seq_sort_coreErr10RequiresViolation, seq_sort_coreErr1RequiresViolation, seq_sort_coreErr3RequiresViolation, seq_sort_coreErr8RequiresViolation, seq_sort_coreErr12RequiresViolation, seq_sort_coreErr11RequiresViolation, seq_sort_coreErr0RequiresViolation, seq_sort_coreErr4RequiresViolation, seq_sort_coreErr5RequiresViolation, seq_sort_coreErr2RequiresViolation, seq_sort_coreErr9RequiresViolation, inspect_beforeErr15RequiresViolation, inspect_beforeErr7RequiresViolation, inspect_beforeErr11RequiresViolation, inspect_beforeErr3RequiresViolation, inspect_beforeErr2RequiresViolation, inspect_beforeErr10RequiresViolation, inspect_beforeErr16RequiresViolation, inspect_beforeErr1RequiresViolation, inspect_beforeErr6RequiresViolation, inspect_beforeErr18RequiresViolation, inspect_beforeErr13RequiresViolation, inspect_beforeErr0RequiresViolation, inspect_beforeErr9RequiresViolation, inspect_beforeErr4RequiresViolation, inspect_beforeErr17RequiresViolation, inspect_beforeErr8RequiresViolation, inspect_beforeErr12RequiresViolation, inspect_beforeErr14RequiresViolation, inspect_beforeErr5RequiresViolation, inspect_beforeErr19RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, inspect_afterErr8RequiresViolation, inspect_afterErr10RequiresViolation, inspect_afterErr1RequiresViolation, inspect_afterErr0RequiresViolation, inspect_afterErr6RequiresViolation, inspect_afterErr7RequiresViolation, inspect_afterErr11RequiresViolation, inspect_afterErr5RequiresViolation, inspect_afterErr2RequiresViolation, inspect_afterErr4RequiresViolation, inspect_afterErr3RequiresViolation, inspect_afterErr9RequiresViolation]=== [2018-02-04 19:38:45,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1410838114, now seen corresponding path program 2 times [2018-02-04 19:38:45,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:38:45,745 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:38:45,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:45,745 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:38:45,745 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:38:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:38:45,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:38:45,768 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:38:45,768 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:38:45,768 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:38:45,768 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 19:38:45,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 19:38:45,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 19:38:45,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:38:45,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:38:45,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 19:38:45,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:38:45,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-02-04 19:38:45,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 19:38:45,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:45,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:26 [2018-02-04 19:38:45,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-02-04 19:38:45,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-02-04 19:38:45,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-02-04 19:38:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:45,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-02-04 19:38:45,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:45,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:43 [2018-02-04 19:38:46,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-02-04 19:38:46,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:46,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2018-02-04 19:38:46,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-02-04 19:38:46,082 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:46,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:46,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-02-04 19:38:46,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 45 [2018-02-04 19:38:46,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:46,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:58 [2018-02-04 19:38:46,216 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 78 [2018-02-04 19:38:46,242 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 19:38:46,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2018-02-04 19:38:46,354 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:46,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-02-04 19:38:46,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-02-04 19:38:46,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:46,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 19:38:46,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-04 19:38:46,525 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:72, output treesize:264 [2018-02-04 19:38:46,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,667 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 88 [2018-02-04 19:38:46,670 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,678 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-02-04 19:38:46,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:46,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-02-04 19:38:46,759 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-02-04 19:38:46,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:46,823 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,826 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 125 [2018-02-04 19:38:46,838 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,845 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 140 [2018-02-04 19:38:46,845 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:46,909 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:46,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:46,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 99 [2018-02-04 19:38:46,961 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:47,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 19:38:47,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2018-02-04 19:38:47,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:38:47,070 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,077 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 73 [2018-02-04 19:38:47,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:38:47,081 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,089 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 90 [2018-02-04 19:38:47,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 19:38:47,092 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,101 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:47,135 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:250, output treesize:274 [2018-02-04 19:38:47,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 153 [2018-02-04 19:38:47,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,304 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 116 [2018-02-04 19:38:47,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,362 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 95 [2018-02-04 19:38:47,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:47,415 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:277, output treesize:331 [2018-02-04 19:38:47,580 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,581 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 128 [2018-02-04 19:38:47,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:47,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,736 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,740 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:47,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 168 [2018-02-04 19:38:47,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:47,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 154 [2018-02-04 19:38:47,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:47,872 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 108 [2018-02-04 19:38:47,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:47,975 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:47,992 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 107 [2018-02-04 19:38:48,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:48,066 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,081 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 117 [2018-02-04 19:38:48,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:48,149 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,163 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:48,223 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:397, output treesize:373 [2018-02-04 19:38:48,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 139 [2018-02-04 19:38:48,335 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:48,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,481 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 156 [2018-02-04 19:38:48,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:48,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,510 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 130 [2018-02-04 19:38:48,614 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:48,615 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,634 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 117 [2018-02-04 19:38:48,724 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:48,725 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,741 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 196 [2018-02-04 19:38:48,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:48,832 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,857 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 167 [2018-02-04 19:38:48,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:48,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-02-04 19:38:48,929 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:48,946 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:49,003 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:487, output treesize:373 [2018-02-04 19:38:49,007 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,008 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,009 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 174 [2018-02-04 19:38:49,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,103 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 137 [2018-02-04 19:38:49,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,195 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,196 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,197 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,198 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:49,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 211 [2018-02-04 19:38:49,200 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:49,290 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:415, output treesize:481 [2018-02-04 19:38:49,438 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 95 [2018-02-04 19:38:49,581 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 95 [2018-02-04 19:38:49,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 153 [2018-02-04 19:38:49,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:49,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 150 [2018-02-04 19:38:49,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:49,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 171 [2018-02-04 19:38:49,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:49,938 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:49,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,078 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,080 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 170 [2018-02-04 19:38:50,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:50,086 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 216 [2018-02-04 19:38:50,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:50,229 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,262 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 218 [2018-02-04 19:38:50,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 19:38:50,377 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,411 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:50,509 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:547, output treesize:593 [2018-02-04 19:38:50,646 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 97 [2018-02-04 19:38:50,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,654 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 207 [2018-02-04 19:38:50,664 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 99 [2018-02-04 19:38:50,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 182 [2018-02-04 19:38:50,913 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:50,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 91 [2018-02-04 19:38:50,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:50,946 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 188 [2018-02-04 19:38:51,111 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:51,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 19:38:51,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 213 [2018-02-04 19:38:51,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:51,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 19:38:51,295 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,323 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,454 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:51,460 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:51,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 263 treesize of output 257 [2018-02-04 19:38:51,472 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:51,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 111 [2018-02-04 19:38:51,472 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,513 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 262 [2018-02-04 19:38:51,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:51,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-02-04 19:38:51,631 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,663 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:38:51,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:51,765 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:671, output treesize:911 [2018-02-04 19:38:51,919 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 19:38:52,079 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 19:38:52,251 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 19:38:52,443 WARN L143 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 19:38:52,776 WARN L146 SmtUtils]: Spent 256ms on a formula simplification. DAG size of input: 99 DAG size of output 95 [2018-02-04 19:38:53,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:53,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 294 [2018-02-04 19:38:53,732 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:53,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:38:53,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:53,778 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:53,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 19:38:53,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:53,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:38:53,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:53,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:53,990 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:53,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 384 treesize of output 386 [2018-02-04 19:38:53,995 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:53,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2018-02-04 19:38:53,997 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:54,034 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:54,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:38:54,035 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:54,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:38:54,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:54,092 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:54,190 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 305 [2018-02-04 19:38:54,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-02-04 19:38:54,195 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:54,234 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:54,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-04 19:38:54,234 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:54,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-02-04 19:38:54,262 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:54,285 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:54,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2018-02-04 19:38:54,374 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:988, output treesize:787 [2018-02-04 19:38:54,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,950 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:54,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 324 treesize of output 212 [2018-02-04 19:38:54,982 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 214 [2018-02-04 19:38:54,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 15 xjuncts. [2018-02-04 19:38:55,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 155 [2018-02-04 19:38:55,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 169 [2018-02-04 19:38:55,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 169 [2018-02-04 19:38:55,922 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 171 [2018-02-04 19:38:55,924 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 169 [2018-02-04 19:38:55,926 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 167 [2018-02-04 19:38:55,928 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 171 [2018-02-04 19:38:55,930 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 155 [2018-02-04 19:38:55,932 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 167 [2018-02-04 19:38:55,933 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 171 [2018-02-04 19:38:55,935 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 153 [2018-02-04 19:38:55,937 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 153 [2018-02-04 19:38:55,939 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 163 [2018-02-04 19:38:55,941 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 169 [2018-02-04 19:38:55,942 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:55,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 143 [2018-02-04 19:38:55,944 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,751 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 165 [2018-02-04 19:38:56,756 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:56,757 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 141 [2018-02-04 19:38:56,758 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,760 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 159 [2018-02-04 19:38:56,762 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,764 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 161 [2018-02-04 19:38:56,768 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,770 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 143 [2018-02-04 19:38:56,771 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,773 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 163 [2018-02-04 19:38:56,777 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:56,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,779 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 159 [2018-02-04 19:38:56,781 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,783 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 165 [2018-02-04 19:38:56,788 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:56,791 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 161 [2018-02-04 19:38:56,795 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:56,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,798 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 153 [2018-02-04 19:38:56,799 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,801 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 157 [2018-02-04 19:38:56,803 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,805 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 159 [2018-02-04 19:38:56,807 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,811 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 131 [2018-02-04 19:38:56,811 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,821 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,822 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:56,822 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2018-02-04 19:38:56,829 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:56,832 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:38:56,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 149 [2018-02-04 19:38:56,837 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-02-04 19:38:57,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 145 [2018-02-04 19:38:57,862 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 141 [2018-02-04 19:38:57,864 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 137 [2018-02-04 19:38:57,866 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 127 [2018-02-04 19:38:57,867 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 145 [2018-02-04 19:38:57,869 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 143 [2018-02-04 19:38:57,871 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 143 [2018-02-04 19:38:57,873 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 133 [2018-02-04 19:38:57,875 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 129 [2018-02-04 19:38:57,876 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 145 [2018-02-04 19:38:57,878 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 143 [2018-02-04 19:38:57,880 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 135 [2018-02-04 19:38:57,881 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 143 [2018-02-04 19:38:57,883 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 141 [2018-02-04 19:38:57,885 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:57,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 123 [2018-02-04 19:38:57,886 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-04 19:38:58,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 148 [2018-02-04 19:38:58,589 INFO L267 ElimStorePlain]: Start of recursive call 49: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:59,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 129 [2018-02-04 19:38:59,279 INFO L267 ElimStorePlain]: Start of recursive call 50: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2018-02-04 19:38:59,281 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:59,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 125 [2018-02-04 19:38:59,286 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:59,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 103 [2018-02-04 19:38:59,288 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:59,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 127 [2018-02-04 19:38:59,292 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:59,294 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 123 [2018-02-04 19:38:59,298 INFO L267 ElimStorePlain]: Start of recursive call 55: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 99 [2018-02-04 19:38:59,300 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:38:59,302 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 129 [2018-02-04 19:38:59,307 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,309 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 127 [2018-02-04 19:38:59,315 INFO L267 ElimStorePlain]: Start of recursive call 58: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,317 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 121 [2018-02-04 19:38:59,322 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,325 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 129 [2018-02-04 19:38:59,330 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 131 [2018-02-04 19:38:59,337 INFO L267 ElimStorePlain]: Start of recursive call 61: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,340 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 127 [2018-02-04 19:38:59,344 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,346 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 131 [2018-02-04 19:38:59,352 INFO L267 ElimStorePlain]: Start of recursive call 63: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:38:59,354 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:38:59,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 119 [2018-02-04 19:38:59,358 INFO L267 ElimStorePlain]: Start of recursive call 64: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:01,057 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:01,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 130 [2018-02-04 19:39:01,058 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:02,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 116 [2018-02-04 19:39:03,000 INFO L267 ElimStorePlain]: Start of recursive call 66: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-02-04 19:39:04,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2018-02-04 19:39:04,793 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:04,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 99 [2018-02-04 19:39:04,795 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:04,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 99 [2018-02-04 19:39:04,797 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:06,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 9 dim-1 vars, End of recursive call: 110 dim-0 vars, and 28 xjuncts. [2018-02-04 19:39:08,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,205 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,206 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,209 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 251 treesize of output 176 [2018-02-04 19:39:08,230 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 123 [2018-02-04 19:39:08,237 INFO L267 ElimStorePlain]: Start of recursive call 71: 39 dim-0 vars, End of recursive call: 39 dim-0 vars, and 15 xjuncts. [2018-02-04 19:39:08,540 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-02-04 19:39:08,541 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,542 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,543 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,543 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2018-02-04 19:39:08,545 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,547 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 105 [2018-02-04 19:39:08,552 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-02-04 19:39:08,554 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 101 [2018-02-04 19:39:08,558 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-02-04 19:39:08,559 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 71 [2018-02-04 19:39:08,560 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,561 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,562 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2018-02-04 19:39:08,563 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,565 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2018-02-04 19:39:08,565 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,567 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,567 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-02-04 19:39:08,569 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,572 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 105 [2018-02-04 19:39:08,576 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-02-04 19:39:08,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,578 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,578 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-02-04 19:39:08,580 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,582 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,582 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2018-02-04 19:39:08,584 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,586 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,587 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 105 [2018-02-04 19:39:08,589 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:08,592 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 101 [2018-02-04 19:39:08,596 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2018-02-04 19:39:08,599 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 89 [2018-02-04 19:39:08,603 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-02-04 19:39:08,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,605 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:08,606 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:08,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 101 [2018-02-04 19:39:08,607 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:09,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 87 [2018-02-04 19:39:09,056 INFO L267 ElimStorePlain]: Start of recursive call 87: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2018-02-04 19:39:09,058 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:09,060 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 93 [2018-02-04 19:39:09,065 INFO L267 ElimStorePlain]: Start of recursive call 89: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,067 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 93 [2018-02-04 19:39:09,072 INFO L267 ElimStorePlain]: Start of recursive call 90: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 91 [2018-02-04 19:39:09,079 INFO L267 ElimStorePlain]: Start of recursive call 91: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,081 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 83 [2018-02-04 19:39:09,082 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:09,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 77 [2018-02-04 19:39:09,088 INFO L267 ElimStorePlain]: Start of recursive call 93: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,089 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 89 [2018-02-04 19:39:09,092 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:09,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 87 [2018-02-04 19:39:09,097 INFO L267 ElimStorePlain]: Start of recursive call 95: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 89 [2018-02-04 19:39:09,106 INFO L267 ElimStorePlain]: Start of recursive call 96: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 65 [2018-02-04 19:39:09,108 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:09,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:09,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 83 [2018-02-04 19:39:09,114 INFO L267 ElimStorePlain]: Start of recursive call 98: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 81 [2018-02-04 19:39:09,120 INFO L267 ElimStorePlain]: Start of recursive call 99: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 85 [2018-02-04 19:39:09,125 INFO L267 ElimStorePlain]: Start of recursive call 100: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:09,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2018-02-04 19:39:09,127 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:10,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:39:10,048 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:10,907 INFO L267 ElimStorePlain]: Start of recursive call 70: 4 dim-1 vars, End of recursive call: 75 dim-0 vars, and 25 xjuncts. [2018-02-04 19:39:14,420 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:14,421 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:14,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 177 [2018-02-04 19:39:14,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:14,428 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 19:39:14,429 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:39:14,434 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 71 [2018-02-04 19:39:14,434 INFO L267 ElimStorePlain]: Start of recursive call 104: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 19:39:14,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:39:14,468 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:14,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 45 [2018-02-04 19:39:14,489 INFO L267 ElimStorePlain]: Start of recursive call 106: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:14,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-02-04 19:39:14,508 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-02-04 19:39:14,524 INFO L267 ElimStorePlain]: Start of recursive call 103: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 19:39:18,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-2 vars, End of recursive call: 242 dim-0 vars, and 54 xjuncts. [2018-02-04 19:39:18,213 INFO L202 ElimStorePlain]: Needed 107 recursive calls to eliminate 18 variables, input treesize:808, output treesize:4141 [2018-02-04 19:39:23,649 WARN L146 SmtUtils]: Spent 4772ms on a formula simplification. DAG size of input: 2193 DAG size of output 51 Received shutdown request... [2018-02-04 19:39:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 23 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:39:23,960 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:39:23,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-02-04 19:39:23,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 19:39:23,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 19:39:23,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 19:39:23,960 INFO L87 Difference]: Start difference. First operand 448 states and 472 transitions. Second operand 36 states. [2018-02-04 19:39:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 19:39:23,961 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 19:39:23,967 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 19:39:23,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:39:23 BoogieIcfgContainer [2018-02-04 19:39:23,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:39:23,969 INFO L168 Benchmark]: Toolchain (without parser) took 188117.53 ms. Allocated memory was 388.5 MB in the beginning and 818.9 MB in the end (delta: 430.4 MB). Free memory was 345.2 MB in the beginning and 396.7 MB in the end (delta: -51.5 MB). Peak memory consumption was 378.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:23,970 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 388.5 MB. Free memory is still 350.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:39:23,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.90 ms. Allocated memory is still 388.5 MB. Free memory was 345.2 MB in the beginning and 332.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:23,971 INFO L168 Benchmark]: Boogie Preprocessor took 35.83 ms. Allocated memory is still 388.5 MB. Free memory was 332.0 MB in the beginning and 329.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:23,971 INFO L168 Benchmark]: RCFGBuilder took 550.94 ms. Allocated memory is still 388.5 MB. Free memory was 329.3 MB in the beginning and 258.5 MB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:23,971 INFO L168 Benchmark]: TraceAbstraction took 187345.00 ms. Allocated memory was 388.5 MB in the beginning and 818.9 MB in the end (delta: 430.4 MB). Free memory was 258.5 MB in the beginning and 396.7 MB in the end (delta: -138.2 MB). Peak memory consumption was 292.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:39:23,972 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.09 ms. Allocated memory is still 388.5 MB. Free memory is still 350.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 182.90 ms. Allocated memory is still 388.5 MB. Free memory was 345.2 MB in the beginning and 332.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.83 ms. Allocated memory is still 388.5 MB. Free memory was 332.0 MB in the beginning and 329.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 550.94 ms. Allocated memory is still 388.5 MB. Free memory was 329.3 MB in the beginning and 258.5 MB in the end (delta: 70.8 MB). Peak memory consumption was 70.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 187345.00 ms. Allocated memory was 388.5 MB in the beginning and 818.9 MB in the end (delta: 430.4 MB). Free memory was 258.5 MB in the beginning and 396.7 MB in the end (delta: -138.2 MB). Peak memory consumption was 292.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 568). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 598). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 597). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 588). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 607). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 605). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 612). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 613). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 608). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 625]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 651). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 623). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (448states) and interpolant automaton (currently 2 states, 36 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 315 locations, 109 error locations. TIMEOUT Result, 187.3s OverallTime, 53 OverallIterations, 4 TraceHistogramMax, 130.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14239 SDtfs, 12518 SDslu, 81363 SDs, 0 SdLazy, 51728 SolverSat, 1921 SolverUnsat, 161 SolverUnknown, 0 SolverNotchecked, 110.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3501 GetRequests, 2410 SyntacticMatches, 52 SemanticMatches, 1039 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6769 ImplicationChecksByTransitivity, 33.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=584occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 1359 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 6775 NumberOfCodeBlocks, 6775 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 4384 ConstructedInterpolants, 1053 QuantifiedInterpolants, 16301033 SizeOfPredicates, 544 NumberOfNonLiveVariables, 10261 ConjunctsInSsa, 1416 ConjunctsInUnsatCore, 58 InterpolantComputations, 35 PerfectInterpolantSequences, 739/1055 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-39-23-980.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-39-23-980.csv Completed graceful shutdown