java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:48:09,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:48:09,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:48:09,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:48:09,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:48:09,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:48:09,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:48:09,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:48:09,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:48:09,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:48:09,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:48:09,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:48:09,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:48:09,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:48:09,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:48:09,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:48:09,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:48:09,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:48:09,756 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:48:09,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:48:09,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:48:09,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:48:09,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:48:09,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:48:09,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:48:09,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:48:09,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:48:09,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:48:09,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:48:09,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:48:09,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:48:09,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:48:09,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:48:09,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:48:09,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:48:09,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:48:09,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:48:09,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:48:09,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:48:09,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:48:09,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:48:09,776 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:48:09,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:48:09,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:48:09,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:48:09,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:48:09,792 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:48:09,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:48:09,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:48:09,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:48:09,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:48:09,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:48:09,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:48:09,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:48:09,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:48:09,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:48:09,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:48:09,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:48:09,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:48:09,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:48:09,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:48:09,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:48:09,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:48:09,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:48:09,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:48:09,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:48:09,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:48:09,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:48:09,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:48:09,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:48:09,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:48:09,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:48:09,838 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:48:09,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:48:09,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:48:09,844 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:48:09,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2019-10-02 10:48:09,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a721a3c/82ca107c9fb64978ad0b7e646f0c328f/FLAG11addd2ed [2019-10-02 10:48:10,437 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:48:10,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2019-10-02 10:48:10,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a721a3c/82ca107c9fb64978ad0b7e646f0c328f/FLAG11addd2ed [2019-10-02 10:48:10,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a721a3c/82ca107c9fb64978ad0b7e646f0c328f [2019-10-02 10:48:10,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:48:10,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:48:10,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:48:10,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:48:10,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:48:10,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:48:10" (1/1) ... [2019-10-02 10:48:10,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af4353f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:10, skipping insertion in model container [2019-10-02 10:48:10,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:48:10" (1/1) ... [2019-10-02 10:48:10,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:48:10,809 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:48:11,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:48:11,265 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:48:11,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:48:11,357 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:48:11,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11 WrapperNode [2019-10-02 10:48:11,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:48:11,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:48:11,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:48:11,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:48:11,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... [2019-10-02 10:48:11,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:48:11,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:48:11,430 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:48:11,430 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:48:11,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-02 10:48:11,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:48:11,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:48:11,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 10:48:11,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 10:48:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-02 10:48:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-02 10:48:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-02 10:48:11,495 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-02 10:48:11,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:48:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:48:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:48:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 10:48:11,496 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 10:48:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 10:48:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 10:48:11,497 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 10:48:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 10:48:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 10:48:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 10:48:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 10:48:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 10:48:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 10:48:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 10:48:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-02 10:48:11,500 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 10:48:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 10:48:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 10:48:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 10:48:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 10:48:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 10:48:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 10:48:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 10:48:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 10:48:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 10:48:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 10:48:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 10:48:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 10:48:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 10:48:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 10:48:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 10:48:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 10:48:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 10:48:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 10:48:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 10:48:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 10:48:11,506 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 10:48:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 10:48:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 10:48:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 10:48:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 10:48:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 10:48:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 10:48:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 10:48:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 10:48:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 10:48:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 10:48:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 10:48:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 10:48:11,509 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 10:48:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 10:48:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 10:48:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 10:48:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 10:48:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 10:48:11,510 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 10:48:11,511 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 10:48:11,512 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 10:48:11,513 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 10:48:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 10:48:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-02 10:48:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:48:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 10:48:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:48:11,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:48:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:48:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:48:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:48:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:48:11,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:48:11,914 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-02 10:48:12,122 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:48:12,123 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 10:48:12,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:48:12 BoogieIcfgContainer [2019-10-02 10:48:12,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:48:12,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:48:12,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:48:12,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:48:12,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:48:10" (1/3) ... [2019-10-02 10:48:12,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642af071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:48:12, skipping insertion in model container [2019-10-02 10:48:12,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:48:11" (2/3) ... [2019-10-02 10:48:12,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@642af071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:48:12, skipping insertion in model container [2019-10-02 10:48:12,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:48:12" (3/3) ... [2019-10-02 10:48:12,132 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-2.i [2019-10-02 10:48:12,142 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:48:12,151 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:48:12,165 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:48:12,189 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:48:12,190 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:48:12,190 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:48:12,191 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:48:12,191 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:48:12,191 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:48:12,191 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:48:12,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:48:12,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:48:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-02 10:48:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 10:48:12,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:12,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:12,217 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash 661731879, now seen corresponding path program 1 times [2019-10-02 10:48:12,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:12,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:12,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:12,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:48:12,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:48:12,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:48:12,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:48:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:48:12,400 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-10-02 10:48:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:12,427 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-10-02 10:48:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:48:12,428 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-02 10:48:12,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:12,437 INFO L225 Difference]: With dead ends: 54 [2019-10-02 10:48:12,437 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 10:48:12,441 INFO L640 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 [2019-10-02 10:48:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 10:48:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 10:48:12,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 10:48:12,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-10-02 10:48:12,484 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2019-10-02 10:48:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:12,485 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-02 10:48:12,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:48:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-10-02 10:48:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 10:48:12,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:12,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:12,487 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:12,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:12,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1973627133, now seen corresponding path program 1 times [2019-10-02 10:48:12,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:12,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:12,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:12,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:12,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:48:12,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:48:12,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:48:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:48:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:48:12,655 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-10-02 10:48:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:12,796 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-02 10:48:12,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:48:12,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-02 10:48:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:12,798 INFO L225 Difference]: With dead ends: 44 [2019-10-02 10:48:12,798 INFO L226 Difference]: Without dead ends: 37 [2019-10-02 10:48:12,799 INFO L640 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 [2019-10-02 10:48:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-02 10:48:12,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-10-02 10:48:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 10:48:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-10-02 10:48:12,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-10-02 10:48:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:12,808 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-02 10:48:12,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:48:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-10-02 10:48:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 10:48:12,809 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:12,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:12,809 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:12,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:12,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1721544590, now seen corresponding path program 1 times [2019-10-02 10:48:12,810 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:12,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:12,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:12,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:12,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:48:12,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 10:48:12,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 10:48:12,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 10:48:12,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 10:48:12,891 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2019-10-02 10:48:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:12,959 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-02 10:48:12,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 10:48:12,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-02 10:48:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:12,963 INFO L225 Difference]: With dead ends: 51 [2019-10-02 10:48:12,963 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 10:48:12,964 INFO L640 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 [2019-10-02 10:48:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 10:48:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-10-02 10:48:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-02 10:48:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-10-02 10:48:12,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2019-10-02 10:48:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:12,973 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-10-02 10:48:12,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 10:48:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-10-02 10:48:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-02 10:48:12,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:12,975 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:12,975 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash -918584693, now seen corresponding path program 1 times [2019-10-02 10:48:12,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:12,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:13,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:48:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 10:48:13,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 10:48:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 10:48:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 10:48:13,084 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 6 states. [2019-10-02 10:48:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:13,234 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-10-02 10:48:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:48:13,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-02 10:48:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:13,236 INFO L225 Difference]: With dead ends: 74 [2019-10-02 10:48:13,236 INFO L226 Difference]: Without dead ends: 47 [2019-10-02 10:48:13,237 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:48:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-02 10:48:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-02 10:48:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-02 10:48:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-02 10:48:13,244 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2019-10-02 10:48:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:13,244 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-02 10:48:13,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 10:48:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-02 10:48:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 10:48:13,245 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:13,245 INFO L411 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] [2019-10-02 10:48:13,246 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash -743556192, now seen corresponding path program 1 times [2019-10-02 10:48:13,246 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:13,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:13,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:13,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:13,559 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:13,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:13,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-02 10:48:13,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:13,768 INFO L375 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 [2019-10-02 10:48:13,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:13,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:48:13,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:48:13,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:13,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 10:48:13,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:13,919 INFO L375 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 11 treesize of output 15 [2019-10-02 10:48:13,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:13,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-10-02 10:48:13,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:13,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 10:48:13,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:13,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:13,977 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-02 10:48:14,047 INFO L375 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 19 treesize of output 18 [2019-10-02 10:48:14,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:14,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:14,059 INFO L496 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. [2019-10-02 10:48:14,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-10-02 10:48:14,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:14,186 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-02 10:48:14,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:14,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:14,199 INFO L496 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. [2019-10-02 10:48:14,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2019-10-02 10:48:14,251 INFO L375 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 22 treesize of output 10 [2019-10-02 10:48:14,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:14,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:14,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:14,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-02 10:48:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:48:14,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:14,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-10-02 10:48:14,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 10:48:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 10:48:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-02 10:48:14,276 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 21 states. [2019-10-02 10:48:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:15,399 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2019-10-02 10:48:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 10:48:15,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-10-02 10:48:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:15,410 INFO L225 Difference]: With dead ends: 129 [2019-10-02 10:48:15,410 INFO L226 Difference]: Without dead ends: 96 [2019-10-02 10:48:15,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 10:48:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-02 10:48:15,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2019-10-02 10:48:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-02 10:48:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-10-02 10:48:15,422 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-10-02 10:48:15,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:15,422 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-10-02 10:48:15,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 10:48:15,422 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-10-02 10:48:15,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 10:48:15,423 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:15,424 INFO L411 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] [2019-10-02 10:48:15,424 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:15,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:15,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1592893925, now seen corresponding path program 1 times [2019-10-02 10:48:15,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:15,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:15,649 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:15,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:15,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-02 10:48:15,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:15,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:15,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:15,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:15,780 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:15,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:15,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:15,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:15,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-10-02 10:48:15,812 INFO L375 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 7 [2019-10-02 10:48:15,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:15,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:15,822 INFO L375 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 7 [2019-10-02 10:48:15,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:15,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:15,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:15,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-02 10:48:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:48:15,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:15,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-10-02 10:48:15,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:48:15,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:48:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:48:15,836 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 9 states. [2019-10-02 10:48:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:16,054 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-10-02 10:48:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 10:48:16,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-10-02 10:48:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:16,057 INFO L225 Difference]: With dead ends: 76 [2019-10-02 10:48:16,057 INFO L226 Difference]: Without dead ends: 68 [2019-10-02 10:48:16,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:48:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-02 10:48:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-10-02 10:48:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-02 10:48:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-02 10:48:16,067 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-10-02 10:48:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:16,067 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-02 10:48:16,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:48:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-02 10:48:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:48:16,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:16,069 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:16,069 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:16,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1278392056, now seen corresponding path program 2 times [2019-10-02 10:48:16,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:16,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:16,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:16,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:16,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:48:16,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:48:16,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:48:16,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:48:16,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:48:16,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:48:16,101 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 3 states. [2019-10-02 10:48:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:16,118 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-10-02 10:48:16,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:48:16,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-02 10:48:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:16,120 INFO L225 Difference]: With dead ends: 112 [2019-10-02 10:48:16,120 INFO L226 Difference]: Without dead ends: 70 [2019-10-02 10:48:16,121 INFO L640 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 [2019-10-02 10:48:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-02 10:48:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-10-02 10:48:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 10:48:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-10-02 10:48:16,130 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 30 [2019-10-02 10:48:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:16,130 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-10-02 10:48:16,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:48:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-10-02 10:48:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:48:16,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:16,132 INFO L411 BasicCegarLoop]: trace histogram [3, 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] [2019-10-02 10:48:16,132 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:16,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:16,133 INFO L82 PathProgramCache]: Analyzing trace with hash 496615306, now seen corresponding path program 1 times [2019-10-02 10:48:16,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:16,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:16,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:48:16,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:16,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:16,492 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:16,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:16,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-02 10:48:16,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:16,623 INFO L375 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 [2019-10-02 10:48:16,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-02 10:48:16,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,675 INFO L375 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 11 treesize of output 15 [2019-10-02 10:48:16,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-02 10:48:16,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:16,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:16,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,738 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-02 10:48:16,781 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_20|, |v_#memory_$Pointer$.base_21|]} [2019-10-02 10:48:16,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 19 [2019-10-02 10:48:16,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,804 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2019-10-02 10:48:16,804 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,832 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2019-10-02 10:48:16,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:16,836 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,847 INFO L567 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2019-10-02 10:48:16,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,847 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-02 10:48:16,940 INFO L375 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 39 treesize of output 21 [2019-10-02 10:48:16,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,953 INFO L375 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 23 treesize of output 11 [2019-10-02 10:48:16,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2019-10-02 10:48:16,993 INFO L375 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 27 treesize of output 11 [2019-10-02 10:48:16,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:16,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:16,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-10-02 10:48:17,033 INFO L375 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 7 [2019-10-02 10:48:17,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:17,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:17,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:17,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-02 10:48:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:17,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:17,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-10-02 10:48:17,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 10:48:17,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 10:48:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 10:48:17,075 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 24 states. [2019-10-02 10:48:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:18,310 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-10-02 10:48:18,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 10:48:18,311 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-10-02 10:48:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:18,312 INFO L225 Difference]: With dead ends: 85 [2019-10-02 10:48:18,312 INFO L226 Difference]: Without dead ends: 64 [2019-10-02 10:48:18,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 10:48:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-02 10:48:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-10-02 10:48:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-02 10:48:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-10-02 10:48:18,320 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2019-10-02 10:48:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:18,320 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-10-02 10:48:18,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 10:48:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-10-02 10:48:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-02 10:48:18,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:18,322 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:18,322 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash 748997879, now seen corresponding path program 1 times [2019-10-02 10:48:18,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:18,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:18,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:18,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:18,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:18,581 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:18,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-02 10:48:18,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:18,702 INFO L375 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 [2019-10-02 10:48:18,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:48:18,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:48:18,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 10:48:18,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,817 INFO L375 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 11 treesize of output 15 [2019-10-02 10:48:18,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,828 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-10-02 10:48:18,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:18,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 10:48:18,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-02 10:48:18,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:18,886 INFO L375 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 19 treesize of output 18 [2019-10-02 10:48:18,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-10-02 10:48:18,966 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-02 10:48:18,967 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-02 10:48:18,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:18,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:18,978 INFO L496 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. [2019-10-02 10:48:18,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-02 10:48:19,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:19,048 INFO L375 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-10-02 10:48:19,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:19,094 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-10-02 10:48:19,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,099 INFO L496 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. [2019-10-02 10:48:19,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-10-02 10:48:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:19,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:19,371 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-02 10:48:19,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:19,393 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2019-10-02 10:48:19,394 INFO L496 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. [2019-10-02 10:48:19,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2019-10-02 10:48:19,466 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:19,467 INFO L375 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 22 treesize of output 18 [2019-10-02 10:48:19,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:19,484 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-10-02 10:48:19,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:19,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-02 10:48:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:19,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:19,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-10-02 10:48:19,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 10:48:19,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 10:48:19,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-10-02 10:48:19,497 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2019-10-02 10:48:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:21,651 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-10-02 10:48:21,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 10:48:21,657 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-10-02 10:48:21,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:21,658 INFO L225 Difference]: With dead ends: 102 [2019-10-02 10:48:21,658 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 10:48:21,660 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=432, Invalid=2760, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 10:48:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 10:48:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-10-02 10:48:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-02 10:48:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-10-02 10:48:21,668 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 33 [2019-10-02 10:48:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:21,668 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-10-02 10:48:21,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 10:48:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-10-02 10:48:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-02 10:48:21,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:21,670 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:21,670 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -621471021, now seen corresponding path program 1 times [2019-10-02 10:48:21,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:22,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:22,075 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:22,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-02 10:48:22,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:22,212 INFO L375 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 [2019-10-02 10:48:22,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,227 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:48:22,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:48:22,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 10:48:22,352 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:48:22,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,386 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-02 10:48:22,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-02 10:48:22,424 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_31|]} [2019-10-02 10:48:22,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:22,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:22,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 10:48:22,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,471 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2019-10-02 10:48:22,538 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-02 10:48:22,538 INFO L375 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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-10-02 10:48:22,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,573 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-10-02 10:48:22,580 INFO L375 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 19 treesize of output 18 [2019-10-02 10:48:22,581 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2019-10-02 10:48:22,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,670 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-02 10:48:22,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-10-02 10:48:22,732 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_25|], 6=[|v_#memory_int_33|]} [2019-10-02 10:48:22,770 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,771 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 99 [2019-10-02 10:48:22,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:22,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:22,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 10:48:22,834 INFO L567 ElimStorePlain]: treesize reduction 110, result has 51.3 percent of original size [2019-10-02 10:48:22,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:22,860 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 77 [2019-10-02 10:48:22,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:22,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,880 INFO L496 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. [2019-10-02 10:48:22,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:87 [2019-10-02 10:48:22,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:22,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 150 [2019-10-02 10:48:22,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:22,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:22,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:23,038 INFO L567 ElimStorePlain]: treesize reduction 148, result has 42.0 percent of original size [2019-10-02 10:48:23,042 INFO L375 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 56 treesize of output 46 [2019-10-02 10:48:23,043 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:23,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:23,060 INFO L496 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. [2019-10-02 10:48:23,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:158, output treesize:91 [2019-10-02 10:48:23,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:23,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:23,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 49 [2019-10-02 10:48:23,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:23,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:23,196 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:23,230 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-10-02 10:48:23,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:23,231 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:37 [2019-10-02 10:48:23,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:23,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-02 10:48:23,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:23,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:23,309 INFO L496 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. [2019-10-02 10:48:23,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:37 [2019-10-02 10:48:23,448 INFO L341 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-10-02 10:48:23,449 INFO L375 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 1 case distinctions, treesize of input 41 treesize of output 37 [2019-10-02 10:48:23,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:23,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:23,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:23,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:23,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:51 [2019-10-02 10:48:23,584 INFO L375 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 22 treesize of output 10 [2019-10-02 10:48:23,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:23,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:23,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:23,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-02 10:48:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-10-02 10:48:23,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 10:48:23,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 10:48:23,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 10:48:23,607 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 33 states. [2019-10-02 10:48:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:25,845 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-10-02 10:48:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 10:48:25,846 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-10-02 10:48:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:25,847 INFO L225 Difference]: With dead ends: 124 [2019-10-02 10:48:25,847 INFO L226 Difference]: Without dead ends: 122 [2019-10-02 10:48:25,849 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=452, Invalid=3454, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 10:48:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-02 10:48:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-10-02 10:48:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-02 10:48:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-10-02 10:48:25,859 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 36 [2019-10-02 10:48:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:25,859 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-10-02 10:48:25,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 10:48:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-10-02 10:48:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 10:48:25,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:25,861 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:25,861 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash -234871608, now seen corresponding path program 1 times [2019-10-02 10:48:25,862 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:25,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 10:48:25,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:25,916 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:26,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 10:48:26,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:48:26,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:26,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2019-10-02 10:48:26,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:48:26,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:48:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:48:26,059 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 7 states. [2019-10-02 10:48:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:26,192 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-10-02 10:48:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 10:48:26,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-10-02 10:48:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:26,194 INFO L225 Difference]: With dead ends: 100 [2019-10-02 10:48:26,194 INFO L226 Difference]: Without dead ends: 95 [2019-10-02 10:48:26,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:48:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-02 10:48:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2019-10-02 10:48:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-02 10:48:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-10-02 10:48:26,204 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 38 [2019-10-02 10:48:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:26,204 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-10-02 10:48:26,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:48:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-10-02 10:48:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 10:48:26,205 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:26,205 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:26,206 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash -233161586, now seen corresponding path program 1 times [2019-10-02 10:48:26,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:48:26,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:26,490 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:26,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:26,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-02 10:48:26,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:26,642 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:26,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:26,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:26,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:26,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-10-02 10:48:26,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:26,702 INFO L375 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 1 case distinctions, treesize of input 21 treesize of output 48 [2019-10-02 10:48:26,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,731 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-10-02 10:48:26,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:26,754 INFO L375 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 1 case distinctions, treesize of input 21 treesize of output 48 [2019-10-02 10:48:26,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,782 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-10-02 10:48:26,783 INFO L496 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. [2019-10-02 10:48:26,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:36 [2019-10-02 10:48:26,810 INFO L375 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 7 [2019-10-02 10:48:26,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:26,818 INFO L375 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 7 [2019-10-02 10:48:26,819 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:26,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:26,828 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-02 10:48:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 10:48:26,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-10-02 10:48:26,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 10:48:26,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 10:48:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 10:48:26,837 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 11 states. [2019-10-02 10:48:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:27,169 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-10-02 10:48:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 10:48:27,172 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-10-02 10:48:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:27,173 INFO L225 Difference]: With dead ends: 101 [2019-10-02 10:48:27,173 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 10:48:27,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-10-02 10:48:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 10:48:27,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2019-10-02 10:48:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-02 10:48:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-10-02 10:48:27,182 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 38 [2019-10-02 10:48:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:27,182 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-10-02 10:48:27,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 10:48:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-10-02 10:48:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 10:48:27,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:27,184 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:27,184 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2076362507, now seen corresponding path program 2 times [2019-10-02 10:48:27,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:27,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:27,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:27,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:27,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:27,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:27,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:27,808 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:27,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:48:27,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:48:27,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:48:27,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-02 10:48:27,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:27,940 INFO L375 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 [2019-10-02 10:48:27,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:27,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:27,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:27,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:48:28,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:48:28,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,038 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-02 10:48:28,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-02 10:48:28,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:28,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:28,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2019-10-02 10:48:28,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:28,154 INFO L375 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 25 treesize of output 13 [2019-10-02 10:48:28,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,195 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-02 10:48:28,196 INFO L375 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 1 case distinctions, treesize of input 46 treesize of output 32 [2019-10-02 10:48:28,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,244 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-10-02 10:48:28,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,245 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-10-02 10:48:28,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,301 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 10:48:28,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-10-02 10:48:28,363 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-10-02 10:48:28,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,406 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,407 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 127 [2019-10-02 10:48:28,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:28,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:28,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-02 10:48:28,473 INFO L567 ElimStorePlain]: treesize reduction 120, result has 48.5 percent of original size [2019-10-02 10:48:28,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,474 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:127 [2019-10-02 10:48:28,545 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 6=[|v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_32|]} [2019-10-02 10:48:28,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 65 treesize of output 43 [2019-10-02 10:48:28,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,625 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,626 INFO L375 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 284 [2019-10-02 10:48:28,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:28,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:28,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:28,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:28,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-02 10:48:28,736 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-10-02 10:48:28,737 INFO L567 ElimStorePlain]: treesize reduction 688, result has 21.4 percent of original size [2019-10-02 10:48:28,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:28,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:28,767 INFO L375 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 150 [2019-10-02 10:48:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:28,769 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,803 INFO L567 ElimStorePlain]: treesize reduction 136, result has 46.2 percent of original size [2019-10-02 10:48:28,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:28,804 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:367, output treesize:117 [2019-10-02 10:48:28,969 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_38|], 6=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_33|]} [2019-10-02 10:48:29,020 INFO L341 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2019-10-02 10:48:29,020 INFO L375 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 3 case distinctions, treesize of input 49 treesize of output 82 [2019-10-02 10:48:29,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,091 INFO L567 ElimStorePlain]: treesize reduction 18, result has 88.7 percent of original size [2019-10-02 10:48:29,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:29,107 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 108 [2019-10-02 10:48:29,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,179 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.1 percent of original size [2019-10-02 10:48:29,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:29,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 128 [2019-10-02 10:48:29,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,227 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:29,311 INFO L567 ElimStorePlain]: treesize reduction 62, result has 60.8 percent of original size [2019-10-02 10:48:29,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:29,317 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:136, output treesize:153 [2019-10-02 10:48:29,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:29,530 INFO L375 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 73 treesize of output 49 [2019-10-02 10:48:29,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,535 INFO L375 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 96 treesize of output 52 [2019-10-02 10:48:29,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,595 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-10-02 10:48:29,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-10-02 10:48:29,600 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2019-10-02 10:48:29,607 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:29,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-02 10:48:29,630 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:170, output treesize:43 [2019-10-02 10:48:29,655 INFO L375 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 27 treesize of output 11 [2019-10-02 10:48:29,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:29,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-10-02 10:48:29,672 INFO L375 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 7 [2019-10-02 10:48:29,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:29,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:29,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2019-10-02 10:48:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 10:48:29,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:29,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2019-10-02 10:48:29,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 10:48:29,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 10:48:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-10-02 10:48:29,734 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 28 states. [2019-10-02 10:48:30,935 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2019-10-02 10:48:47,159 WARN L191 SmtUtils]: Spent 16.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-02 10:48:47,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:47,597 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-10-02 10:48:47,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 10:48:47,602 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-10-02 10:48:47,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:47,603 INFO L225 Difference]: With dead ends: 119 [2019-10-02 10:48:47,604 INFO L226 Difference]: Without dead ends: 105 [2019-10-02 10:48:47,604 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 10:48:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-02 10:48:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2019-10-02 10:48:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-02 10:48:47,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-10-02 10:48:47,616 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 39 [2019-10-02 10:48:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:47,616 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-10-02 10:48:47,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 10:48:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-10-02 10:48:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 10:48:47,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:47,618 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:47,618 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash -731659325, now seen corresponding path program 1 times [2019-10-02 10:48:47,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:47,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:47,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:47,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:48:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:48:48,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:48,149 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:48,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:48,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-02 10:48:48,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:48,298 INFO L375 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 [2019-10-02 10:48:48,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:48:48,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:48:48,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,415 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-02 10:48:48,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-02 10:48:48,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:48,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,479 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:48,479 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-10-02 10:48:48,542 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_30|]} [2019-10-02 10:48:48,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:48:48,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:48,580 INFO L375 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 46 treesize of output 22 [2019-10-02 10:48:48,581 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:48,608 INFO L375 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 34 treesize of output 16 [2019-10-02 10:48:48,609 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,626 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:58 [2019-10-02 10:48:48,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,685 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 10:48:48,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-10-02 10:48:48,754 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:48,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,767 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 132 [2019-10-02 10:48:48,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:48,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,832 INFO L567 ElimStorePlain]: treesize reduction 30, result has 84.8 percent of original size [2019-10-02 10:48:48,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:48,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-10-02 10:48:48,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:48,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 116 [2019-10-02 10:48:48,886 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,928 INFO L567 ElimStorePlain]: treesize reduction 42, result has 65.3 percent of original size [2019-10-02 10:48:48,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:48,929 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:188, output treesize:73 [2019-10-02 10:48:48,979 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_37|]} [2019-10-02 10:48:49,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-10-02 10:48:49,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-10-02 10:48:49,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,040 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,046 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:49,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 126 [2019-10-02 10:48:49,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:49,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:49,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:49,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:49,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,109 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-10-02 10:48:49,184 INFO L567 ElimStorePlain]: treesize reduction 781, result has 9.1 percent of original size [2019-10-02 10:48:49,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:49,185 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:181, output treesize:77 [2019-10-02 10:48:49,320 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-10-02 10:48:49,324 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:49,324 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-10-02 10:48:49,325 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,344 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:49,360 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-02 10:48:49,361 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 40 [2019-10-02 10:48:49,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:49,363 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:49,395 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-10-02 10:48:49,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:49,396 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:33 [2019-10-02 10:48:49,452 INFO L375 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 34 treesize of output 21 [2019-10-02 10:48:49,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,465 INFO L496 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. [2019-10-02 10:48:49,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:25 [2019-10-02 10:48:49,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:49,559 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-02 10:48:49,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,569 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,570 INFO L496 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. [2019-10-02 10:48:49,570 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-02 10:48:49,699 INFO L375 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 22 treesize of output 10 [2019-10-02 10:48:49,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:49,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:49,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-02 10:48:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:48:49,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:49,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-10-02 10:48:49,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 10:48:49,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 10:48:49,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 10:48:49,718 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 33 states. [2019-10-02 10:48:51,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:51,351 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-10-02 10:48:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 10:48:51,351 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-10-02 10:48:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:51,352 INFO L225 Difference]: With dead ends: 118 [2019-10-02 10:48:51,352 INFO L226 Difference]: Without dead ends: 116 [2019-10-02 10:48:51,353 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=264, Invalid=1992, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 10:48:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-02 10:48:51,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-10-02 10:48:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-10-02 10:48:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-10-02 10:48:51,363 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 40 [2019-10-02 10:48:51,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:51,364 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-10-02 10:48:51,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 10:48:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-10-02 10:48:51,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-02 10:48:51,365 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:51,365 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:51,365 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1250078526, now seen corresponding path program 1 times [2019-10-02 10:48:51,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:51,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:51,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:51,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:51,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 10:48:51,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:51,781 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:51,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:51,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 10:48:51,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:51,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:51,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:51,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:51,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:51,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:51,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:51,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:51,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-10-02 10:48:51,991 INFO L375 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 7 [2019-10-02 10:48:51,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:51,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:52,002 INFO L375 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 7 [2019-10-02 10:48:52,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:52,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:52,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:52,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-10-02 10:48:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 10:48:52,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:52,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 20 [2019-10-02 10:48:52,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 10:48:52,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 10:48:52,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-10-02 10:48:52,016 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 20 states. [2019-10-02 10:48:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:48:52,903 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2019-10-02 10:48:52,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 10:48:52,904 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-10-02 10:48:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:48:52,904 INFO L225 Difference]: With dead ends: 116 [2019-10-02 10:48:52,905 INFO L226 Difference]: Without dead ends: 94 [2019-10-02 10:48:52,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2019-10-02 10:48:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-02 10:48:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2019-10-02 10:48:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 10:48:52,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-10-02 10:48:52,918 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 42 [2019-10-02 10:48:52,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:48:52,918 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-10-02 10:48:52,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 10:48:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-10-02 10:48:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 10:48:52,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:48:52,920 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:48:52,920 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:48:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:48:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -855225014, now seen corresponding path program 3 times [2019-10-02 10:48:52,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:48:52,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:48:52,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:52,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:48:52,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:48:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:48:53,431 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-10-02 10:48:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:54,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:48:54,199 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:48:54,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:48:54,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:48:54,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:48:54,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 106 conjunts are in the unsatisfiable core [2019-10-02 10:48:54,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:48:54,414 INFO L375 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 [2019-10-02 10:48:54,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:48:54,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:48:54,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,552 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-02 10:48:54,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,553 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-02 10:48:54,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:54,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:48:54,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,654 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-10-02 10:48:54,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:54,706 INFO L375 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 34 treesize of output 16 [2019-10-02 10:48:54,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:54,728 INFO L375 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 46 treesize of output 22 [2019-10-02 10:48:54,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,742 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2019-10-02 10:48:54,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,763 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-02 10:48:54,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,781 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,781 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:58 [2019-10-02 10:48:54,859 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2019-10-02 10:48:54,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,899 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:54,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:54,918 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 99 [2019-10-02 10:48:54,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:54,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,977 INFO L567 ElimStorePlain]: treesize reduction 30, result has 78.7 percent of original size [2019-10-02 10:48:54,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:54,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:141, output treesize:126 [2019-10-02 10:48:55,055 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|], 6=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_42|]} [2019-10-02 10:48:55,061 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:48:55,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,161 INFO L341 Elim1Store]: treesize reduction 56, result has 54.5 percent of original size [2019-10-02 10:48:55,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 134 [2019-10-02 10:48:55,162 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,221 INFO L567 ElimStorePlain]: treesize reduction 44, result has 69.0 percent of original size [2019-10-02 10:48:55,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:55,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:55,232 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,232 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 46 [2019-10-02 10:48:55,233 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,271 INFO L567 ElimStorePlain]: treesize reduction 30, result has 73.5 percent of original size [2019-10-02 10:48:55,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,272 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:167, output treesize:83 [2019-10-02 10:48:55,420 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_46|], 6=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_43|]} [2019-10-02 10:48:55,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:55,429 INFO L375 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 97 treesize of output 31 [2019-10-02 10:48:55,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:55,462 INFO L375 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 120 [2019-10-02 10:48:55,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:55,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 153 [2019-10-02 10:48:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,546 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-10-02 10:48:55,630 INFO L567 ElimStorePlain]: treesize reduction 548, result has 24.2 percent of original size [2019-10-02 10:48:55,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,631 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:271, output treesize:145 [2019-10-02 10:48:55,708 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_47|], 6=[|v_#memory_$Pointer$.base_44|], 12=[|v_#memory_$Pointer$.offset_39|]} [2019-10-02 10:48:55,735 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 120 [2019-10-02 10:48:55,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:55,829 INFO L567 ElimStorePlain]: treesize reduction 42, result has 87.9 percent of original size [2019-10-02 10:48:55,841 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:55,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:55,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 285 treesize of output 239 [2019-10-02 10:48:55,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:55,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:48:55,953 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:56,040 INFO L567 ElimStorePlain]: treesize reduction 130, result has 50.2 percent of original size [2019-10-02 10:48:56,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:56,091 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:56,092 INFO L375 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 160 [2019-10-02 10:48:56,093 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:56,146 INFO L567 ElimStorePlain]: treesize reduction 34, result has 69.1 percent of original size [2019-10-02 10:48:56,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:56,148 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:294, output treesize:122 [2019-10-02 10:48:56,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,376 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-02 10:48:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,505 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_45|], 9=[|v_#memory_int_48|, |v_#memory_$Pointer$.offset_40|]} [2019-10-02 10:48:56,604 INFO L341 Elim1Store]: treesize reduction 24, result has 66.2 percent of original size [2019-10-02 10:48:56,604 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 141 [2019-10-02 10:48:56,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,608 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:56,697 INFO L341 Elim1Store]: treesize reduction 24, result has 66.2 percent of original size [2019-10-02 10:48:56,697 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 152 [2019-10-02 10:48:56,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:56,701 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:48:57,098 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-10-02 10:48:57,098 INFO L567 ElimStorePlain]: treesize reduction 44, result has 84.4 percent of original size [2019-10-02 10:48:57,185 INFO L341 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2019-10-02 10:48:57,186 INFO L375 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 118 [2019-10-02 10:48:57,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,189 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:57,267 INFO L341 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2019-10-02 10:48:57,268 INFO L375 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 4 case distinctions, treesize of input 124 treesize of output 140 [2019-10-02 10:48:57,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,271 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:57,573 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-10-02 10:48:57,574 INFO L567 ElimStorePlain]: treesize reduction 33, result has 87.0 percent of original size [2019-10-02 10:48:57,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:57,613 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:57,613 INFO L375 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 1 case distinctions, treesize of input 105 treesize of output 126 [2019-10-02 10:48:57,614 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:57,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:57,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 136 [2019-10-02 10:48:57,640 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:57,849 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2019-10-02 10:48:57,850 INFO L567 ElimStorePlain]: treesize reduction 28, result has 88.6 percent of original size [2019-10-02 10:48:57,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:57,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 12 dim-0 vars, and 2 xjuncts. [2019-10-02 10:48:57,858 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:284, output treesize:327 [2019-10-02 10:48:58,298 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 87 [2019-10-02 10:48:58,510 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-02 10:48:58,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:48:58,519 INFO L392 ElimStorePlain]: Different costs {9=[|#memory_$Pointer$.base|], 14=[|#memory_$Pointer$.offset|]} [2019-10-02 10:48:58,529 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,536 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,537 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 78 [2019-10-02 10:48:58,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,549 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 67 [2019-10-02 10:48:58,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,558 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,559 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 61 [2019-10-02 10:48:58,560 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,566 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,567 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 76 [2019-10-02 10:48:58,567 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,799 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-10-02 10:48:58,800 INFO L567 ElimStorePlain]: treesize reduction 12, result has 95.5 percent of original size [2019-10-02 10:48:58,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,816 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2019-10-02 10:48:58,816 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,825 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2019-10-02 10:48:58,825 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:58,850 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,851 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,852 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2019-10-02 10:48:58,853 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:58,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:48:58,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2019-10-02 10:48:58,861 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:58,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:58,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-10-02 10:48:58,939 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:375, output treesize:139 [2019-10-02 10:48:59,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:59,075 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_20], 3=[|v_#memory_int_49|]} [2019-10-02 10:48:59,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:59,082 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 33 [2019-10-02 10:48:59,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:59,135 INFO L567 ElimStorePlain]: treesize reduction 12, result has 84.4 percent of original size [2019-10-02 10:48:59,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:59,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2019-10-02 10:48:59,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:59,192 INFO L567 ElimStorePlain]: treesize reduction 32, result has 61.0 percent of original size [2019-10-02 10:48:59,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-02 10:48:59,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:50 [2019-10-02 10:48:59,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:59,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:48:59,480 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:59,480 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2019-10-02 10:48:59,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:59,500 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-10-02 10:48:59,500 INFO L496 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. [2019-10-02 10:48:59,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-02 10:48:59,657 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:59,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 30 [2019-10-02 10:48:59,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:48:59,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:48:59,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:48:59,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:48:59,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:3 [2019-10-02 10:48:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:48:59,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:48:59,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2019-10-02 10:48:59,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 10:48:59,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 10:48:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1592, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 10:48:59,689 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 42 states. [2019-10-02 10:49:01,004 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-10-02 10:49:01,358 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 57 [2019-10-02 10:49:01,659 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2019-10-02 10:49:05,919 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2019-10-02 10:49:34,195 WARN L191 SmtUtils]: Spent 28.19 s on a formula simplification. DAG size of input: 130 DAG size of output: 96 [2019-10-02 10:49:35,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:49:35,551 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2019-10-02 10:49:35,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 10:49:35,553 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-10-02 10:49:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:49:35,554 INFO L225 Difference]: With dead ends: 122 [2019-10-02 10:49:35,555 INFO L226 Difference]: Without dead ends: 113 [2019-10-02 10:49:35,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=330, Invalid=3702, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 10:49:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-02 10:49:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2019-10-02 10:49:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-02 10:49:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2019-10-02 10:49:35,566 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 45 [2019-10-02 10:49:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:49:35,566 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2019-10-02 10:49:35,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 10:49:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2019-10-02 10:49:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 10:49:35,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:49:35,568 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:49:35,568 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:49:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:49:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash 531748195, now seen corresponding path program 2 times [2019-10-02 10:49:35,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:49:35,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:49:35,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:35,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:49:35,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:49:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:49:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:49:36,098 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:49:36,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:49:36,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:49:36,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:49:36,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 73 conjunts are in the unsatisfiable core [2019-10-02 10:49:36,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:49:36,246 INFO L375 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 [2019-10-02 10:49:36,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:49:36,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:49:36,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 10:49:36,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:49:36,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,375 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-02 10:49:36,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-02 10:49:36,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:36,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 10:49:36,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-02 10:49:36,454 INFO L375 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 19 treesize of output 18 [2019-10-02 10:49:36,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,467 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-02 10:49:36,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-02 10:49:36,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,582 INFO L567 ElimStorePlain]: treesize reduction 28, result has 61.6 percent of original size [2019-10-02 10:49:36,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:45 [2019-10-02 10:49:36,684 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-02 10:49:36,684 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-02 10:49:36,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,703 INFO L496 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. [2019-10-02 10:49:36,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:45 [2019-10-02 10:49:36,775 INFO L375 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 26 treesize of output 28 [2019-10-02 10:49:36,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,808 INFO L496 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. [2019-10-02 10:49:36,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2019-10-02 10:49:36,874 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 37 [2019-10-02 10:49:36,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,895 INFO L496 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. [2019-10-02 10:49:36,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2019-10-02 10:49:36,975 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-02 10:49:36,975 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-10-02 10:49:36,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:36,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:36,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:36,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:68, output treesize:49 [2019-10-02 10:49:37,074 INFO L375 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-10-02 10:49:37,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:37,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:37,102 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:37,102 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:56 [2019-10-02 10:49:37,250 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-02 10:49:37,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2019-10-02 10:49:37,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:37,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:37,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:37,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:59 [2019-10-02 10:49:37,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:37,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 136 [2019-10-02 10:49:37,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:37,515 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2019-10-02 10:49:37,516 INFO L567 ElimStorePlain]: treesize reduction 60, result has 62.0 percent of original size [2019-10-02 10:49:37,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:37,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:74, output treesize:98 [2019-10-02 10:49:37,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:37,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:37,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2019-10-02 10:49:37,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:37,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:37,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2019-10-02 10:49:37,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:38,065 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.9 percent of original size [2019-10-02 10:49:38,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-10-02 10:49:38,067 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:151, output treesize:105 [2019-10-02 10:49:38,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:38,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2019-10-02 10:49:38,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:38,321 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.5 percent of original size [2019-10-02 10:49:38,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:38,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2019-10-02 10:49:38,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:38,404 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.4 percent of original size [2019-10-02 10:49:38,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:38,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 14 variables, input treesize:121, output treesize:3 [2019-10-02 10:49:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:49:38,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:49:38,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 37 [2019-10-02 10:49:38,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-02 10:49:38,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-02 10:49:38,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1149, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 10:49:38,447 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 37 states. [2019-10-02 10:49:40,269 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-10-02 10:49:40,535 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 96 [2019-10-02 10:49:41,173 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 117 [2019-10-02 10:49:41,384 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2019-10-02 10:49:47,491 WARN L191 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 131 DAG size of output: 130 [2019-10-02 10:49:49,809 WARN L191 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 133 DAG size of output: 132 [2019-10-02 10:49:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:49:50,226 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2019-10-02 10:49:50,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 10:49:50,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 45 [2019-10-02 10:49:50,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:49:50,227 INFO L225 Difference]: With dead ends: 123 [2019-10-02 10:49:50,228 INFO L226 Difference]: Without dead ends: 115 [2019-10-02 10:49:50,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=557, Invalid=3733, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 10:49:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-02 10:49:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 87. [2019-10-02 10:49:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 10:49:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2019-10-02 10:49:50,239 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 45 [2019-10-02 10:49:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:49:50,240 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2019-10-02 10:49:50,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-02 10:49:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2019-10-02 10:49:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 10:49:50,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:49:50,241 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:49:50,242 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:49:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:49:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1534159489, now seen corresponding path program 2 times [2019-10-02 10:49:50,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:49:50,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:49:50,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:50,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:49:50,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:49:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:49:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:49:51,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:49:51,286 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:49:51,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:49:51,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:49:51,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:49:51,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 94 conjunts are in the unsatisfiable core [2019-10-02 10:49:51,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:49:51,439 INFO L375 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 [2019-10-02 10:49:51,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:49:51,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:49:51,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,550 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-02 10:49:51,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-02 10:49:51,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:49:51,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:49:51,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,643 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-10-02 10:49:51,689 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_61|], 2=[|v_#memory_$Pointer$.offset_43|, |v_#memory_$Pointer$.base_50|]} [2019-10-02 10:49:51,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:49:51,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:51,727 INFO L375 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 34 treesize of output 16 [2019-10-02 10:49:51,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:51,766 INFO L375 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 46 treesize of output 22 [2019-10-02 10:49:51,766 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,783 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,784 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:46 [2019-10-02 10:49:51,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,853 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-02 10:49:51,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:44 [2019-10-02 10:49:51,930 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_62|], 2=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_51|]} [2019-10-02 10:49:51,934 INFO L375 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 47 treesize of output 17 [2019-10-02 10:49:51,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,968 INFO L375 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 33 treesize of output 26 [2019-10-02 10:49:51,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:51,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:51,997 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:49:52,007 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,008 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 67 [2019-10-02 10:49:52,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,010 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,048 INFO L567 ElimStorePlain]: treesize reduction 10, result has 88.8 percent of original size [2019-10-02 10:49:52,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,049 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:142, output treesize:73 [2019-10-02 10:49:52,094 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_int_63|], 6=[|v_#memory_$Pointer$.base_52|]} [2019-10-02 10:49:52,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:52,099 INFO L375 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 25 treesize of output 13 [2019-10-02 10:49:52,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:52,128 INFO L375 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 25 treesize of output 24 [2019-10-02 10:49:52,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:49:52,215 INFO L341 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2019-10-02 10:49:52,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 64 [2019-10-02 10:49:52,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,219 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:52,263 INFO L567 ElimStorePlain]: treesize reduction 26, result has 66.2 percent of original size [2019-10-02 10:49:52,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,264 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:60 [2019-10-02 10:49:52,374 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_$Pointer$.base_53|, |v_#memory_int_64|]} [2019-10-02 10:49:52,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-10-02 10:49:52,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:49:52,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 161 [2019-10-02 10:49:52,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:49:52,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:52,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,559 INFO L567 ElimStorePlain]: treesize reduction 544, result has 25.3 percent of original size [2019-10-02 10:49:52,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:52,567 INFO L375 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 171 treesize of output 128 [2019-10-02 10:49:52,568 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:52,593 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:211, output treesize:115 [2019-10-02 10:49:52,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,724 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 173 [2019-10-02 10:49:52,725 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,816 INFO L567 ElimStorePlain]: treesize reduction 78, result has 65.6 percent of original size [2019-10-02 10:49:52,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:52,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:49:52,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,829 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 69 [2019-10-02 10:49:52,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:52,899 INFO L567 ElimStorePlain]: treesize reduction 30, result has 81.7 percent of original size [2019-10-02 10:49:52,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:52,945 INFO L375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 132 [2019-10-02 10:49:52,946 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,043 INFO L567 ElimStorePlain]: treesize reduction 60, result has 72.5 percent of original size [2019-10-02 10:49:53,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:53,047 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:224, output treesize:158 [2019-10-02 10:49:53,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,435 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-10-02 10:49:53,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:49:53,521 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_34], 1=[|#memory_$Pointer$.base|, v_prenex_36, v_prenex_35, v_prenex_33, v_prenex_37], 2=[|#memory_$Pointer$.offset|, v_prenex_39]} [2019-10-02 10:49:53,532 INFO L375 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 71 treesize of output 63 [2019-10-02 10:49:53,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,629 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,630 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 75 [2019-10-02 10:49:53,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,632 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:53,809 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2019-10-02 10:49:53,810 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-10-02 10:49:53,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:53,821 INFO L375 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 71 treesize of output 51 [2019-10-02 10:49:53,822 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:53,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,915 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:53,915 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 40 [2019-10-02 10:49:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:53,917 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:54,094 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-10-02 10:49:54,094 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.5 percent of original size [2019-10-02 10:49:54,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:54,107 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 47 [2019-10-02 10:49:54,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,109 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:54,299 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-10-02 10:49:54,300 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.3 percent of original size [2019-10-02 10:49:54,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:54,310 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 68 [2019-10-02 10:49:54,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,313 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:49:54,455 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-10-02 10:49:54,456 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.9 percent of original size [2019-10-02 10:49:54,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 65 treesize of output 51 [2019-10-02 10:49:54,463 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:54,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:54,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 40 [2019-10-02 10:49:54,528 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:54,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:54,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 8 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-10-02 10:49:54,590 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:352, output treesize:147 [2019-10-02 10:49:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,781 INFO L341 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2019-10-02 10:49:54,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 65 [2019-10-02 10:49:54,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:54,844 INFO L341 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2019-10-02 10:49:54,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 61 [2019-10-02 10:49:54,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:54,925 INFO L567 ElimStorePlain]: treesize reduction 20, result has 81.0 percent of original size [2019-10-02 10:49:54,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:54,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-10-02 10:49:54,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:103, output treesize:96 [2019-10-02 10:49:55,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:49:55,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:55,200 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 29 [2019-10-02 10:49:55,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:55,213 INFO L567 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-10-02 10:49:55,214 INFO L496 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. [2019-10-02 10:49:55,214 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:18 [2019-10-02 10:49:55,310 INFO L341 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2019-10-02 10:49:55,310 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 49 [2019-10-02 10:49:55,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:55,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:55,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,342 INFO L496 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. [2019-10-02 10:49:55,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:49 [2019-10-02 10:49:55,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:49:55,730 INFO L375 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 7 [2019-10-02 10:49:55,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:49:55,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:49:55,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:49:55,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2019-10-02 10:49:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:49:55,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:49:55,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2019-10-02 10:49:55,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-02 10:49:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-02 10:49:55,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1907, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 10:49:55,758 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 46 states. [2019-10-02 10:49:56,971 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-10-02 10:49:57,510 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-10-02 10:49:57,779 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-10-02 10:49:59,027 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-10-02 10:49:59,273 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-10-02 10:49:59,504 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-02 10:50:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:50:00,028 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2019-10-02 10:50:00,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 10:50:00,029 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 47 [2019-10-02 10:50:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:50:00,030 INFO L225 Difference]: With dead ends: 122 [2019-10-02 10:50:00,030 INFO L226 Difference]: Without dead ends: 120 [2019-10-02 10:50:00,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1511 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=480, Invalid=4922, Unknown=0, NotChecked=0, Total=5402 [2019-10-02 10:50:00,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-02 10:50:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 90. [2019-10-02 10:50:00,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-02 10:50:00,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2019-10-02 10:50:00,042 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 47 [2019-10-02 10:50:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:50:00,043 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2019-10-02 10:50:00,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-02 10:50:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2019-10-02 10:50:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 10:50:00,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:50:00,044 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:50:00,044 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:50:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:50:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1532449467, now seen corresponding path program 2 times [2019-10-02 10:50:00,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:50:00,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:50:00,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:50:00,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:50:00,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:50:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:50:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:50:01,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:50:01,265 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:50:01,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:50:01,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:50:01,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:50:01,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 104 conjunts are in the unsatisfiable core [2019-10-02 10:50:01,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:50:01,428 INFO L375 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 [2019-10-02 10:50:01,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:50:01,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:50:01,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 10:50:01,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,574 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:50:01,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,609 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2019-10-02 10:50:01,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,610 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2019-10-02 10:50:01,667 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_48|, |v_#memory_$Pointer$.base_55|], 2=[|v_#memory_int_70|]} [2019-10-02 10:50:01,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:50:01,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:50:01,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:01,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 10:50:01,740 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,762 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:88, output treesize:64 [2019-10-02 10:50:01,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:01,826 INFO L375 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 46 treesize of output 22 [2019-10-02 10:50:01,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:01,859 INFO L375 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 19 treesize of output 18 [2019-10-02 10:50:01,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,908 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2019-10-02 10:50:01,936 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-02 10:50:01,936 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 26 [2019-10-02 10:50:01,937 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,974 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.1 percent of original size [2019-10-02 10:50:01,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:01,975 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:49 [2019-10-02 10:50:02,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,052 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-02 10:50:02,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2019-10-02 10:50:02,129 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_50|], 4=[|v_#memory_int_72|]} [2019-10-02 10:50:02,132 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:02,144 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,144 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 82 [2019-10-02 10:50:02,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 10:50:02,215 INFO L567 ElimStorePlain]: treesize reduction 82, result has 61.3 percent of original size [2019-10-02 10:50:02,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,221 INFO L375 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 115 treesize of output 108 [2019-10-02 10:50:02,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,252 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2019-10-02 10:50:02,253 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,273 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:139, output treesize:80 [2019-10-02 10:50:02,333 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_51|], 6=[|v_#memory_$Pointer$.base_58|, |v_#memory_int_73|]} [2019-10-02 10:50:02,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,339 INFO L375 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 25 treesize of output 13 [2019-10-02 10:50:02,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,373 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:02,423 INFO L341 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2019-10-02 10:50:02,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 64 [2019-10-02 10:50:02,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,427 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:02,478 INFO L567 ElimStorePlain]: treesize reduction 26, result has 70.5 percent of original size [2019-10-02 10:50:02,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,484 INFO L375 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 26 treesize of output 28 [2019-10-02 10:50:02,485 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,508 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:121, output treesize:67 [2019-10-02 10:50:02,646 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_52|], 6=[|v_#memory_$Pointer$.base_59|], 12=[|v_#memory_int_74|]} [2019-10-02 10:50:02,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2019-10-02 10:50:02,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,695 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:02,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 161 [2019-10-02 10:50:02,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:02,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:02,757 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,861 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-10-02 10:50:02,861 INFO L567 ElimStorePlain]: treesize reduction 442, result has 30.2 percent of original size [2019-10-02 10:50:02,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:02,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 138 [2019-10-02 10:50:02,869 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:02,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:02,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:02,897 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:218, output treesize:122 [2019-10-02 10:50:02,997 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_60|, |v_#memory_$Pointer$.offset_53|], 12=[|v_#memory_int_75|]} [2019-10-02 10:50:03,014 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:03,052 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 203 [2019-10-02 10:50:03,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:03,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,076 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:03,172 INFO L567 ElimStorePlain]: treesize reduction 106, result has 52.7 percent of original size [2019-10-02 10:50:03,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,212 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 118 [2019-10-02 10:50:03,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,303 INFO L567 ElimStorePlain]: treesize reduction 58, result has 62.1 percent of original size [2019-10-02 10:50:03,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:03,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:03,358 INFO L375 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 3 case distinctions, treesize of input 33 treesize of output 94 [2019-10-02 10:50:03,360 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:03,467 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-10-02 10:50:03,467 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.8 percent of original size [2019-10-02 10:50:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:03,471 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:231, output treesize:169 [2019-10-02 10:50:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:03,888 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-02 10:50:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:50:04,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:04,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 55 [2019-10-02 10:50:04,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,033 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,037 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2019-10-02 10:50:04,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,045 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 67 [2019-10-02 10:50:04,046 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,051 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,052 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 83 [2019-10-02 10:50:04,053 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,188 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-10-02 10:50:04,189 INFO L567 ElimStorePlain]: treesize reduction 64, result has 76.7 percent of original size [2019-10-02 10:50:04,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-10-02 10:50:04,190 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:376, output treesize:211 [2019-10-02 10:50:04,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:04,345 INFO L392 ElimStorePlain]: Different costs {11=[|v_#memory_$Pointer$.base_61|], 36=[|v_#memory_int_76|]} [2019-10-02 10:50:04,351 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,353 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:04,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 101 [2019-10-02 10:50:04,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,377 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:04,383 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,386 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,409 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:04,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 93 [2019-10-02 10:50:04,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,412 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:04,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:04,433 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:04,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 108 [2019-10-02 10:50:04,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:04,436 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:04,655 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-02 10:50:04,656 INFO L567 ElimStorePlain]: treesize reduction 72, result has 74.7 percent of original size [2019-10-02 10:50:04,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:04,695 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:04,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 77 [2019-10-02 10:50:04,697 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:04,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:04,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 78 treesize of output 107 [2019-10-02 10:50:04,749 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:04,765 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:04,766 INFO L375 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 1 case distinctions, treesize of input 71 treesize of output 69 [2019-10-02 10:50:04,766 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:04,932 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-10-02 10:50:04,933 INFO L567 ElimStorePlain]: treesize reduction 120, result has 56.5 percent of original size [2019-10-02 10:50:04,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-10-02 10:50:04,934 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:307, output treesize:136 [2019-10-02 10:50:05,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:05,223 INFO L375 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 44 treesize of output 36 [2019-10-02 10:50:05,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:05,292 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.2 percent of original size [2019-10-02 10:50:05,296 INFO L375 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 59 treesize of output 43 [2019-10-02 10:50:05,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:05,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:05,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 10:50:05,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:66 [2019-10-02 10:50:05,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:05,519 INFO L341 Elim1Store]: treesize reduction 88, result has 42.1 percent of original size [2019-10-02 10:50:05,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 94 [2019-10-02 10:50:05,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:05,600 INFO L341 Elim1Store]: treesize reduction 88, result has 37.1 percent of original size [2019-10-02 10:50:05,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 64 [2019-10-02 10:50:05,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:05,698 INFO L567 ElimStorePlain]: treesize reduction 32, result has 74.6 percent of original size [2019-10-02 10:50:05,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:05,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:05,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-02 10:50:05,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:104, output treesize:76 [2019-10-02 10:50:05,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:05,931 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_50, v_prenex_51, |v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_62|], 5=[|v_#memory_int_78|], 11=[v_prenex_49]} [2019-10-02 10:50:05,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 71 treesize of output 67 [2019-10-02 10:50:05,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:05,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:05,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 63 [2019-10-02 10:50:05,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:06,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 56 [2019-10-02 10:50:06,050 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:06,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 56 treesize of output 52 [2019-10-02 10:50:06,097 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:06,186 INFO L341 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2019-10-02 10:50:06,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2019-10-02 10:50:06,187 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,262 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.4 percent of original size [2019-10-02 10:50:06,332 INFO L341 Elim1Store]: treesize reduction 44, result has 53.7 percent of original size [2019-10-02 10:50:06,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 89 [2019-10-02 10:50:06,334 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,438 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-02 10:50:06,438 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.3 percent of original size [2019-10-02 10:50:06,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 10:50:06,441 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:132, output treesize:118 [2019-10-02 10:50:06,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:06,959 INFO L375 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 58 treesize of output 40 [2019-10-02 10:50:06,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,962 INFO L375 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 41 treesize of output 29 [2019-10-02 10:50:06,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:06,991 INFO L375 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 26 treesize of output 18 [2019-10-02 10:50:06,991 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:06,994 INFO L375 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 37 treesize of output 25 [2019-10-02 10:50:06,995 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:07,013 INFO L567 ElimStorePlain]: treesize reduction 23, result has 39.5 percent of original size [2019-10-02 10:50:07,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:07,014 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:11 [2019-10-02 10:50:07,070 INFO L375 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 7 [2019-10-02 10:50:07,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:07,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:07,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:07,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 10:50:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:50:07,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:50:07,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2019-10-02 10:50:07,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-02 10:50:07,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-02 10:50:07,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2016, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 10:50:07,099 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 47 states. [2019-10-02 10:50:08,683 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2019-10-02 10:50:09,277 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 77 [2019-10-02 10:50:09,750 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2019-10-02 10:50:10,068 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-10-02 10:50:10,355 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2019-10-02 10:50:11,062 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-10-02 10:50:11,711 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-10-02 10:50:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:50:12,627 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2019-10-02 10:50:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 10:50:12,628 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-10-02 10:50:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:50:12,629 INFO L225 Difference]: With dead ends: 117 [2019-10-02 10:50:12,629 INFO L226 Difference]: Without dead ends: 115 [2019-10-02 10:50:12,631 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=342, Invalid=4214, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 10:50:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-02 10:50:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2019-10-02 10:50:12,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-02 10:50:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2019-10-02 10:50:12,652 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 47 [2019-10-02 10:50:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:50:12,652 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2019-10-02 10:50:12,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-02 10:50:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2019-10-02 10:50:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 10:50:12,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:50:12,653 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:50:12,654 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:50:12,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:50:12,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1924573792, now seen corresponding path program 4 times [2019-10-02 10:50:12,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:50:12,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:50:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:50:12,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:50:12,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:50:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:50:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:50:14,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:50:14,022 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:50:14,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:50:14,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:50:14,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:50:14,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 112 conjunts are in the unsatisfiable core [2019-10-02 10:50:14,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:50:14,191 INFO L375 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 [2019-10-02 10:50:14,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:50:14,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:50:14,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,312 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-02 10:50:14,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-02 10:50:14,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:50:14,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:50:14,386 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-10-02 10:50:14,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:14,463 INFO L375 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 34 treesize of output 16 [2019-10-02 10:50:14,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:14,490 INFO L375 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 46 treesize of output 22 [2019-10-02 10:50:14,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,507 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,507 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:51 [2019-10-02 10:50:14,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,584 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 99 [2019-10-02 10:50:14,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,647 INFO L567 ElimStorePlain]: treesize reduction 46, result has 63.2 percent of original size [2019-10-02 10:50:14,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:79 [2019-10-02 10:50:14,718 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2019-10-02 10:50:14,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:14,767 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:14,768 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 104 [2019-10-02 10:50:14,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:14,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,836 INFO L567 ElimStorePlain]: treesize reduction 30, result has 81.5 percent of original size [2019-10-02 10:50:14,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:162, output treesize:165 [2019-10-02 10:50:14,913 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_79|], 6=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_66|]} [2019-10-02 10:50:14,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:50:14,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:14,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,079 INFO L341 Elim1Store]: treesize reduction 56, result has 54.5 percent of original size [2019-10-02 10:50:15,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 151 [2019-10-02 10:50:15,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,150 INFO L567 ElimStorePlain]: treesize reduction 24, result has 84.3 percent of original size [2019-10-02 10:50:15,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:15,156 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:15,159 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,159 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 56 [2019-10-02 10:50:15,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,215 INFO L567 ElimStorePlain]: treesize reduction 30, result has 79.2 percent of original size [2019-10-02 10:50:15,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,216 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:114 [2019-10-02 10:50:15,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:15,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,318 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 53 [2019-10-02 10:50:15,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:114 [2019-10-02 10:50:15,421 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_80|], 5=[|v_#memory_$Pointer$.base_67|, |v_#memory_$Pointer$.offset_59|]} [2019-10-02 10:50:15,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 21 [2019-10-02 10:50:15,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:15,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,496 INFO L375 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 127 [2019-10-02 10:50:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,590 INFO L567 ElimStorePlain]: treesize reduction 212, result has 42.1 percent of original size [2019-10-02 10:50:15,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:15,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:15,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:15,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 136 treesize of output 128 [2019-10-02 10:50:15,604 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,633 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:246, output treesize:164 [2019-10-02 10:50:15,706 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_81|], 11=[|v_#memory_$Pointer$.base_68|, |v_#memory_$Pointer$.offset_60|]} [2019-10-02 10:50:15,712 INFO L375 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 71 treesize of output 56 [2019-10-02 10:50:15,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:15,783 INFO L567 ElimStorePlain]: treesize reduction 28, result has 91.6 percent of original size [2019-10-02 10:50:15,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:15,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:15,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 295 treesize of output 244 [2019-10-02 10:50:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:50:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:15,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 15 xjuncts. [2019-10-02 10:50:16,110 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 45 [2019-10-02 10:50:16,110 INFO L567 ElimStorePlain]: treesize reduction 5348, result has 4.0 percent of original size [2019-10-02 10:50:16,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:16,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:16,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:16,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:16,143 INFO L375 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 271 [2019-10-02 10:50:16,144 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:16,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:16,163 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:16,164 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:353, output treesize:123 [2019-10-02 10:50:16,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:16,538 INFO L341 Elim1Store]: treesize reduction 74, result has 56.7 percent of original size [2019-10-02 10:50:16,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 122 [2019-10-02 10:50:16,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:16,637 INFO L567 ElimStorePlain]: treesize reduction 81, result has 66.3 percent of original size [2019-10-02 10:50:16,719 INFO L341 Elim1Store]: treesize reduction 56, result has 54.1 percent of original size [2019-10-02 10:50:16,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 135 [2019-10-02 10:50:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:16,732 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:16,876 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-02 10:50:16,877 INFO L567 ElimStorePlain]: treesize reduction 30, result has 80.4 percent of original size [2019-10-02 10:50:16,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:16,898 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:16,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 63 [2019-10-02 10:50:16,899 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:17,013 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-02 10:50:17,014 INFO L567 ElimStorePlain]: treesize reduction 14, result has 89.6 percent of original size [2019-10-02 10:50:17,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:17,018 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:155, output treesize:184 [2019-10-02 10:50:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,345 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_56], 3=[|#memory_$Pointer$.offset|]} [2019-10-02 10:50:17,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:17,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 99 treesize of output 83 [2019-10-02 10:50:17,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:17,478 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-02 10:50:17,479 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.5 percent of original size [2019-10-02 10:50:17,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:17,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:17,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:17,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2019-10-02 10:50:17,486 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:17,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:17,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 10:50:17,533 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:217, output treesize:130 [2019-10-02 10:50:17,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,651 INFO L392 ElimStorePlain]: Different costs {30=[|v_#memory_$Pointer$.base_70|], 49=[|v_#memory_int_83|]} [2019-10-02 10:50:17,735 INFO L341 Elim1Store]: treesize reduction 56, result has 54.1 percent of original size [2019-10-02 10:50:17,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 132 [2019-10-02 10:50:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:17,820 INFO L341 Elim1Store]: treesize reduction 24, result has 66.2 percent of original size [2019-10-02 10:50:17,821 INFO L375 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 122 [2019-10-02 10:50:17,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:17,824 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:18,286 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-10-02 10:50:18,286 INFO L567 ElimStorePlain]: treesize reduction 247, result has 54.3 percent of original size [2019-10-02 10:50:18,396 INFO L341 Elim1Store]: treesize reduction 96, result has 53.8 percent of original size [2019-10-02 10:50:18,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 238 [2019-10-02 10:50:18,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,426 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:18,519 INFO L341 Elim1Store]: treesize reduction 50, result has 49.5 percent of original size [2019-10-02 10:50:18,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 94 treesize of output 121 [2019-10-02 10:50:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:18,521 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:19,061 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 83 [2019-10-02 10:50:19,061 INFO L567 ElimStorePlain]: treesize reduction 4359, result has 6.9 percent of original size [2019-10-02 10:50:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-10-02 10:50:19,068 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:227, output treesize:333 [2019-10-02 10:50:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,597 WARN L191 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 93 [2019-10-02 10:50:19,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,733 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,734 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2019-10-02 10:50:19,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:19,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,751 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,766 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:19,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 59 [2019-10-02 10:50:19,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:19,774 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,775 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 67 treesize of output 53 [2019-10-02 10:50:19,776 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:19,780 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,781 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,786 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:19,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 49 [2019-10-02 10:50:19,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:19,788 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:50:19,792 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:50:19,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:19,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 55 [2019-10-02 10:50:19,807 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:19,956 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-10-02 10:50:19,956 INFO L567 ElimStorePlain]: treesize reduction 31, result has 83.5 percent of original size [2019-10-02 10:50:19,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-10-02 10:50:19,958 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:325, output treesize:125 [2019-10-02 10:50:20,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:50:20,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:20,063 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 29 [2019-10-02 10:50:20,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:20,077 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2019-10-02 10:50:20,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:20,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2019-10-02 10:50:20,207 INFO L341 Elim1Store]: treesize reduction 50, result has 39.8 percent of original size [2019-10-02 10:50:20,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 39 [2019-10-02 10:50:20,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:20,231 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-10-02 10:50:20,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:50:20,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:20,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-10-02 10:50:20,260 INFO L375 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 7 [2019-10-02 10:50:20,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:50:20,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:50:20,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:50:20,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 10:50:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:50:20,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:50:20,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2019-10-02 10:50:20,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-02 10:50:20,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-02 10:50:20,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1828, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 10:50:20,299 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 45 states. [2019-10-02 10:50:38,109 WARN L191 SmtUtils]: Spent 16.12 s on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-10-02 10:51:22,428 WARN L191 SmtUtils]: Spent 44.24 s on a formula simplification. DAG size of input: 96 DAG size of output: 94 [2019-10-02 10:51:24,858 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 112 DAG size of output: 101 [2019-10-02 10:51:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:51:25,932 INFO L93 Difference]: Finished difference Result 134 states and 155 transitions. [2019-10-02 10:51:25,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 10:51:25,932 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-10-02 10:51:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:51:25,934 INFO L225 Difference]: With dead ends: 134 [2019-10-02 10:51:25,934 INFO L226 Difference]: Without dead ends: 132 [2019-10-02 10:51:25,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 67.3s TimeCoverageRelationStatistics Valid=395, Invalid=5007, Unknown=0, NotChecked=0, Total=5402 [2019-10-02 10:51:25,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-02 10:51:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 96. [2019-10-02 10:51:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 10:51:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2019-10-02 10:51:25,948 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 48 [2019-10-02 10:51:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:51:25,948 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2019-10-02 10:51:25,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-02 10:51:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2019-10-02 10:51:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 10:51:25,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:51:25,949 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:51:25,949 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:51:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:51:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -191091993, now seen corresponding path program 5 times [2019-10-02 10:51:25,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:51:25,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:51:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:25,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:51:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:51:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:51:26,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:51:26,540 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:51:26,648 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 10:51:26,832 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-10-02 10:51:26,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:51:26,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 95 conjunts are in the unsatisfiable core [2019-10-02 10:51:26,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:51:26,843 INFO L375 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 [2019-10-02 10:51:26,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:26,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:26,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:26,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-02 10:51:26,899 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-10-02 10:51:26,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:26,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:26,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:26,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-02 10:51:26,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:26,959 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-02 10:51:26,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:26,993 INFO L567 ElimStorePlain]: treesize reduction 14, result has 70.8 percent of original size [2019-10-02 10:51:26,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:26,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:34 [2019-10-02 10:51:27,044 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_71|], 2=[|v_#memory_int_87|]} [2019-10-02 10:51:27,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:51:27,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:27,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-02 10:51:27,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,095 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:49 [2019-10-02 10:51:27,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:27,155 INFO L375 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 19 treesize of output 18 [2019-10-02 10:51:27,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,196 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.9 percent of original size [2019-10-02 10:51:27,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:27,201 INFO L375 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 36 treesize of output 18 [2019-10-02 10:51:27,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:40 [2019-10-02 10:51:27,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:27,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-10-02 10:51:27,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,357 INFO L567 ElimStorePlain]: treesize reduction 28, result has 66.7 percent of original size [2019-10-02 10:51:27,357 INFO L496 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. [2019-10-02 10:51:27,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:56 [2019-10-02 10:51:27,413 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_73|], 4=[|v_#memory_int_89|]} [2019-10-02 10:51:27,416 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:27,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,428 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 69 [2019-10-02 10:51:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:27,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-02 10:51:27,496 INFO L567 ElimStorePlain]: treesize reduction 69, result has 61.2 percent of original size [2019-10-02 10:51:27,506 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,507 INFO L375 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 1 case distinctions, treesize of input 88 treesize of output 75 [2019-10-02 10:51:27,507 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,553 INFO L567 ElimStorePlain]: treesize reduction 10, result has 88.2 percent of original size [2019-10-02 10:51:27,554 INFO L496 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. [2019-10-02 10:51:27,554 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:62 [2019-10-02 10:51:27,610 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_74|], 6=[|v_#memory_int_90|]} [2019-10-02 10:51:27,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:27,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2019-10-02 10:51:27,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,676 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,677 INFO L375 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 98 [2019-10-02 10:51:27,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,745 INFO L567 ElimStorePlain]: treesize reduction 40, result has 69.0 percent of original size [2019-10-02 10:51:27,746 INFO L496 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. [2019-10-02 10:51:27,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:89 [2019-10-02 10:51:27,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 100 [2019-10-02 10:51:27,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:27,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:27,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 96 [2019-10-02 10:51:27,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:28,008 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-10-02 10:51:28,009 INFO L567 ElimStorePlain]: treesize reduction 10, result has 93.3 percent of original size [2019-10-02 10:51:28,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-02 10:51:28,010 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:103 [2019-10-02 10:51:28,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,095 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_65, |v_#memory_$Pointer$.base_75|], 4=[|v_#memory_int_91|], 7=[v_prenex_63]} [2019-10-02 10:51:28,102 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:28,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:28,116 INFO L375 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 1 case distinctions, treesize of input 78 treesize of output 89 [2019-10-02 10:51:28,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,117 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:28,248 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-10-02 10:51:28,248 INFO L567 ElimStorePlain]: treesize reduction 14, result has 93.2 percent of original size [2019-10-02 10:51:28,253 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:28,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:28,268 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 89 [2019-10-02 10:51:28,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:28,382 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-10-02 10:51:28,382 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.2 percent of original size [2019-10-02 10:51:28,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:28,393 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 70 [2019-10-02 10:51:28,394 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:28,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:28,469 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:28,469 INFO L375 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 3 case distinctions, treesize of input 75 treesize of output 93 [2019-10-02 10:51:28,470 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:28,558 INFO L567 ElimStorePlain]: treesize reduction 48, result has 72.3 percent of original size [2019-10-02 10:51:28,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-02 10:51:28,560 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:196, output treesize:133 [2019-10-02 10:51:28,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,771 INFO L392 ElimStorePlain]: Different costs {17=[|v_#memory_$Pointer$.base_76|], 24=[|v_#memory_int_92|]} [2019-10-02 10:51:28,795 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:28,847 INFO L341 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2019-10-02 10:51:28,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 89 [2019-10-02 10:51:28,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,850 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:28,872 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:28,921 INFO L341 Elim1Store]: treesize reduction 44, result has 49.4 percent of original size [2019-10-02 10:51:28,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 85 [2019-10-02 10:51:28,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:28,925 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:28,953 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-02 10:51:28,954 INFO L375 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 1 case distinctions, treesize of input 74 treesize of output 62 [2019-10-02 10:51:28,954 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:29,135 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-02 10:51:29,136 INFO L567 ElimStorePlain]: treesize reduction 59, result has 73.8 percent of original size [2019-10-02 10:51:29,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:29,153 INFO L375 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 53 treesize of output 55 [2019-10-02 10:51:29,154 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:29,174 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:29,175 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 54 [2019-10-02 10:51:29,175 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:29,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:29,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:29,219 INFO L375 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 3 case distinctions, treesize of input 68 treesize of output 113 [2019-10-02 10:51:29,220 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:29,392 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-02 10:51:29,393 INFO L567 ElimStorePlain]: treesize reduction 36, result has 81.8 percent of original size [2019-10-02 10:51:29,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,395 INFO L496 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. [2019-10-02 10:51:29,395 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:258, output treesize:174 [2019-10-02 10:51:29,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,832 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-02 10:51:29,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 10:51:29,841 INFO L392 ElimStorePlain]: Different costs {52=[|v_#memory_$Pointer$.base_77|], 147=[|v_#memory_int_93|]} [2019-10-02 10:51:29,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:29,935 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:29,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 156 [2019-10-02 10:51:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:29,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:29,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:29,992 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2019-10-02 10:51:29,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:29,993 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:30,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:30,037 INFO L375 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 77 treesize of output 66 [2019-10-02 10:51:30,038 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:30,066 INFO L375 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 71 treesize of output 70 [2019-10-02 10:51:30,066 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:30,098 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:30,138 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:30,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 160 [2019-10-02 10:51:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:30,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:30,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:30,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:30,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:30,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:30,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:30,144 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:31,260 WARN L191 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 158 DAG size of output: 119 [2019-10-02 10:51:31,261 INFO L567 ElimStorePlain]: treesize reduction 968, result has 33.4 percent of original size [2019-10-02 10:51:31,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:31,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 82 [2019-10-02 10:51:31,312 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:31,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:31,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 92 [2019-10-02 10:51:31,375 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:31,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:31,559 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-10-02 10:51:31,560 INFO L341 Elim1Store]: treesize reduction 108, result has 60.6 percent of original size [2019-10-02 10:51:31,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 112 treesize of output 230 [2019-10-02 10:51:31,561 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:31,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:31,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:31,594 INFO L375 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 1 case distinctions, treesize of input 92 treesize of output 78 [2019-10-02 10:51:31,594 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:31,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:31,712 INFO L341 Elim1Store]: treesize reduction 100, result has 56.7 percent of original size [2019-10-02 10:51:31,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 147 treesize of output 216 [2019-10-02 10:51:31,714 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:32,019 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 96 [2019-10-02 10:51:32,019 INFO L567 ElimStorePlain]: treesize reduction 254, result has 58.4 percent of original size [2019-10-02 10:51:32,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:32,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-10-02 10:51:32,022 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:528, output treesize:297 [2019-10-02 10:51:32,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:32,345 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-10-02 10:51:32,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:32,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 10:51:32,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:32,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:32,579 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_69], 2=[v_prenex_75], 4=[v_prenex_72, |v_#memory_$Pointer$.base_78|], 9=[v_prenex_71], 11=[|v_#memory_int_94|, v_prenex_77], 21=[v_prenex_74]} [2019-10-02 10:51:32,601 INFO L375 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 78 treesize of output 58 [2019-10-02 10:51:32,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:33,183 WARN L191 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 143 [2019-10-02 10:51:33,184 INFO L567 ElimStorePlain]: treesize reduction 8, result has 98.2 percent of original size [2019-10-02 10:51:33,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:33,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2019-10-02 10:51:33,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:33,640 WARN L191 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2019-10-02 10:51:33,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:33,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:33,735 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:33,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:33,740 INFO L375 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 1 case distinctions, treesize of input 97 treesize of output 82 [2019-10-02 10:51:33,741 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:33,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:33,778 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:33,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:33,783 INFO L375 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 1 case distinctions, treesize of input 89 treesize of output 74 [2019-10-02 10:51:33,784 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:34,246 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 126 [2019-10-02 10:51:34,246 INFO L567 ElimStorePlain]: treesize reduction 36, result has 91.5 percent of original size [2019-10-02 10:51:34,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:34,263 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:34,268 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:34,269 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 78 [2019-10-02 10:51:34,270 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:34,627 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 117 [2019-10-02 10:51:34,628 INFO L567 ElimStorePlain]: treesize reduction 30, result has 92.6 percent of original size [2019-10-02 10:51:34,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:34,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 144 [2019-10-02 10:51:34,691 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:35,065 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2019-10-02 10:51:35,065 INFO L567 ElimStorePlain]: treesize reduction 48, result has 89.1 percent of original size [2019-10-02 10:51:35,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:35,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:35,128 INFO L375 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 3 case distinctions, treesize of input 93 treesize of output 202 [2019-10-02 10:51:35,128 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:35,490 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 128 [2019-10-02 10:51:35,491 INFO L567 ElimStorePlain]: treesize reduction 72, result has 85.4 percent of original size [2019-10-02 10:51:35,555 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:35,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 162 [2019-10-02 10:51:35,556 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:35,943 WARN L191 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 131 [2019-10-02 10:51:35,944 INFO L567 ElimStorePlain]: treesize reduction 48, result has 90.5 percent of original size [2019-10-02 10:51:35,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:36,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:36,065 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 236 [2019-10-02 10:51:36,066 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:36,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:36,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:36,119 INFO L375 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 3 case distinctions, treesize of input 74 treesize of output 143 [2019-10-02 10:51:36,120 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:36,565 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 137 [2019-10-02 10:51:36,566 INFO L567 ElimStorePlain]: treesize reduction 108, result has 83.2 percent of original size [2019-10-02 10:51:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 8 dim-2 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-10-02 10:51:36,580 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 18 variables, input treesize:456, output treesize:533 [2019-10-02 10:51:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,912 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-10-02 10:51:36,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-02 10:51:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:36,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,736 WARN L191 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 201 DAG size of output: 116 [2019-10-02 10:51:40,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-10-02 10:51:40,896 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,898 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,899 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2019-10-02 10:51:40,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:40,912 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:40,918 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 50 [2019-10-02 10:51:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,920 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:40,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:40,937 INFO L375 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 87 treesize of output 59 [2019-10-02 10:51:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,939 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:40,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,948 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,949 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2019-10-02 10:51:40,967 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:40,978 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:40,983 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2019-10-02 10:51:40,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,985 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:40,993 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:40,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:40,998 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 47 [2019-10-02 10:51:40,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:40,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:41,000 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:41,005 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:41,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:41,010 INFO L375 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 65 treesize of output 43 [2019-10-02 10:51:41,011 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:41,018 INFO L375 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 61 treesize of output 43 [2019-10-02 10:51:41,018 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:41,301 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 101 [2019-10-02 10:51:41,301 INFO L567 ElimStorePlain]: treesize reduction 44, result has 86.3 percent of original size [2019-10-02 10:51:41,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 8 xjuncts. [2019-10-02 10:51:41,304 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:527, output treesize:278 [2019-10-02 10:51:41,507 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 52 [2019-10-02 10:51:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:41,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:41,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:41,530 INFO L375 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 1 case distinctions, treesize of input 52 treesize of output 50 [2019-10-02 10:51:41,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:41,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:41,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:41,550 INFO L375 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 1 case distinctions, treesize of input 52 treesize of output 50 [2019-10-02 10:51:41,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:41,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:41,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:41,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2019-10-02 10:51:41,570 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:41,656 INFO L567 ElimStorePlain]: treesize reduction 48, result has 66.7 percent of original size [2019-10-02 10:51:41,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-10-02 10:51:41,657 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:153, output treesize:96 [2019-10-02 10:51:41,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:51:41,945 INFO L341 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2019-10-02 10:51:41,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 66 [2019-10-02 10:51:41,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:41,986 INFO L341 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2019-10-02 10:51:41,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 56 [2019-10-02 10:51:41,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:42,040 INFO L341 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2019-10-02 10:51:42,040 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 64 [2019-10-02 10:51:42,041 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:42,161 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-10-02 10:51:42,161 INFO L567 ElimStorePlain]: treesize reduction 34, result has 78.2 percent of original size [2019-10-02 10:51:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:42,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 3 xjuncts. [2019-10-02 10:51:42,165 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:153, output treesize:136 [2019-10-02 10:51:42,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:42,393 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_91], 2=[|#memory_int|]} [2019-10-02 10:51:42,399 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:42,399 INFO L375 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 22 treesize of output 18 [2019-10-02 10:51:42,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:42,429 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.7 percent of original size [2019-10-02 10:51:42,432 INFO L375 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 26 treesize of output 14 [2019-10-02 10:51:42,432 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:42,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:42,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:42,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-10-02 10:51:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:51:42,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:51:42,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 42 [2019-10-02 10:51:42,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 10:51:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 10:51:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1545, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 10:51:42,481 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 42 states. [2019-10-02 10:51:43,514 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-10-02 10:51:44,165 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2019-10-02 10:51:44,818 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 104 [2019-10-02 10:51:45,737 WARN L191 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 186 [2019-10-02 10:51:46,563 WARN L191 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 130 [2019-10-02 10:51:46,938 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-10-02 10:51:47,292 WARN L191 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2019-10-02 10:51:48,156 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-10-02 10:51:48,417 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-02 10:51:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:51:48,736 INFO L93 Difference]: Finished difference Result 140 states and 156 transitions. [2019-10-02 10:51:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 10:51:48,736 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 48 [2019-10-02 10:51:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:51:48,739 INFO L225 Difference]: With dead ends: 140 [2019-10-02 10:51:48,739 INFO L226 Difference]: Without dead ends: 138 [2019-10-02 10:51:48,742 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1574 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=560, Invalid=4696, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 10:51:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-10-02 10:51:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 96. [2019-10-02 10:51:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-02 10:51:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-10-02 10:51:48,755 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 48 [2019-10-02 10:51:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:51:48,755 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-10-02 10:51:48,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 10:51:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-10-02 10:51:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 10:51:48,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:51:48,756 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:51:48,756 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:51:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:51:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1153433094, now seen corresponding path program 1 times [2019-10-02 10:51:48,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:51:48,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:51:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:48,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:51:48,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:51:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:51:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:51:49,365 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:51:49,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:51:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:51:49,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-02 10:51:49,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:51:49,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:51:49,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:49,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:49,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:51:49,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:49,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:49,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:49,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-10-02 10:51:49,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:49,775 INFO L375 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 1 case distinctions, treesize of input 23 treesize of output 56 [2019-10-02 10:51:49,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:49,817 INFO L567 ElimStorePlain]: treesize reduction 22, result has 70.7 percent of original size [2019-10-02 10:51:49,840 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:49,840 INFO L375 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 1 case distinctions, treesize of input 23 treesize of output 56 [2019-10-02 10:51:49,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:49,880 INFO L567 ElimStorePlain]: treesize reduction 34, result has 59.0 percent of original size [2019-10-02 10:51:49,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:49,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:40 [2019-10-02 10:51:50,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:50,154 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|], 2=[|#memory_$Pointer$.offset|]} [2019-10-02 10:51:50,156 INFO L375 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 48 treesize of output 36 [2019-10-02 10:51:50,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:50,160 INFO L375 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 48 treesize of output 36 [2019-10-02 10:51:50,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:50,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:50,192 INFO L375 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 33 treesize of output 17 [2019-10-02 10:51:50,193 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:50,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 10:51:50,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:50,200 INFO L375 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 1 case distinctions, treesize of input 33 treesize of output 17 [2019-10-02 10:51:50,201 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:50,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:50,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:50,217 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:7 [2019-10-02 10:51:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 10:51:50,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:51:50,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2019-10-02 10:51:50,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 10:51:50,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 10:51:50,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2019-10-02 10:51:50,263 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 31 states. [2019-10-02 10:51:51,356 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-10-02 10:51:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:51:53,402 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2019-10-02 10:51:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 10:51:53,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2019-10-02 10:51:53,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:51:53,405 INFO L225 Difference]: With dead ends: 152 [2019-10-02 10:51:53,405 INFO L226 Difference]: Without dead ends: 143 [2019-10-02 10:51:53,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=367, Invalid=3923, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 10:51:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-02 10:51:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 99. [2019-10-02 10:51:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-02 10:51:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2019-10-02 10:51:53,422 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 49 [2019-10-02 10:51:53,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:51:53,423 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2019-10-02 10:51:53,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 10:51:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2019-10-02 10:51:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 10:51:53,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:51:53,424 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:51:53,424 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:51:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:51:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash 488170170, now seen corresponding path program 2 times [2019-10-02 10:51:53,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:51:53,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:51:53,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:53,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:51:53,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:51:54,450 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:51:54,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:51:54,450 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:51:54,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:51:54,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:51:54,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:51:54,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 10:51:54,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:51:54,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:51:54,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:54,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:54,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:54,760 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2019-10-02 10:51:54,820 INFO L375 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 20 treesize of output 8 [2019-10-02 10:51:54,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:54,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:54,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:54,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2019-10-02 10:51:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 10:51:54,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:51:54,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 9] total 33 [2019-10-02 10:51:54,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 10:51:54,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 10:51:54,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 10:51:54,832 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand 33 states. [2019-10-02 10:51:55,966 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-10-02 10:51:56,155 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-10-02 10:51:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:51:57,564 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2019-10-02 10:51:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 10:51:57,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 49 [2019-10-02 10:51:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:51:57,565 INFO L225 Difference]: With dead ends: 136 [2019-10-02 10:51:57,565 INFO L226 Difference]: Without dead ends: 131 [2019-10-02 10:51:57,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=431, Invalid=3229, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 10:51:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-02 10:51:57,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2019-10-02 10:51:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-02 10:51:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2019-10-02 10:51:57,582 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 49 [2019-10-02 10:51:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:51:57,583 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2019-10-02 10:51:57,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 10:51:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2019-10-02 10:51:57,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 10:51:57,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:51:57,584 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:51:57,584 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:51:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:51:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash 489880192, now seen corresponding path program 3 times [2019-10-02 10:51:57,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:51:57,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:51:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:57,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:51:57,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:51:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:51:58,860 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:51:58,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:51:58,860 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:51:58,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:51:59,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 10:51:59,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:51:59,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-02 10:51:59,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:51:59,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:51:59,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-10-02 10:51:59,191 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,200 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-10-02 10:51:59,286 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,287 INFO L375 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 1 case distinctions, treesize of input 23 treesize of output 56 [2019-10-02 10:51:59,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,316 INFO L567 ElimStorePlain]: treesize reduction 34, result has 56.4 percent of original size [2019-10-02 10:51:59,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,340 INFO L375 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 1 case distinctions, treesize of input 23 treesize of output 56 [2019-10-02 10:51:59,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,373 INFO L567 ElimStorePlain]: treesize reduction 34, result has 54.1 percent of original size [2019-10-02 10:51:59,374 INFO L496 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. [2019-10-02 10:51:59,374 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-10-02 10:51:59,437 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_97|], 2=[|v_#memory_$Pointer$.offset_69|, |v_#memory_$Pointer$.base_84|]} [2019-10-02 10:51:59,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 1 [2019-10-02 10:51:59,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,477 INFO L375 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 1 case distinctions, treesize of input 21 treesize of output 48 [2019-10-02 10:51:59,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,508 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.9 percent of original size [2019-10-02 10:51:59,530 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,531 INFO L375 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 1 case distinctions, treesize of input 21 treesize of output 48 [2019-10-02 10:51:59,531 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,565 INFO L567 ElimStorePlain]: treesize reduction 18, result has 70.5 percent of original size [2019-10-02 10:51:59,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,565 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:52 [2019-10-02 10:51:59,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:59,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:59,841 INFO L392 ElimStorePlain]: Different costs {19=[|#memory_$Pointer$.base|], 27=[|#memory_$Pointer$.offset|]} [2019-10-02 10:51:59,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:59,853 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,853 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 56 [2019-10-02 10:51:59,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:51:59,861 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-02 10:51:59,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 93 [2019-10-02 10:51:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:59,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:59,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:51:59,881 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-02 10:51:59,942 INFO L567 ElimStorePlain]: treesize reduction 22, result has 81.7 percent of original size [2019-10-02 10:51:59,954 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:51:59,954 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-02 10:51:59,955 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-02 10:52:00,156 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:52:00,157 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 10:52:00,163 INFO L168 Benchmark]: Toolchain (without parser) took 229409.39 ms. Allocated memory was 133.7 MB in the beginning and 335.5 MB in the end (delta: 201.9 MB). Free memory was 88.4 MB in the beginning and 177.4 MB in the end (delta: -89.0 MB). Peak memory consumption was 112.8 MB. Max. memory is 7.1 GB. [2019-10-02 10:52:00,163 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 10:52:00,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 603.07 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 88.2 MB in the beginning and 163.4 MB in the end (delta: -75.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-10-02 10:52:00,164 INFO L168 Benchmark]: Boogie Preprocessor took 70.81 ms. Allocated memory is still 201.9 MB. Free memory was 163.4 MB in the beginning and 160.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-02 10:52:00,164 INFO L168 Benchmark]: RCFGBuilder took 694.64 ms. Allocated memory is still 201.9 MB. Free memory was 160.2 MB in the beginning and 114.6 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. [2019-10-02 10:52:00,164 INFO L168 Benchmark]: TraceAbstraction took 228036.57 ms. Allocated memory was 201.9 MB in the beginning and 335.5 MB in the end (delta: 133.7 MB). Free memory was 114.0 MB in the beginning and 177.4 MB in the end (delta: -63.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. [2019-10-02 10:52:00,165 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 107.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 603.07 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 88.2 MB in the beginning and 163.4 MB in the end (delta: -75.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.81 ms. Allocated memory is still 201.9 MB. Free memory was 163.4 MB in the beginning and 160.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 694.64 ms. Allocated memory is still 201.9 MB. Free memory was 160.2 MB in the beginning and 114.6 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228036.57 ms. Allocated memory was 201.9 MB in the beginning and 335.5 MB in the end (delta: 133.7 MB). Free memory was 114.0 MB in the beginning and 177.4 MB in the end (delta: -63.4 MB). Peak memory consumption was 70.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...