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-ext2-properties/simple_and_skiplist_2lvl-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:11:32,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:11:32,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:11:32,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:11:32,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:11:32,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:11:32,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:11:32,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:11:32,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:11:32,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:11:32,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:11:32,857 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:11:32,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:11:32,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:11:32,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:11:32,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:11:32,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:11:32,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:11:32,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:11:32,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:11:32,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:11:32,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:11:32,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:11:32,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:11:32,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:11:32,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:11:32,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:11:32,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:11:32,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:11:32,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:11:32,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:11:32,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:11:32,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:11:32,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:11:32,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:11:32,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:11:32,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:11:32,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:11:32,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:11:32,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:11:32,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:11:32,888 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-13 19:11:32,906 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:11:32,906 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:11:32,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:11:32,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:11:32,908 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:11:32,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:11:32,908 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:11:32,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:11:32,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:11:32,909 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:11:32,909 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:11:32,909 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:11:32,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:11:32,910 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:11:32,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:11:32,910 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:11:32,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:11:32,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:11:32,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:11:32,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:11:32,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:11:32,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:11:32,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:11:32,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:11:32,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:11:32,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:11:32,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:11:32,912 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:11:32,913 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:11:33,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:11:33,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:11:33,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:11:33,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:11:33,215 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:11:33,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2019-10-13 19:11:33,277 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb8a5f77/21720732d38944cf8d86888fb9fdb879/FLAG3f9d57362 [2019-10-13 19:11:33,792 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:11:33,793 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2019-10-13 19:11:33,816 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb8a5f77/21720732d38944cf8d86888fb9fdb879/FLAG3f9d57362 [2019-10-13 19:11:34,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb8a5f77/21720732d38944cf8d86888fb9fdb879 [2019-10-13 19:11:34,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:11:34,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:11:34,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:11:34,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:11:34,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:11:34,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7156f2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34, skipping insertion in model container [2019-10-13 19:11:34,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,159 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:11:34,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:11:34,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:11:34,747 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:11:34,801 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:11:34,862 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:11:34,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34 WrapperNode [2019-10-13 19:11:34,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:11:34,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:11:34,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:11:34,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:11:34,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,933 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (1/1) ... [2019-10-13 19:11:34,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:11:34,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:11:34,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:11:34,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:11:34,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (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-13 19:11:35,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:11:35,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die [2019-10-13 19:11:35,002 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2019-10-13 19:11:35,003 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2019-10-13 19:11:35,006 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2019-10-13 19:11:35,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:11:35,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:11:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:11:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:11:35,007 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:11:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:11:35,008 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:11:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:11:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:11:35,011 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:11:35,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:11:35,013 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:11:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:11:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:11:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:11:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:11:35,014 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:11:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:11:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:11:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:11:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:11:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:11:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:11:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:11:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:11:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:11:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:11:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:11:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:11:35,018 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:11:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:11:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:11:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:11:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:11:35,019 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 19:11:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:11:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:11:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:11:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:11:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:11:35,020 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:11:35,021 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:11:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:11:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:11:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:11:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:11:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:11:35,022 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:11:35,023 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:11:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:11:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:11:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:11:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:11:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:11:35,024 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:11:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:11:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:11:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:11:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:11:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:11:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die [2019-10-13 19:11:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:11:35,027 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2019-10-13 19:11:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:11:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:11:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2019-10-13 19:11:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2019-10-13 19:11:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:11:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:11:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:11:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:11:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:11:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:11:35,442 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:11:35,793 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:11:35,794 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-13 19:11:35,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:11:35 BoogieIcfgContainer [2019-10-13 19:11:35,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:11:35,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:11:35,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:11:35,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:11:35,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:11:34" (1/3) ... [2019-10-13 19:11:35,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6527a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:11:35, skipping insertion in model container [2019-10-13 19:11:35,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:34" (2/3) ... [2019-10-13 19:11:35,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6527a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:11:35, skipping insertion in model container [2019-10-13 19:11:35,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:11:35" (3/3) ... [2019-10-13 19:11:35,806 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2019-10-13 19:11:35,817 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:11:35,827 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:11:35,840 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:11:35,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:11:35,869 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:11:35,869 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:11:35,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:11:35,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:11:35,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:11:35,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:11:35,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:11:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-10-13 19:11:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 19:11:35,901 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:35,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:35,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 407034730, now seen corresponding path program 1 times [2019-10-13 19:11:35,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:35,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256819178] [2019-10-13 19:11:35,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:35,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:35,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,117 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-13 19:11:36,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256819178] [2019-10-13 19:11:36,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:36,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:11:36,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084580695] [2019-10-13 19:11:36,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:11:36,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:11:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:11:36,167 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2019-10-13 19:11:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:36,349 INFO L93 Difference]: Finished difference Result 95 states and 129 transitions. [2019-10-13 19:11:36,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:11:36,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 19:11:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:36,360 INFO L225 Difference]: With dead ends: 95 [2019-10-13 19:11:36,360 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 19:11:36,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-13 19:11:36,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 19:11:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 19:11:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 19:11:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-13 19:11:36,400 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2019-10-13 19:11:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:36,401 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-13 19:11:36,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:11:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-13 19:11:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:11:36,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:36,402 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:36,402 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:36,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:36,403 INFO L82 PathProgramCache]: Analyzing trace with hash -709462780, now seen corresponding path program 1 times [2019-10-13 19:11:36,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:36,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670839642] [2019-10-13 19:11:36,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:36,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:36,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,535 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-13 19:11:36,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670839642] [2019-10-13 19:11:36,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:36,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:11:36,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256714770] [2019-10-13 19:11:36,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:11:36,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:11:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:11:36,539 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2019-10-13 19:11:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:36,663 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-13 19:11:36,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:11:36,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-13 19:11:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:36,665 INFO L225 Difference]: With dead ends: 33 [2019-10-13 19:11:36,665 INFO L226 Difference]: Without dead ends: 31 [2019-10-13 19:11:36,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:11:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-13 19:11:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-10-13 19:11:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-13 19:11:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-13 19:11:36,673 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2019-10-13 19:11:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:36,673 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-13 19:11:36,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:11:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-13 19:11:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:11:36,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:36,675 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:36,675 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:36,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:36,675 INFO L82 PathProgramCache]: Analyzing trace with hash -66753378, now seen corresponding path program 1 times [2019-10-13 19:11:36,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:36,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415991518] [2019-10-13 19:11:36,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:36,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:36,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:36,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415991518] [2019-10-13 19:11:36,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750513338] [2019-10-13 19:11:36,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 19:11:37,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:37,099 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-13 19:11:37,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,124 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-13 19:11:37,125 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,135 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,136 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-13 19:11:37,165 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-13 19:11:37,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,179 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-13 19:11:37,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,189 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-13 19:11:37,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 19:11:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:37,199 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:37,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2019-10-13 19:11:37,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659867743] [2019-10-13 19:11:37,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 19:11:37,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:37,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 19:11:37,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 19:11:37,205 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 7 states. [2019-10-13 19:11:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:37,354 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-13 19:11:37,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 19:11:37,355 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-13 19:11:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:37,356 INFO L225 Difference]: With dead ends: 37 [2019-10-13 19:11:37,356 INFO L226 Difference]: Without dead ends: 27 [2019-10-13 19:11:37,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:11:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-13 19:11:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-10-13 19:11:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-13 19:11:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-13 19:11:37,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-13 19:11:37,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:37,370 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-13 19:11:37,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 19:11:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-13 19:11:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 19:11:37,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:37,371 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:37,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:37,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:37,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1381959275, now seen corresponding path program 1 times [2019-10-13 19:11:37,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:37,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279963877] [2019-10-13 19:11:37,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:37,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:37,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:37,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279963877] [2019-10-13 19:11:37,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427368999] [2019-10-13 19:11:37,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-13 19:11:37,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:37,901 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-13 19:11:37,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:37,974 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,975 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-13 19:11:37,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,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, 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-13 19:11:37,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-13 19:11:38,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:38,045 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-13 19:11:38,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-13 19:11:38,101 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:38,101 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 30 treesize of output 18 [2019-10-13 19:11:38,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,112 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-13 19:11:38,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2019-10-13 19:11:38,157 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-13 19:11:38,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,164 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-13 19:11:38,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-13 19:11:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:38,167 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:38,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-13 19:11:38,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669795958] [2019-10-13 19:11:38,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 19:11:38,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 19:11:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:11:38,171 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 14 states. [2019-10-13 19:11:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:38,570 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2019-10-13 19:11:38,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:11:38,570 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-10-13 19:11:38,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:38,571 INFO L225 Difference]: With dead ends: 37 [2019-10-13 19:11:38,572 INFO L226 Difference]: Without dead ends: 35 [2019-10-13 19:11:38,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:11:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-13 19:11:38,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-13 19:11:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 19:11:38,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-13 19:11:38,584 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2019-10-13 19:11:38,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:38,585 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-13 19:11:38,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 19:11:38,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-13 19:11:38,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 19:11:38,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:38,586 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:38,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:38,793 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1602875945, now seen corresponding path program 1 times [2019-10-13 19:11:38,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:38,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023828088] [2019-10-13 19:11:38,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:38,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:38,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:39,058 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-13 19:11:39,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023828088] [2019-10-13 19:11:39,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354985751] [2019-10-13 19:11:39,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:39,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-13 19:11:39,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:39,188 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-13 19:11:39,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,195 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:39,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,210 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-13 19:11:39,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-13 19:11:39,243 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 11 treesize of output 7 [2019-10-13 19:11:39,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,260 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 11 treesize of output 7 [2019-10-13 19:11:39,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,279 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-13 19:11:39,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-13 19:11:39,300 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-13 19:11:39,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,334 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-13 19:11:39,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,362 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 30 treesize of output 11 [2019-10-13 19:11:39,362 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,387 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 30 treesize of output 33 [2019-10-13 19:11:39,388 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,411 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,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 64 treesize of output 66 [2019-10-13 19:11:39,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:39,432 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,467 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2019-10-13 19:11:39,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,468 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:141, output treesize:52 [2019-10-13 19:11:39,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,510 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 49 treesize of output 36 [2019-10-13 19:11:39,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,531 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-10-13 19:11:39,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 22 treesize of output 10 [2019-10-13 19:11:39,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,542 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-13 19:11:39,543 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:11 [2019-10-13 19:11:39,555 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-13 19:11:39,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,560 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-13 19:11:39,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 19:11:39,563 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-13 19:11:39,564 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:39,564 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-10-13 19:11:39,564 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153106227] [2019-10-13 19:11:39,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:11:39,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:39,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:11:39,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:11:39,566 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2019-10-13 19:11:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:39,872 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-10-13 19:11:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:11:39,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-10-13 19:11:39,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:39,874 INFO L225 Difference]: With dead ends: 40 [2019-10-13 19:11:39,874 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 19:11:39,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:11:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 19:11:39,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-10-13 19:11:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 19:11:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-13 19:11:39,880 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2019-10-13 19:11:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:39,881 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-13 19:11:39,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:11:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-13 19:11:39,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 19:11:39,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:39,882 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:40,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:40,086 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:40,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:40,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1006799954, now seen corresponding path program 2 times [2019-10-13 19:11:40,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:40,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411599770] [2019-10-13 19:11:40,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:40,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:40,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:40,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:40,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411599770] [2019-10-13 19:11:40,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586854281] [2019-10-13 19:11:40,252 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:40,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:11:40,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:40,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-13 19:11:40,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:40,362 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-13 19:11:40,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:40,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,388 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-13 19:11:40,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,402 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 11 treesize of output 7 [2019-10-13 19:11:40,403 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,418 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-13 19:11:40,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:40,430 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-13 19:11:40,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-13 19:11:40,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:40,470 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-13 19:11:40,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,482 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,482 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-10-13 19:11:40,520 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:40,521 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-13 19:11:40,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,531 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-13 19:11:40,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-13 19:11:40,639 INFO L341 Elim1Store]: treesize reduction 27, result has 69.7 percent of original size [2019-10-13 19:11:40,639 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 33 treesize of output 75 [2019-10-13 19:11:40,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,682 INFO L567 ElimStorePlain]: treesize reduction 39, result has 48.7 percent of original size [2019-10-13 19:11:40,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:40,685 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-13 19:11:40,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:37 [2019-10-13 19:11:40,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:40,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:40,729 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-13 19:11:40,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:40,748 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 33 treesize of output 37 [2019-10-13 19:11:40,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,766 INFO L567 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2019-10-13 19:11:40,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:40,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:3 [2019-10-13 19:11:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:40,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:40,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2019-10-13 19:11:40,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026098811] [2019-10-13 19:11:40,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-13 19:11:40,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:40,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-13 19:11:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-13 19:11:40,772 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 14 states. [2019-10-13 19:11:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:41,259 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-10-13 19:11:41,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:11:41,260 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-10-13 19:11:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:41,261 INFO L225 Difference]: With dead ends: 47 [2019-10-13 19:11:41,261 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 19:11:41,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:11:41,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 19:11:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-10-13 19:11:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 19:11:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2019-10-13 19:11:41,268 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2019-10-13 19:11:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:41,268 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2019-10-13 19:11:41,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-13 19:11:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2019-10-13 19:11:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:11:41,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:41,270 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:41,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:41,474 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:41,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash 173981419, now seen corresponding path program 2 times [2019-10-13 19:11:41,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:41,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262040957] [2019-10-13 19:11:41,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:41,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:41,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:41,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262040957] [2019-10-13 19:11:41,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692619364] [2019-10-13 19:11:41,739 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:41,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:11:41,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:41,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-13 19:11:41,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:41,858 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-13 19:11:41,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:41,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,880 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-13 19:11:41,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-13 19:11:41,903 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 11 treesize of output 7 [2019-10-13 19:11:41,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,925 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 11 treesize of output 7 [2019-10-13 19:11:41,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,939 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-13 19:11:41,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-13 19:11:41,953 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-13 19:11:41,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,986 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 77 treesize of output 71 [2019-10-13 19:11:41,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,989 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-13 19:11:42,040 INFO L567 ElimStorePlain]: treesize reduction 85, result has 50.9 percent of original size [2019-10-13 19:11:42,042 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-13 19:11:42,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:42,063 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 30 treesize of output 33 [2019-10-13 19:11:42,063 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:42,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:42,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:42,080 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:41 [2019-10-13 19:11:42,139 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:11:42,157 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-13 19:11:42,158 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 65 treesize of output 45 [2019-10-13 19:11:42,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:42,162 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-13 19:11:42,189 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2019-10-13 19:11:42,202 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:42,203 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-13 19:11:42,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:42,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:42,209 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-13 19:11:42,209 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-13 19:11:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:42,214 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:42,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-13 19:11:42,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231787679] [2019-10-13 19:11:42,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:11:42,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:42,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:11:42,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:11:42,215 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 12 states. [2019-10-13 19:11:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:42,517 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-10-13 19:11:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:11:42,517 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-13 19:11:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:42,518 INFO L225 Difference]: With dead ends: 49 [2019-10-13 19:11:42,518 INFO L226 Difference]: Without dead ends: 36 [2019-10-13 19:11:42,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:11:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-13 19:11:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-10-13 19:11:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 19:11:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-10-13 19:11:42,524 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2019-10-13 19:11:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:42,525 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-10-13 19:11:42,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:11:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-10-13 19:11:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:11:42,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:42,526 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:42,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:42,730 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:42,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1825663632, now seen corresponding path program 3 times [2019-10-13 19:11:42,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:42,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495483531] [2019-10-13 19:11:42,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:42,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:42,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:43,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495483531] [2019-10-13 19:11:43,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357407644] [2019-10-13 19:11:43,069 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:43,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-13 19:11:43,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:43,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-13 19:11:43,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:43,194 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-13 19:11:43,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:43,227 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,227 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-13 19:11:43,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,263 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:11:43,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-13 19:11:43,278 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 11 treesize of output 7 [2019-10-13 19:11:43,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,304 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 11 treesize of output 7 [2019-10-13 19:11:43,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,318 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-13 19:11:43,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-13 19:11:43,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,342 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-13 19:11:43,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,373 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_48|], 2=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_50|]} [2019-10-13 19:11:43,384 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 11 treesize of output 7 [2019-10-13 19:11:43,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,415 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 23 treesize of output 11 [2019-10-13 19:11:43,416 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,442 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 23 treesize of output 11 [2019-10-13 19:11:43,442 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,460 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:43 [2019-10-13 19:11:43,498 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|], 1=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_50|]} [2019-10-13 19:11:43,503 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 39 treesize of output 15 [2019-10-13 19:11:43,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,539 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,540 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 88 treesize of output 74 [2019-10-13 19:11:43,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,594 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-10-13 19:11:43,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:43,605 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 27 treesize of output 22 [2019-10-13 19:11:43,605 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,627 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-13 19:11:43,627 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:129, output treesize:83 [2019-10-13 19:11:43,691 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_47|], 4=[|v_#memory_int_50|], 5=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_52|]} [2019-10-13 19:11:43,741 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-13 19:11:43,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,802 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-13 19:11:43,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:43,867 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 82 treesize of output 38 [2019-10-13 19:11:43,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:43,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,931 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 134 [2019-10-13 19:11:43,932 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,983 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,983 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 126 treesize of output 118 [2019-10-13 19:11:43,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,989 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:44,069 INFO L567 ElimStorePlain]: treesize reduction 184, result has 42.7 percent of original size [2019-10-13 19:11:44,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:44,070 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:315, output treesize:106 [2019-10-13 19:11:44,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:44,135 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 73 [2019-10-13 19:11:44,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:44,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:44,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:44,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:44,141 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-13 19:11:44,187 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-10-13 19:11:44,192 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-13 19:11:44,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:44,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:44,206 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-13 19:11:44,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:117, output treesize:22 [2019-10-13 19:11:44,241 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 22 treesize of output 10 [2019-10-13 19:11:44,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:44,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:44,248 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-13 19:11:44,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-10-13 19:11:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:44,254 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:44,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2019-10-13 19:11:44,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408305773] [2019-10-13 19:11:44,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-13 19:11:44,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:44,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-13 19:11:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-13 19:11:44,256 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2019-10-13 19:11:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:44,813 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-10-13 19:11:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 19:11:44,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-10-13 19:11:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:44,819 INFO L225 Difference]: With dead ends: 47 [2019-10-13 19:11:44,819 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 19:11:44,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:11:44,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 19:11:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2019-10-13 19:11:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 19:11:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-13 19:11:44,826 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 25 [2019-10-13 19:11:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:44,826 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-13 19:11:44,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-13 19:11:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-13 19:11:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:11:44,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:44,827 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:45,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:45,032 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash -82655559, now seen corresponding path program 3 times [2019-10-13 19:11:45,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:45,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625715393] [2019-10-13 19:11:45,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:45,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:45,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:45,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625715393] [2019-10-13 19:11:45,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821709153] [2019-10-13 19:11:45,297 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:45,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 19:11:45,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:45,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-13 19:11:45,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:45,464 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-13 19:11:45,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,469 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:45,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,486 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-13 19:11:45,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,501 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 11 treesize of output 7 [2019-10-13 19:11:45,501 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,511 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-10-13 19:11:45,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:45,553 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-13 19:11:45,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-13 19:11:45,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:45,581 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-13 19:11:45,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-10-13 19:11:45,624 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:45,624 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-13 19:11:45,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,632 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-13 19:11:45,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-13 19:11:45,689 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,690 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-13 19:11:45,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,733 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-10-13 19:11:45,735 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-13 19:11:45,735 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-10-13 19:11:45,815 INFO L341 Elim1Store]: treesize reduction 20, result has 64.3 percent of original size [2019-10-13 19:11:45,816 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 37 treesize of output 59 [2019-10-13 19:11:45,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,855 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.9 percent of original size [2019-10-13 19:11:45,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,857 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-13 19:11:45,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:40 [2019-10-13 19:11:45,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,954 INFO L341 Elim1Store]: treesize reduction 27, result has 69.7 percent of original size [2019-10-13 19:11:45,955 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 33 treesize of output 75 [2019-10-13 19:11:45,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,998 INFO L567 ElimStorePlain]: treesize reduction 39, result has 48.7 percent of original size [2019-10-13 19:11:45,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:46,000 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-13 19:11:46,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:37 [2019-10-13 19:11:46,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:46,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:46,045 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:46,045 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 33 treesize of output 37 [2019-10-13 19:11:46,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:46,050 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-13 19:11:46,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:46,062 INFO L567 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2019-10-13 19:11:46,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:46,063 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:3 [2019-10-13 19:11:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 19:11:46,068 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:46,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 18 [2019-10-13 19:11:46,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162035809] [2019-10-13 19:11:46,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 19:11:46,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 19:11:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:11:46,069 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 18 states. [2019-10-13 19:11:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:46,576 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-10-13 19:11:46,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:11:46,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-10-13 19:11:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:46,578 INFO L225 Difference]: With dead ends: 42 [2019-10-13 19:11:46,578 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 19:11:46,578 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-10-13 19:11:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 19:11:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-10-13 19:11:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-13 19:11:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-10-13 19:11:46,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2019-10-13 19:11:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:46,585 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-10-13 19:11:46,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 19:11:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-10-13 19:11:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:11:46,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:46,586 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:46,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:46,792 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:46,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:46,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1370635575, now seen corresponding path program 4 times [2019-10-13 19:11:46,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:46,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024134609] [2019-10-13 19:11:46,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:46,794 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:46,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:47,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024134609] [2019-10-13 19:11:47,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491117533] [2019-10-13 19:11:47,197 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:47,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 19:11:47,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:47,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-13 19:11:47,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:47,329 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-13 19:11:47,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:47,358 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,358 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-13 19:11:47,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,387 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:11:47,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-13 19:11:47,399 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 11 treesize of output 7 [2019-10-13 19:11:47,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,429 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 11 treesize of output 7 [2019-10-13 19:11:47,429 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,446 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-13 19:11:47,446 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-13 19:11:47,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,496 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-13 19:11:47,496 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,577 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.1 percent of original size [2019-10-13 19:11:47,578 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_58|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_56|]} [2019-10-13 19:11:47,584 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 11 treesize of output 7 [2019-10-13 19:11:47,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,622 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 23 treesize of output 11 [2019-10-13 19:11:47,622 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,658 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 23 treesize of output 11 [2019-10-13 19:11:47,659 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,680 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:87, output treesize:55 [2019-10-13 19:11:47,726 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 1=[|v_#memory_$Pointer$.base_57|, |v_#memory_$Pointer$.offset_57|]} [2019-10-13 19:11:47,733 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 39 treesize of output 15 [2019-10-13 19:11:47,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,779 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 86 treesize of output 72 [2019-10-13 19:11:47,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:47,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:47,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,835 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.2 percent of original size [2019-10-13 19:11:47,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:47,843 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 27 treesize of output 22 [2019-10-13 19:11:47,844 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,870 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-13 19:11:47,870 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:137, output treesize:88 [2019-10-13 19:11:47,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:47,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,953 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 33 treesize of output 49 [2019-10-13 19:11:47,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,991 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_60|, |v_#memory_$Pointer$.offset_58|], 5=[|v_#memory_$Pointer$.base_58|]} [2019-10-13 19:11:48,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,009 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 23 treesize of output 22 [2019-10-13 19:11:48,010 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,052 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 23 treesize of output 11 [2019-10-13 19:11:48,053 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,124 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-13 19:11:48,143 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 86 treesize of output 68 [2019-10-13 19:11:48,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,149 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-13 19:11:48,207 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2019-10-13 19:11:48,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,208 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:134, output treesize:68 [2019-10-13 19:11:48,256 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_59|], 5=[|v_#memory_$Pointer$.base_59|], 6=[|v_#memory_int_61|]} [2019-10-13 19:11:48,260 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 37 treesize of output 28 [2019-10-13 19:11:48,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,343 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 181 treesize of output 161 [2019-10-13 19:11:48,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,346 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,435 INFO L567 ElimStorePlain]: treesize reduction 84, result has 68.5 percent of original size [2019-10-13 19:11:48,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 33 [2019-10-13 19:11:48,447 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:48,477 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:207, output treesize:148 [2019-10-13 19:11:48,533 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.offset_54|, |v_#memory_$Pointer$.base_54|], 10=[|v_#memory_int_62|], 11=[|v_#memory_$Pointer$.base_60|]} [2019-10-13 19:11:48,542 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 65 treesize of output 11 [2019-10-13 19:11:48,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,607 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 49 treesize of output 34 [2019-10-13 19:11:48,608 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,662 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-13 19:11:48,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,709 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 91 treesize of output 54 [2019-10-13 19:11:48,710 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,981 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-10-13 19:11:48,982 INFO L341 Elim1Store]: treesize reduction 101, result has 64.1 percent of original size [2019-10-13 19:11:48,983 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 209 treesize of output 248 [2019-10-13 19:11:48,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:49,016 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 11 xjuncts. [2019-10-13 19:11:49,391 WARN L191 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-10-13 19:11:49,392 INFO L567 ElimStorePlain]: treesize reduction 7114, result has 3.0 percent of original size [2019-10-13 19:11:49,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:49,394 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:391, output treesize:198 [2019-10-13 19:11:49,456 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 11=[|#memory_$Pointer$.base|]} [2019-10-13 19:11:49,471 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 38 treesize of output 10 [2019-10-13 19:11:49,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,551 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,553 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 172 treesize of output 137 [2019-10-13 19:11:49,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,581 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-13 19:11:49,686 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-10-13 19:11:49,687 INFO L567 ElimStorePlain]: treesize reduction 76, result has 39.2 percent of original size [2019-10-13 19:11:49,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:49,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:209, output treesize:37 [2019-10-13 19:11:49,741 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-13 19:11:49,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-13 19:11:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:49,770 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:49,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 20 [2019-10-13 19:11:49,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868296981] [2019-10-13 19:11:49,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 19:11:49,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 19:11:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:11:49,772 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 20 states. [2019-10-13 19:11:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:51,039 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2019-10-13 19:11:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:11:51,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2019-10-13 19:11:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:51,050 INFO L225 Difference]: With dead ends: 66 [2019-10-13 19:11:51,050 INFO L226 Difference]: Without dead ends: 64 [2019-10-13 19:11:51,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-10-13 19:11:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-13 19:11:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2019-10-13 19:11:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:11:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2019-10-13 19:11:51,074 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2019-10-13 19:11:51,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:51,074 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-10-13 19:11:51,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 19:11:51,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2019-10-13 19:11:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:11:51,078 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:51,078 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:51,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:51,296 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1682132144, now seen corresponding path program 5 times [2019-10-13 19:11:51,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:51,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392967418] [2019-10-13 19:11:51,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:51,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:51,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:52,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392967418] [2019-10-13 19:11:52,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282187612] [2019-10-13 19:11:52,066 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:52,287 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-10-13 19:11:52,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:52,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-13 19:11:52,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:52,307 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-13 19:11:52,308 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:11:52,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,398 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-13 19:11:52,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,438 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-13 19:11:52,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-13 19:11:52,495 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-13 19:11:52,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,529 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-13 19:11:52,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,551 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-13 19:11:52,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:54 [2019-10-13 19:11:52,630 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,631 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-13 19:11:52,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,700 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-13 19:11:52,701 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 45 treesize of output 31 [2019-10-13 19:11:52,701 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,756 INFO L567 ElimStorePlain]: treesize reduction 10, result has 85.3 percent of original size [2019-10-13 19:11:52,761 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 34 treesize of output 16 [2019-10-13 19:11:52,762 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,782 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:92, output treesize:43 [2019-10-13 19:11:52,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,878 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 125 treesize of output 131 [2019-10-13 19:11:52,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:52,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 19:11:52,968 INFO L567 ElimStorePlain]: treesize reduction 130, result has 49.8 percent of original size [2019-10-13 19:11:52,973 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 124 treesize of output 96 [2019-10-13 19:11:52,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:53,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:53,003 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-13 19:11:53,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:138, output treesize:133 [2019-10-13 19:11:53,074 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_61|, |v_#memory_$Pointer$.offset_61|], 6=[|v_#memory_$Pointer$.offset_65|, |v_#memory_$Pointer$.base_65|]} [2019-10-13 19:11:53,079 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-13 19:11:53,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:53,122 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-13 19:11:53,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:53,277 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-13 19:11:53,278 INFO L341 Elim1Store]: treesize reduction 70, result has 66.7 percent of original size [2019-10-13 19:11:53,278 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 259 [2019-10-13 19:11:53,280 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:53,340 INFO L567 ElimStorePlain]: treesize reduction 123, result has 52.3 percent of original size [2019-10-13 19:11:53,445 INFO L341 Elim1Store]: treesize reduction 9, result has 92.2 percent of original size [2019-10-13 19:11:53,445 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 126 treesize of output 159 [2019-10-13 19:11:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:53,459 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2019-10-13 19:11:53,567 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-10-13 19:11:53,567 INFO L567 ElimStorePlain]: treesize reduction 1772, result has 7.1 percent of original size [2019-10-13 19:11:53,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:53,568 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:435, output treesize:101 [2019-10-13 19:11:53,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:11:53,888 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-10-13 19:11:53,888 INFO L341 Elim1Store]: treesize reduction 8, result has 93.8 percent of original size [2019-10-13 19:11:53,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 182 treesize of output 199 [2019-10-13 19:11:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,964 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-13 19:11:54,021 INFO L567 ElimStorePlain]: treesize reduction 165, result has 26.7 percent of original size [2019-10-13 19:11:54,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:54,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 39 [2019-10-13 19:11:54,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:54,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:54,044 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-13 19:11:54,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:191, output treesize:7 [2019-10-13 19:11:54,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:54,071 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:54,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2019-10-13 19:11:54,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326698212] [2019-10-13 19:11:54,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 19:11:54,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:54,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 19:11:54,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:11:54,073 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 22 states. [2019-10-13 19:11:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:54,643 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2019-10-13 19:11:54,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 19:11:54,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-13 19:11:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:54,644 INFO L225 Difference]: With dead ends: 61 [2019-10-13 19:11:54,645 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 19:11:54,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2019-10-13 19:11:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 19:11:54,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-10-13 19:11:54,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-13 19:11:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-10-13 19:11:54,651 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 31 [2019-10-13 19:11:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:54,652 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-10-13 19:11:54,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 19:11:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-10-13 19:11:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:11:54,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:54,653 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:54,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:54,859 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:54,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:54,859 INFO L82 PathProgramCache]: Analyzing trace with hash -345469767, now seen corresponding path program 6 times [2019-10-13 19:11:54,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:54,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936523981] [2019-10-13 19:11:54,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:54,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:54,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:55,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936523981] [2019-10-13 19:11:55,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426988497] [2019-10-13 19:11:55,416 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:55,564 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-10-13 19:11:55,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:55,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 75 conjunts are in the unsatisfiable core [2019-10-13 19:11:55,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:55,582 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-13 19:11:55,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:55,610 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,610 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-13 19:11:55,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,639 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:11:55,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-13 19:11:55,649 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 11 treesize of output 7 [2019-10-13 19:11:55,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,670 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 11 treesize of output 7 [2019-10-13 19:11:55,671 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,686 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-13 19:11:55,686 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-13 19:11:55,725 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,726 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-13 19:11:55,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,802 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-10-13 19:11:55,813 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 23 treesize of output 11 [2019-10-13 19:11:55,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,849 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 23 treesize of output 11 [2019-10-13 19:11:55,850 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,872 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:51 [2019-10-13 19:11:55,937 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,938 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 86 treesize of output 72 [2019-10-13 19:11:55,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:55,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,034 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-10-13 19:11:56,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,045 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 27 treesize of output 22 [2019-10-13 19:11:56,045 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,079 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-13 19:11:56,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-10-13 19:11:56,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,183 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,183 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 33 treesize of output 49 [2019-10-13 19:11:56,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,241 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 5=[|v_#memory_$Pointer$.offset_70|, |v_#memory_$Pointer$.base_70|]} [2019-10-13 19:11:56,248 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-13 19:11:56,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2019-10-13 19:11:56,307 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,363 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 1 case distinctions, treesize of input 86 treesize of output 52 [2019-10-13 19:11:56,364 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,432 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.6 percent of original size [2019-10-13 19:11:56,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,433 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:145, output treesize:71 [2019-10-13 19:11:56,516 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_64|], 5=[|v_#memory_$Pointer$.offset_71|, |v_#memory_$Pointer$.base_71|]} [2019-10-13 19:11:56,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,525 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 83 treesize of output 27 [2019-10-13 19:11:56,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,568 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 106 [2019-10-13 19:11:56,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,631 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,632 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 132 treesize of output 112 [2019-10-13 19:11:56,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,634 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,693 INFO L567 ElimStorePlain]: treesize reduction 100, result has 51.5 percent of original size [2019-10-13 19:11:56,694 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-13 19:11:56,694 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:255, output treesize:112 [2019-10-13 19:11:56,748 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_66|, |v_#memory_$Pointer$.base_66|], 4=[|v_#memory_int_65|], 5=[|v_#memory_$Pointer$.offset_72|], 9=[|v_#memory_$Pointer$.base_72|]} [2019-10-13 19:11:56,752 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-13 19:11:56,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,804 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-13 19:11:56,844 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,852 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 74 treesize of output 38 [2019-10-13 19:11:56,853 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 65 [2019-10-13 19:11:56,897 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:57,120 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-13 19:11:57,120 INFO L341 Elim1Store]: treesize reduction 95, result has 62.5 percent of original size [2019-10-13 19:11:57,121 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 6 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 225 [2019-10-13 19:11:57,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:57,191 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 9 xjuncts. [2019-10-13 19:11:57,370 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-10-13 19:11:57,370 INFO L567 ElimStorePlain]: treesize reduction 6138, result has 3.1 percent of original size [2019-10-13 19:11:57,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:57,371 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:331, output treesize:158 [2019-10-13 19:11:57,481 INFO L392 ElimStorePlain]: Different costs {11=[|#memory_$Pointer$.offset|], 17=[|#memory_$Pointer$.base|]} [2019-10-13 19:11:57,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:57,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:57,491 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 39 [2019-10-13 19:11:57,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:57,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:57,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:57,556 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 108 [2019-10-13 19:11:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:57,569 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-13 19:11:57,621 INFO L567 ElimStorePlain]: treesize reduction 54, result has 43.8 percent of original size [2019-10-13 19:11:57,622 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-13 19:11:57,623 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:189, output treesize:22 [2019-10-13 19:11:57,663 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-13 19:11:57,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:57,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:57,668 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-13 19:11:57,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-13 19:11:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:57,680 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:57,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 22 [2019-10-13 19:11:57,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247490034] [2019-10-13 19:11:57,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 19:11:57,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 19:11:57,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:11:57,681 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 22 states. [2019-10-13 19:11:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:58,517 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-10-13 19:11:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 19:11:58,517 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2019-10-13 19:11:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:58,518 INFO L225 Difference]: With dead ends: 57 [2019-10-13 19:11:58,519 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 19:11:58,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2019-10-13 19:11:58,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 19:11:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-10-13 19:11:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-13 19:11:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-10-13 19:11:58,527 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 32 [2019-10-13 19:11:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:58,527 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-10-13 19:11:58,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 19:11:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-10-13 19:11:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:11:58,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:58,529 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:58,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:58,740 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1143325495, now seen corresponding path program 7 times [2019-10-13 19:11:58,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:58,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028022016] [2019-10-13 19:11:58,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:59,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028022016] [2019-10-13 19:11:59,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109827707] [2019-10-13 19:11:59,371 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2019-10-13 19:11:59,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:59,524 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-13 19:11:59,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:59,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,550 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-13 19:11:59,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,573 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:11:59,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-13 19:11:59,583 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 11 treesize of output 7 [2019-10-13 19:11:59,584 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,603 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 11 treesize of output 7 [2019-10-13 19:11:59,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,620 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,620 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-13 19:11:59,621 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-13 19:11:59,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,688 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-13 19:11:59,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,772 INFO L567 ElimStorePlain]: treesize reduction 28, result has 74.3 percent of original size [2019-10-13 19:11:59,780 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 23 treesize of output 11 [2019-10-13 19:11:59,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,814 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 23 treesize of output 11 [2019-10-13 19:11:59,815 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,838 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:79, output treesize:51 [2019-10-13 19:11:59,922 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 27 treesize of output 22 [2019-10-13 19:11:59,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 68 [2019-10-13 19:11:59,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:59,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:59,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,017 INFO L567 ElimStorePlain]: treesize reduction 8, result has 91.5 percent of original size [2019-10-13 19:12:00,018 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-13 19:12:00,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:110, output treesize:99 [2019-10-13 19:12:00,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:00,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,108 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 33 treesize of output 49 [2019-10-13 19:12:00,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:00,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:00,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:00,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 28 [2019-10-13 19:12:00,153 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,227 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-13 19:12:00,227 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 75 [2019-10-13 19:12:00,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,231 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-13 19:12:00,289 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.1 percent of original size [2019-10-13 19:12:00,290 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,290 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:137, output treesize:75 [2019-10-13 19:12:00,407 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,408 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 3 case distinctions, treesize of input 184 treesize of output 159 [2019-10-13 19:12:00,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:00,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:00,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:00,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,546 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-10-13 19:12:00,547 INFO L567 ElimStorePlain]: treesize reduction 1371, result has 10.4 percent of original size [2019-10-13 19:12:00,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,591 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 3 case distinctions, treesize of input 143 treesize of output 212 [2019-10-13 19:12:00,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,649 INFO L567 ElimStorePlain]: treesize reduction 76, result has 58.2 percent of original size [2019-10-13 19:12:00,649 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-13 19:12:00,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:198, output treesize:127 [2019-10-13 19:12:00,702 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 2=[|v_#memory_$Pointer$.base_73|, |v_#memory_$Pointer$.offset_73|], 9=[|v_#memory_$Pointer$.base_79|, |v_#memory_$Pointer$.offset_79|]} [2019-10-13 19:12:00,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:00,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 31 [2019-10-13 19:12:00,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,756 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-13 19:12:00,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,797 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-13 19:12:00,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:01,034 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-10-13 19:12:01,035 INFO L341 Elim1Store]: treesize reduction 69, result has 70.1 percent of original size [2019-10-13 19:12:01,035 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 8 new quantified variables, introduced 7 case distinctions, treesize of input 246 treesize of output 255 [2019-10-13 19:12:01,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:01,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:01,212 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2019-10-13 19:12:01,613 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-10-13 19:12:01,613 INFO L567 ElimStorePlain]: treesize reduction 10866, result has 2.3 percent of original size [2019-10-13 19:12:01,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:01,637 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:01,638 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 236 [2019-10-13 19:12:01,639 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:01,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:01,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:01,671 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:439, output treesize:154 [2019-10-13 19:12:01,866 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:02,030 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-13 19:12:02,030 INFO L341 Elim1Store]: treesize reduction 24, result has 83.1 percent of original size [2019-10-13 19:12:02,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 218 treesize of output 210 [2019-10-13 19:12:02,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,231 INFO L496 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:02,327 INFO L567 ElimStorePlain]: treesize reduction 155, result has 34.6 percent of original size [2019-10-13 19:12:02,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 42 [2019-10-13 19:12:02,342 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,358 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-13 19:12:02,359 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:225, output treesize:11 [2019-10-13 19:12:02,386 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-13 19:12:02,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,388 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,388 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-13 19:12:02,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-13 19:12:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:02,399 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:02,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 24 [2019-10-13 19:12:02,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642497710] [2019-10-13 19:12:02,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-13 19:12:02,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-13 19:12:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2019-10-13 19:12:02,400 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 24 states. [2019-10-13 19:12:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:03,449 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-13 19:12:03,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:12:03,449 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2019-10-13 19:12:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:03,450 INFO L225 Difference]: With dead ends: 60 [2019-10-13 19:12:03,451 INFO L226 Difference]: Without dead ends: 58 [2019-10-13 19:12:03,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2019-10-13 19:12:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-13 19:12:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-10-13 19:12:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 19:12:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2019-10-13 19:12:03,460 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 35 [2019-10-13 19:12:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:03,460 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2019-10-13 19:12:03,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-13 19:12:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2019-10-13 19:12:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:12:03,461 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:03,461 INFO L380 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:03,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:03,666 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:03,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:03,666 INFO L82 PathProgramCache]: Analyzing trace with hash -822332832, now seen corresponding path program 8 times [2019-10-13 19:12:03,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:03,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359167634] [2019-10-13 19:12:03,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:03,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:03,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:04,270 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-13 19:12:04,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359167634] [2019-10-13 19:12:04,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468696813] [2019-10-13 19:12:04,270 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:04,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:04,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:04,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 84 conjunts are in the unsatisfiable core [2019-10-13 19:12:04,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:04,406 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-13 19:12:04,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,410 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:04,439 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,439 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-13 19:12:04,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,470 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:12:04,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-13 19:12:04,476 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 11 treesize of output 7 [2019-10-13 19:12:04,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,498 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 11 treesize of output 7 [2019-10-13 19:12:04,499 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,515 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-13 19:12:04,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-13 19:12:04,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,569 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-13 19:12:04,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,652 INFO L567 ElimStorePlain]: treesize reduction 28, result has 73.6 percent of original size [2019-10-13 19:12:04,659 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 23 treesize of output 11 [2019-10-13 19:12:04,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,690 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 23 treesize of output 11 [2019-10-13 19:12:04,691 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,711 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:76, output treesize:48 [2019-10-13 19:12:04,771 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,772 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 86 treesize of output 72 [2019-10-13 19:12:04,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:04,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:04,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,834 INFO L567 ElimStorePlain]: treesize reduction 8, result has 92.2 percent of original size [2019-10-13 19:12:04,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-10-13 19:12:04,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:04,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,865 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-13 19:12:04,865 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:88 [2019-10-13 19:12:04,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:04,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:04,972 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 case distinctions, treesize of input 39 treesize of output 159 [2019-10-13 19:12:04,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,107 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-10-13 19:12:05,108 INFO L567 ElimStorePlain]: treesize reduction 78, result has 66.9 percent of original size [2019-10-13 19:12:05,110 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_67|], 5=[|v_#memory_$Pointer$.base_84|, |v_#memory_$Pointer$.offset_84|]} [2019-10-13 19:12:05,117 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-13 19:12:05,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,234 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-13 19:12:05,234 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 108 treesize of output 78 [2019-10-13 19:12:05,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,239 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-13 19:12:05,330 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.7 percent of original size [2019-10-13 19:12:05,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,335 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 30 treesize of output 21 [2019-10-13 19:12:05,336 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,374 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:92 [2019-10-13 19:12:05,441 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_68|], 5=[|v_#memory_$Pointer$.base_85|, |v_#memory_$Pointer$.offset_85|]} [2019-10-13 19:12:05,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,448 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 83 treesize of output 27 [2019-10-13 19:12:05,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,546 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 3 case distinctions, treesize of input 193 treesize of output 160 [2019-10-13 19:12:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,658 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-13 19:12:05,659 INFO L567 ElimStorePlain]: treesize reduction 100, result has 67.2 percent of original size [2019-10-13 19:12:05,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,665 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 91 [2019-10-13 19:12:05,666 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,708 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-13 19:12:05,709 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:276, output treesize:231 [2019-10-13 19:12:05,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,816 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 82 [2019-10-13 19:12:05,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,872 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_69|], 5=[|v_#memory_$Pointer$.offset_86|], 11=[|v_#memory_$Pointer$.base_86|]} [2019-10-13 19:12:05,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,878 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 35 treesize of output 34 [2019-10-13 19:12:05,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,982 INFO L341 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2019-10-13 19:12:05,982 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 2 case distinctions, treesize of input 187 treesize of output 158 [2019-10-13 19:12:05,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:05,985 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-13 19:12:06,080 INFO L567 ElimStorePlain]: treesize reduction 20, result has 91.4 percent of original size [2019-10-13 19:12:06,202 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-13 19:12:06,202 INFO L341 Elim1Store]: treesize reduction 64, result has 57.3 percent of original size [2019-10-13 19:12:06,203 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 141 [2019-10-13 19:12:06,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,216 INFO L496 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:06,323 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-10-13 19:12:06,324 INFO L567 ElimStorePlain]: treesize reduction 62, result has 59.5 percent of original size [2019-10-13 19:12:06,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,325 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:277, output treesize:146 [2019-10-13 19:12:06,405 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.offset_87|], 6=[|v_#memory_int_70|], 11=[|v_#memory_$Pointer$.base_87|]} [2019-10-13 19:12:06,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,445 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 2 case distinctions, treesize of input 406 treesize of output 361 [2019-10-13 19:12:06,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:06,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 19:12:06,641 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2019-10-13 19:12:06,641 INFO L567 ElimStorePlain]: treesize reduction 898, result has 32.7 percent of original size [2019-10-13 19:12:06,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:06,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 301 [2019-10-13 19:12:06,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,798 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 336 treesize of output 233 [2019-10-13 19:12:06,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:06,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,809 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,971 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-10-13 19:12:06,971 INFO L567 ElimStorePlain]: treesize reduction 2187, result has 12.9 percent of original size [2019-10-13 19:12:06,972 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:06,973 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:461, output treesize:374 [2019-10-13 19:12:07,061 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_80|, |v_#memory_$Pointer$.base_80|], 5=[|v_#memory_$Pointer$.offset_88|], 10=[|v_#memory_int_71|], 19=[|v_#memory_$Pointer$.base_88|]} [2019-10-13 19:12:07,066 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-13 19:12:07,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:07,165 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-13 19:12:07,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:07,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:07,346 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-10-13 19:12:07,346 INFO L341 Elim1Store]: treesize reduction 82, result has 57.7 percent of original size [2019-10-13 19:12:07,347 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 562 treesize of output 509 [2019-10-13 19:12:07,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,350 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:07,503 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-10-13 19:12:07,503 INFO L567 ElimStorePlain]: treesize reduction 100, result has 85.6 percent of original size [2019-10-13 19:12:07,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:07,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 94 [2019-10-13 19:12:07,510 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:07,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:07,962 WARN L191 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 103 [2019-10-13 19:12:07,963 INFO L341 Elim1Store]: treesize reduction 126, result has 67.4 percent of original size [2019-10-13 19:12:07,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 11 case distinctions, treesize of input 512 treesize of output 367 [2019-10-13 19:12:07,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:07,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:07,988 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 5 xjuncts. [2019-10-13 19:12:08,366 WARN L191 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2019-10-13 19:12:08,367 INFO L567 ElimStorePlain]: treesize reduction 7463, result has 6.5 percent of original size [2019-10-13 19:12:08,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:08,368 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:785, output treesize:452 [2019-10-13 19:12:08,544 INFO L392 ElimStorePlain]: Different costs {11=[|#memory_$Pointer$.offset|], 29=[|#memory_$Pointer$.base|]} [2019-10-13 19:12:08,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:08,579 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 455 treesize of output 389 [2019-10-13 19:12:08,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,684 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-10-13 19:12:08,685 INFO L567 ElimStorePlain]: treesize reduction 38, result has 89.4 percent of original size [2019-10-13 19:12:08,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 320 treesize of output 216 [2019-10-13 19:12:08,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,813 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:08,900 INFO L567 ElimStorePlain]: treesize reduction 136, result has 31.3 percent of original size [2019-10-13 19:12:08,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:08,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:483, output treesize:34 [2019-10-13 19:12:08,949 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-10-13 19:12:08,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2019-10-13 19:12:08,970 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-13 19:12:08,971 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:08,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2019-10-13 19:12:08,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008885902] [2019-10-13 19:12:08,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 19:12:08,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:08,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 19:12:08,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-10-13 19:12:08,972 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 26 states. [2019-10-13 19:12:09,486 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2019-10-13 19:12:09,659 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-13 19:12:09,923 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 85 [2019-10-13 19:12:10,242 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 88 [2019-10-13 19:12:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:11,026 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-10-13 19:12:11,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 19:12:11,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-10-13 19:12:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:11,028 INFO L225 Difference]: With dead ends: 73 [2019-10-13 19:12:11,028 INFO L226 Difference]: Without dead ends: 71 [2019-10-13 19:12:11,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=196, Invalid=1526, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 19:12:11,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-13 19:12:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2019-10-13 19:12:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-13 19:12:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2019-10-13 19:12:11,039 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 36 [2019-10-13 19:12:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:11,040 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2019-10-13 19:12:11,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 19:12:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2019-10-13 19:12:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 19:12:11,041 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:11,041 INFO L380 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:11,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:11,245 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1004692923, now seen corresponding path program 9 times [2019-10-13 19:12:11,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:11,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145034644] [2019-10-13 19:12:11,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 19:12:11,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145034644] [2019-10-13 19:12:11,599 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641035548] [2019-10-13 19:12:11,599 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:11,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-13 19:12:11,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:11,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 101 conjunts are in the unsatisfiable core [2019-10-13 19:12:11,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:11,979 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-13 19:12:11,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:11,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:11,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:11,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:12,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,005 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-13 19:12:12,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,032 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:12:12,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-13 19:12:12,039 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 11 treesize of output 7 [2019-10-13 19:12:12,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,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, 1 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-13 19:12:12,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,078 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-13 19:12:12,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-10-13 19:12:12,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,114 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-13 19:12:12,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,150 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_72|], 2=[|v_#memory_$Pointer$.offset_91|, |v_#memory_$Pointer$.base_91|]} [2019-10-13 19:12:12,154 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 11 treesize of output 7 [2019-10-13 19:12:12,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,183 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 23 treesize of output 11 [2019-10-13 19:12:12,184 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,209 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 23 treesize of output 11 [2019-10-13 19:12:12,209 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,226 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,227 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:43 [2019-10-13 19:12:12,262 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_73|], 1=[|v_#memory_$Pointer$.offset_92|, |v_#memory_$Pointer$.base_92|]} [2019-10-13 19:12:12,265 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 39 treesize of output 15 [2019-10-13 19:12:12,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,297 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 27 treesize of output 22 [2019-10-13 19:12:12,297 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,334 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,334 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 80 treesize of output 70 [2019-10-13 19:12:12,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,335 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,376 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-10-13 19:12:12,377 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-13 19:12:12,377 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:129, output treesize:83 [2019-10-13 19:12:12,410 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_74|], 5=[|v_#memory_$Pointer$.offset_93|, |v_#memory_$Pointer$.base_93|]} [2019-10-13 19:12:12,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,415 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 23 treesize of output 22 [2019-10-13 19:12:12,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,463 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 45 treesize of output 28 [2019-10-13 19:12:12,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,499 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,499 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 77 treesize of output 51 [2019-10-13 19:12:12,500 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,543 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2019-10-13 19:12:12,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,543 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:69 [2019-10-13 19:12:12,588 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_94|, |v_#memory_$Pointer$.offset_94|], 6=[|v_#memory_int_75|]} [2019-10-13 19:12:12,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,628 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 232 treesize of output 183 [2019-10-13 19:12:12,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:12,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:12,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 19:12:12,747 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-13 19:12:12,748 INFO L567 ElimStorePlain]: treesize reduction 724, result has 24.2 percent of original size [2019-10-13 19:12:12,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:12,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, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 176 [2019-10-13 19:12:12,754 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,791 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 66 treesize of output 33 [2019-10-13 19:12:12,791 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:12,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:12,817 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-13 19:12:12,817 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:242, output treesize:106 [2019-10-13 19:12:12,859 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_95|, |v_#memory_int_76|], 9=[|v_#memory_$Pointer$.offset_95|]} [2019-10-13 19:12:12,914 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-10-13 19:12:12,915 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 111 treesize of output 85 [2019-10-13 19:12:12,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:12,921 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-13 19:12:13,003 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.2 percent of original size [2019-10-13 19:12:13,011 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:13,034 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:13,035 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 26 treesize of output 60 [2019-10-13 19:12:13,035 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:13,123 INFO L567 ElimStorePlain]: treesize reduction 32, result has 74.4 percent of original size [2019-10-13 19:12:13,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:13,194 INFO L341 Elim1Store]: treesize reduction 60, result has 43.4 percent of original size [2019-10-13 19:12:13,194 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 44 treesize of output 58 [2019-10-13 19:12:13,195 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:13,262 INFO L567 ElimStorePlain]: treesize reduction 24, result has 75.5 percent of original size [2019-10-13 19:12:13,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:13,263 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:150, output treesize:104 [2019-10-13 19:12:13,319 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_96|], 9=[|v_#memory_$Pointer$.offset_96|], 11=[|v_#memory_int_77|]} [2019-10-13 19:12:13,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:13,360 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 235 treesize of output 207 [2019-10-13 19:12:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:13,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:13,417 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-13 19:12:13,563 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-10-13 19:12:13,564 INFO L567 ElimStorePlain]: treesize reduction 68, result has 71.1 percent of original size